Gröbner bases for complete uniform families
From MaRDI portal
Publication:1870286
DOI10.1023/A:1022934815185zbMath1045.13011MaRDI QIDQ1870286
Publication date: 11 May 2003
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
A note on linear Sperner families ⋮ Standard complexes of matroids and lattice paths ⋮ A uniform version of a theorem by Dvir and Moran ⋮ An improved upper bound for the size of a sunflower-free family ⋮ Inclusion matrices for rainbow subsets ⋮ Standard monomials for \(q\)-uniform families and a conjecture of Babai and Frankl ⋮ Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits ⋮ MULTIVALUED GENERALIZATIONS OF THE FRANKL–PACH THEOREM ⋮ The lex game and some applications ⋮ Algebraic Properties of ModuloqComplete ℓ-Wide Families ⋮ Some Combinatorial Applications of Gröbner Bases ⋮ An upper bound for the size of \(s\)-distance sets in real algebraic sets ⋮ Unnamed Item ⋮ \(L\)-balancing families
Cites Work
- Remarks on recent formulas of Wilson and Frankl
- Some tapas of computer algebra
- On the density of sets of divisors
- Shattering news
- Sperner families of bounded VC-dimension
- Intersection theorems and mod \(p\) rank of inclusion matrices
- A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
- Hilbert function and complexity lower bounds for symmetric Boolean functions
- Lexicographic matching in Boolean algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Gröbner bases for complete uniform families
