Skip to main content
    • Aa
    • Aa

Algebraic Properties of Modulo q Complete ℓ-Wide Families


Let q be a power of a prime p, and let n, d, ℓ be integers such that 1 ≤ n, 1 ≤ ℓ < q. Consider the modulo q complete ℓ-wide family:

We describe a Gröbner basis of the vanishing ideal I() of the set of characteristic vectors of over fields of characteristic p. It turns out that this set of polynomials is a Gröbner basis for all term orderings ≺, for which the order of the variables is xnxn−1 ≺ ⋅⋅⋅ ≺ x1.

We compute the Hilbert function of I(), which yields formulae for the modulo p rank of certain inclusion matrices related to .

We apply our results to problems from extremal set theory. We prove a sharp upper bound of the cardinality of a modulo q ℓ-wide family, which shatters only small sets. This is closely related to a conjecture of Frankl [13] on certain ℓ-antichains. The formula of the Hilbert function also allows us to obtain an upper bound on the size of a set system with certain restricted intersections, generalizing a bound proposed by Babai and Frankl [6].

The paper generalizes and extends the results of [15], [16] and [17].

Hide All
[1]Adams W. W. and Loustaunau P. (1994) An Introduction to Gröbner Bases, AMS.
[2]Alon N. (1999) Combinatorial Nullstellensatz. Combin. Probab. Comput. 8 729.
[3]Alon N. (2000) Algebraic and probabilistic methods in discrete mathematics. Geom. Funct. Anal. Special Volume, Part II 455–470.
[4]Alon N., Babai L. and Suzuki H. (1991) Multilinear polynomials and Frankl–Ray-Chaudhuri–Wilson type intersection theorems. J. Combin. Theory Ser. A 58 165180.
[5]Anstee R. P., Rónyai L. and Sali A. (2002) Shattering news. Graphs Combin. 18 5973.
[6]Babai L. and Frankl P. (1992) Linear Algebra Methods in Combinatorics, Preliminary Version 2, September 1992.
[7]Babai L., Frankl P., Kutin S. and Štefankovič D. (2001) Set systems with restricted intersections modulo prime powers. J. Combin. Theory Ser. A 95 3973.
[8]Bernasconi A. and Egidi L. (1999) Hilbert function and complexity lower bounds for symmetric Boolean functions. Inform. Comput. 153 125.
[9]Buchberger B. and Winkler F., eds (2001) Gröbner Bases and Applications, Cambridge University Press.
[10]Deza M., Frankl P. and Singhi N. M. (1981) On functions of strength t. Combinatorica 3 331339.
[11]Einstein O. and Hassin R. (2005) The number of solutions sufficient for solving a family of problems. Math. Oper. Res. 30 880896.
[12]Felszeghy B., Ráth B. and Rónyai L. (2006) The lex game and some applications. J. Symbol. Comput. 41 663681.
[13]Frankl P. (1989) Traces of antichains. Graphs Combin. 5 295299.
[14]Frankl P. and Wilson R. M. (1981) Intersection theorems with geometric consequences. Combinatorica 1 357368.
[15]Friedl K., Hegedűs G. and Rónyai L. (2007) Gröbner bases for complete ℓ-wide families. Publicationes Math. Debrecen 70 271290.
[16]Hegedűs G. and Rónyai L. (2003) Gröbner bases for complete uniform families. J. Algebraic Combin. 17 171180.
[17]Hegedűs G. and Rónyai L. (2003) Standard monomials for q-uniform families and a conjecture of Babai and Frankl. Central Europ. J. Math. 1 198207.
[18]Hillar C. J. and Windfeldt T. (2008) Algebraic characterization of uniquely vertex colorable graphs. J. Combin. Theory Ser. B 98 400414.
[19]Qian J. and Ray-Chaudhuri D. K. (2000) On mod-p Alon–Babai–Suzuki inequality. J. Algebraic Combin. 12 8593.
[20]Sauer N. (1972) On the density of families of sets. J. Combin. Theory Ser. A 13 145147.
[21]Shelah S. (1972) A combinatorial problem: Stability and order for models and theories in infinitary languages. Pacific J. Math. 41 247261.
[22]Tao T. and Vu V. (2006) Additive Combinatorics, Vol. 105 of Cambridge Studies in Advanced Mathematics, Cambridge University Press.
[23]Vapnik V. N. and Chervonenkis A. Y. (1971) On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. XVI 264280.
[24]Wilson R. M. (1990) A diagonal form for the incidence matrices of t-subsets vs. k-subsets. Europ. J. Combin. 11 609615.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 5 *
Loading metrics...

Abstract views

Total abstract views: 148 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 20th October 2017. This data will be updated every 24 hours.