Related papers: Saturating Sperner families

Let $K \subset {\mathbb R}^n$ be a compact definable set in an o-minimal structure over $\mathbb R$, e.g., a semi-algebraic or a subanalytic set. A definable family $\{ S_\delta|\> 0< \delta \in {\mathbb R} \}$ of compact subsets of $K$, is…

A 0-1 matrix $M$ is saturating for a 0-1 matrix $P$ if $M$ does not contain a submatrix that can be turned into $P$ by flipping any number of its $1$-entries to $0$-entries, and changing any $0$-entry to $1$-entry of $M$ introduces a copy…

In this paper we define a notion of calibration for an equivalent approach to the classical Steiner problem in a covering space setting and we give some explicit examples. Moreover we introduce the notion of calibration in families: the…

Let $\ee>0$ and $\fff$ be a family of finite subsets of the Cantor set $\ccc$. Following D. H. Fremlin, we say that $\fff$ is $\ee$-filling over $\ccc$ if $\fff$ is hereditary and for every $F\subseteq\ccc$ finite there exists $G\subseteq…

A family of sets has the $(p,q)$ property if among any $p$ members of the family some $q$ have a nonempty intersection. It is shown that for every $p\ge q\ge d+1$ there is a $c=c(p,q,d)<\infty$ such that for every family $\scr F$ of…

The weak saturation number $\mathrm{wsat}(n,F)$ is the minimum number of edges in a graph on $n$ vertices such that all the missing edges can be activated sequentially so that each new edge creates a copy of $F$. A usual approach to prove a…

We study Banach spaces induced by families of finite sets in the most natural (Schreier-like) way, that is, we consider the completion $X_\mc{F}$ of $c_{00}$ with respect to the norm $\sup\{\sum_{k\in F}|x(k)|:F\in\mc{F}\}$ where $\mc{F}$…

We explore the Borel complexity of some basic families of subsets of a countable group (large, small, thin, sparse and other) defined by the size of their elements. Applying the obtained results to the Stone-\v{C}ech compactification $\beta…

Let $G$ be a finite group. In order to determine the smallest cardinality $d(G)$ of a generating set of $G$ and a generating set with this cardinality, one should repeat many times the test whether a subset of $G$ of small cardinality…

We consider the Minimum Coverage Kernel problem: given a set $B$ of $d$-dimensional boxes, find a subset of $B$ of minimum size covering the same region as $B$. This problem is $\mathsf{NP}$-hard, but as for many $\mathsf{NP}$-hard problems…

Every subfield $\kk(\phi)$ of the field of rational functions $\kk(x_1,...,x_n)$ is contained in a unique maximal subfield of the form $\kk(\psi)$. The element $\psi$ is called generative for the element $\phi$. A subfield of…

We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two…

Given a family $\mathcal{F}\subset 2^{[n]}$ and $1\leq i\neq j\leq n$, we use $\mathcal{F}(\bar{i},j)$ to denote the family $\{F\setminus \{j\}\colon F\in \mathcal{F},\ F\cap \{i,j\}=\{j\}\}$. The sturdiness of $\mathcal{F}$ is defined as…

Let $N$ be a finite set, let $p \in (0,1)$, and let $N_p$ denote a random binomial subset of $N$ where every element of $N$ is taken to belong to the subset independently with probability $p$ . This defines a product measure $\mu_p$ on the…

A family X of sets is said to be intersecting if any two members of X have non-empty intersection. It is a well-known and simple fact that an intersecting family of subsets of [n]={1,2,...,n} can contain at most 2^(n-1) sets. Katona, Katona…

Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…

We introduce a uniform method of proof for the following results. For {\em each} of the following conditions, there are $2^{\aleph_0}$ families of Steiner systems, satisfying that condition: i) Theorem~2.2.4: (extending \cite{Chicoetal})…

A $k$-crossing family in a point set $S$ in general position is a set of $k$ segments spanned by points of $S$ such that all $k$ segments mutually cross. In this short note we present two statements on crossing families which are based on…

For a fixed graph $F,$ the minimum number of edges in an edge-maximal $F$-free subgraph of $G$ is called the $F$-saturation number. The asymptotics of the $F$-saturation number of the binomial random graph $G(n,p)$ for constant $p\in(0,1)$…

We study a variational problem motivated by models of species population density in a nonhomogeneous environment. We first analyze local minimizers and the structure of the saturated region (where the population attains its maximal density)…