An inequality for Kruskal-Macaulay functions
Preprint
Abstract
Given integers $k\geq1$ and $n\geq0$, there is a unique way of writing $n$ as $n=\binom{n_{k}}{k}+\binom{n_{k-1}}{k-1}+...+\binom{n_{1}}{1}$ so that $0\leq n_{1}<...<n_{k-1}<n_{k}$. Using this representation, the \emph{Kruskal-Macaulay function of}$n$ is defined as $\partial^{k}(n) =\binom{n_{k}-1}{k-1}+\binom{n_{k-1}-1}{k-2}+...+\binom{n_{1}-1}% {0}.$ We show that if $a\geq0$ and $a<\partial^{k+1}(n) $, then $\partial^{k}(a) +\partial^{k+1}(n-a) \geq \partial^{k+1}(n) .$ As a corollary, we obtain a short proof of Macaulay's Theorem. Other previously known results are obtained as direct consequences.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- On the Maximum Number of Translates in a Point SetDiscrete & Computational Geometry, 2008
- A generalized Macaulay theorem and generalized face ringsJournal of Combinatorial Theory, Series A, 2006
- Onf-vectors and Betti numbers of multicomplexesCombinatorica, 1997
- Combinatorics of Finite Sets.The American Mathematical Monthly, 1989
- Über einen Satz von KruskalPeriodica Mathematica Hungarica, 1975
- A generalization of a combinatorial theorem of macaulayJournal of Combinatorial Theory, 1969
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961
- Some Properties of Enumeration in the Theory of Modular SystemsProceedings of the London Mathematical Society, 1927