English

A note on linear Sperner families

Combinatorics 2017-02-03 v1

Abstract

In an earlier work we described Gr\"obner bases of the ideal of polynomials over a field, which vanish on the set of characteristic vectors v{0,1}n\mathbf{v} \in \{0,1\}^n of the complete dd unifom set family over the ground set [n][n]. In particular, it turns out that the standard monomials of the above ideal are {\em ballot monomials}. We give here a partial extension of the latter fact. We prove that the lexicographic standard monomials for linear Sperner systems are also ballot monomials. A set family is a linear Sperner system if the characteristic vectors satisfy a linear equation a1v1++anvn=ka_1v_1+\cdots +a_nv_n=k, where 0<aqa2an0<a_q\leq a_2\leq \cdots \leq a_n and kk are integers. As an application, we confirm a conjecture of Frankl for linear Sperner systems.

Keywords

Cite

@article{arxiv.1702.00569,
  title  = {A note on linear Sperner families},
  author = {Gábor Hegedüs and Lajos Rónyai},
  journal= {arXiv preprint arXiv:1702.00569},
  year   = {2017}
}

Comments

12 pages

R2 v1 2026-06-22T18:07:28.128Z