相关论文: Saturation of $k$-chains in the Boolean lattice

We say a finite poset $P$ is a tree poset if its Hasse diagram is a tree. Let $k$ be the length of the largest chain contained in $P$. We show that when $P$ is a fixed tree poset, the number of $P$-free set systems in $2^{[n]}$ is…

A recent upper bound by Le and Solomon [STOC '23] has established that every $n$-node graph has a $(1+\varepsilon)(2k-1)$-spanner with lightness $O(\varepsilon^{-1} n^{1/k})$. This bound is optimal up to its dependence on $\varepsilon$; the…

A drawing of a graph is $k$-plane if every edge contains at most $k$ crossings. A $k$-plane drawing is saturated if we cannot add any edge so that the drawing remains $k$-plane. It is well-known that saturated $0$-plane drawings, that is,…

In standard bootstrap percolation, a subset A of the n x n grid is initially infected. A new site is then infected if at least two of its neighbours are infected, and an infected site stays infected forever. The set A is said to percolate…

A set $D \subseteq V$ is a dominating set of a graph $G$ if every vertex in $V - D$ is adjacent to at least one vertex in $D$. A dominating set $D$ is a paired-dominating set if the subgraph of $G$ induced by $D$ contains a perfect…

The $k$-representation number of a graph $G$ is the minimum cardinality of the system of vertex subsets with the property that every edge of $G$ is covered at least $k$ times while every non-edge is covered at most $(k-1)$ times. In…

Let F be a family of subsets of {1,2,...,n}. The width-degree of an element x in at least one member of F is the width of the family {U in F | x in U}. If F has maximum width-degree at most k, then F is locally k-wide. Bounds on the size of…

A set of vertices is $k$-sparse if it induces a graph with a maximum degree of at most $k$. In this missive, we consider the order of the largest $k$-sparse set in a triangle-free graph of fixed order. We show, for example, that every…

The minimizer of a word of size $k$ (a $k$-mer) is defined as its smallest substring of size $m$ (with $m\leq k$), according to some ordering on $m$-mers. minimizers have been used in bioinformatics -- notably -- to partition sequencing…

Call a permutation $k$-inflatable if the sequence of its tensor products with uniform random permutations of increasing lengths has uniform $k$-point pattern densities. Previous work has shown that nontrivial $k$-inflatable permutations do…

We resolve the space complexity of single-pass streaming algorithms for approximating the classic set cover problem. For finding an $\alpha$-approximate set cover (for any $\alpha= o(\sqrt{n})$) using a single-pass streaming algorithm, we…

Min-entropy sampling gives a bound on the min-entropy of a randomly chosen subset of a string, given a bound on the min-entropy of the whole string. K\"onig and Renner showed a min-entropy sampling theorem that holds relative to quantum…

A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is $2^{n-1} +…

In this article, we explore the combinatorics of balanced collections. A collection of subsets of the set $[n] = \{1, \dots, n\}$ is called \emph{balanced} if the relative interior of the convex hull of the corresponding characteristic…

A pair of families $(\cF,\cG)$ is said to be \emph{cross-Sperner} if there exists no pair of sets $F \in \cF, G \in \cG$ with $F \subseteq G$ or $G \subseteq F$. There are two ways to measure the size of the pair $(\cF,\cG)$: with the sum…

A $k-$quasiperfect dominating set ($k\ge 1$) of a graph $G$ is a vertex subset $S$ such that every vertex not in $S$ is adjacent to at least one and at most k vertices in $S$. The cardinality of a minimum k-quasiperfect dominating set in…

We show that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}, \mathcal{F} \neq \{\emptyset\}$, there exists an $i \in [n]$ which is contained in a $0.01$ fraction of the sets in $\mathcal{F}$. This is the first known constant…

A packing by a body $K$ is collection of congruent copies of $K$ (in either Euclidean or hyperbolic space) so that no two copies intersect nontrivially in their interiors. A covering by $K$ is a collection of congruent copies of $K$ such…

We present the abundances of 23 elements, including 11 heavy elements (Cu, Zn, Sr, Y, Zr, Ba, La, Ce, Nd, Sm, Eu) for up to 86 metal-poor (-2 < [Fe/H] < -1) subgiants. We use KORG, a state of the art spectral synthesis package, to derive…

Fricke, Hedetniemi, Hedetniemi, and Hutson asked whether every tree with domination number $\gamma$ has at most $2^\gamma$ minimum dominating sets. Bien gave a counterexample, which allows to construct forests with domination number…