Abstract
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.
Similar content being viewed by others
References
Adams, W.W., Loustaunau, P.: An introduction to Gröbner bases. Graduate Studies in Mathematics, vol. 3. American Mathematical Society, Providence (1994)
Anstee, R.P., Rónyai, L., Sali, A.: Shattering news. Gr. Comb. 18, 59–73 (2002)
Babai, L., Frankl, P.: Linear algebra methods in combinatorics with applications to geometry and computer science. The University of Chicago, Chicago (1992)
Balandraud, É., Girard, B.: A Nullstellensatz for sequences over \(\mathbb{F}_p\). Combinatorica 34, 657–688 (2014)
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)
Cohen, A.M., Cuypers, H., Sterk, H. (eds.): Some tapas of computer algebra. Springer, Berlin (1999)
Cox, D., Little, J., O’Shea, D.: Ideals, varieties, and algorithms. Springer, Berlin (1992)
Felszeghy, B., Ráth, B., Rónyai, L.: The lex game and some applications. J. Symb. Comput. 41, 663–681 (2006)
Frankl, P.: Traces of antichains. Gr. Comb. 5, 295–299 (1989)
Frankl, P.: Intersection theorems and mod \(p\) rank of inclusion matrices. J. Comb. Theory Ser. A 54, 85–94 (1990)
Hegedűs, G., Rónyai, L.: Gröbner bases for complete uniform families. J. Algebraic Combin. 17, 171–180 (2003)
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)
Lovász, L.: Combinatorial problems and exercises. Akadémiai Kiadó, Budapest (1979)
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)
Acknowledgements
We thank the referee for valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Presented by G. Czedli.
This paper is dedicated to the memory of our teacher, colleague and friend, professor Tamás E. Schmidt.
This article is part of the topical collection “In memory of E. Tamás Schmidt” edited by Robert W. Quackenbush.
Rights and permissions
About this article
Cite this article
Hegedűs, G., Rónyai, L. A note on linear Sperner families. Algebra Univers. 79, 2 (2018). https://doi.org/10.1007/s00012-018-0482-3
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00012-018-0482-3