For every poset P, the induced saturation function sat*([t]^n, P) is either eventually constant or Omega(sqrt(n)) as n grows, with chains constant and unique-twin-cover posets growing.
The Exact Saturation Number for the Diamond
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
What is the smallest size of a family of subsets of $[n]$ such that it does not contain an induced copy of $Q_2$ as a poset (known as the \textit{diamond}), but adding a new set creates such a copy? It is easy to see that a maximal chain has this property, and thus the answer is at most $n+1$. Despite the simplicity of the diamond structure, the lower bound stagnated at $\sqrt n$ for quite some time, until recently the authors obtained a linear lower bound. In this paper, we fully solve this question showing that such a family must have size at least $n+1$.
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Induced poset saturation in the hypergrid
For every poset P, the induced saturation function sat*([t]^n, P) is either eventually constant or Omega(sqrt(n)) as n grows, with chains constant and unique-twin-cover posets growing.