Algebra universalis

, 79:2 | Cite as

A note on linear Sperner families

  • Gábor Hegedűs
  • Lajos Rónyai
Part of the following topical collections:
  1. In memory of E. Tamás Schmidt


In an earlier work we described Gröbner bases of the ideal of polynomials over a field, which vanish on the set of characteristic vectors \(\mathbf {v}\in \{0,1\}^n\) of the complete d uniform set family over the ground set [n]. In particular, it turns out that the standard monomials of the above ideal are ballot monomials. We give here a partial extension of this fact. A set family is a linear Sperner system if the characteristic vectors satisfy a linear equation \(a_1v_1+\cdots +a_nv_n=k\), where the \(a_i\) and k are positive integers. We prove that the lexicographic standard monomials for linear Sperner systems are also ballot monomials, provided that \(0<a_1\le a_2\le \cdots \le a_n\). As an application, we confirm a conjecture of Frankl in the special case of linear Sperner systems.


Sperner family Characteristic vector Polynomial function Gröbner basis Standard monomial Ballot monomial Shattering 

Mathematics Subject Classification

Primary 13P25 Secondary 13P10 05D05 



We thank the referee for valuable suggestions.


  1. 1.
    Adams, W.W., Loustaunau, P.: An introduction to Gröbner bases. Graduate Studies in Mathematics, vol. 3. American Mathematical Society, Providence (1994)Google Scholar
  2. 2.
    Anstee, R.P., Rónyai, L., Sali, A.: Shattering news. Gr. Comb. 18, 59–73 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Babai, L., Frankl, P.: Linear algebra methods in combinatorics with applications to geometry and computer science. The University of Chicago, Chicago (1992)Google Scholar
  4. 4.
    Balandraud, É., Girard, B.: A Nullstellensatz for sequences over \(\mathbb{F}_p\). Combinatorica 34, 657–688 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Buchberger, B.: Gröbner-bases: an algorithmic method in polynomial ideal theory. In: Bose, N.K. (ed.) Multidimensional systems theory—progress, directions and open problems in multidimensional systems theory, pp. 184–232. Reidel Publishing Company, Dodrecht (1985)Google Scholar
  6. 6.
    Cohen, A.M., Cuypers, H., Sterk, H. (eds.): Some tapas of computer algebra. Springer, Berlin (1999)Google Scholar
  7. 7.
    Cox, D., Little, J., O’Shea, D.: Ideals, varieties, and algorithms. Springer, Berlin (1992)CrossRefzbMATHGoogle Scholar
  8. 8.
    Felszeghy, B., Ráth, B., Rónyai, L.: The lex game and some applications. J. Symb. Comput. 41, 663–681 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Frankl, P.: Traces of antichains. Gr. Comb. 5, 295–299 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Frankl, P.: Intersection theorems and mod \(p\) rank of inclusion matrices. J. Comb. Theory Ser. A 54, 85–94 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Hegedűs, G., Rónyai, L.: Gröbner bases for complete uniform families. J. Algebraic Combin. 17, 171–180 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Hegedűs, G., Rónyai, L.: Standard monomials for \(q\)-uniform families and a conjecture of Babai and Frankl. Cent. Eur. J. Math. 1, 198–207 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Lovász, L.: Combinatorial problems and exercises. Akadémiai Kiadó, Budapest (1979)zbMATHGoogle Scholar
  14. 14.
    Rónyai, L., Mészáros, T.: Some combinatorial applications of Gröbner bases. In: Winkler, F. (ed.) Algebraic informatics: 4th international conference, CAI 2011, Linz, Proceedings, pp. 65–83. Springer, Heidelberg (2011)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Antal Bejczy Center for Intelligent RoboticsÓbuda UniversityBudapestHungary
  2. 2.Institute of Computer Science and ControlHungarian Academy of SciencesBudapestHungary
  3. 3.Department of AlgebraBudapest University of Technology and EconomicsBudapestHungary

Personalised recommendations