English
Related papers

Related papers: Shattering-extremal set systems from Sperner famil…

200 papers

For self-similar sets, there are two important separation properties: the open set condition and the weak separation condition introduced by Zerner, which may be replaced by the formally stronger finite type property of Ngai and Wang. We…

Dynamical Systems · Mathematics 2024-04-09 Christoph Bandt , Michael F. Barnsley

A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…

Combinatorics · Mathematics 2024-09-24 Gal Gross

If a family $\mathcal{F}$ of $k$-element subsets of an $n$-element set is pairwise intersecting, $2k\leq n$ then $|\mathcal{F}|\leq {n-1\choose k-1}$ holds by the celebrated Erd\H{o}s-Ko-Rado theorem. But an intersecting family obviously…

Combinatorics · Mathematics 2026-01-13 Gyula O. H. Katona , Jian Wang

Given a set $X$, a collection $\mathcal{F} \subset \mathcal{P}(X)$ is said to be $k$-Sperner if it does not contain a chain of length $k+1$ under set inclusion and it is saturated if it is maximal with respect to this probability. Gerbner…

Combinatorics · Mathematics 2024-06-07 Ryan R. Martin , Nick Veldt

A collection of families $(\mathcal{F}_{1}, \mathcal{F}_{2} , \cdots , \mathcal{F}_{k}) \in \mathcal{P}([n])^k$ is cross-Sperner if there is no pair $i \not= j$ for which some $F_i \in \mathcal{F}_i$ is comparable to some $F_j \in…

Combinatorics · Mathematics 2023-02-07 Natalie Behague , Akina Kuperus , Natasha Morrison , Ashna Wright

Suppose that $(x_s)_{s\in S}$ is a normalized family in a Banach space indexed by the dyadic tree $S$. Using Stern's combinatorial theorem we extend important results from sequences in Banach spaces to tree-families. More precisely,…

Functional Analysis · Mathematics 2013-05-21 Costas Poulios , Athanasios Tsarpalias

A homogeneous family of subsets over a given set is one with a very ``rich'' automorphism group. We prove the existence of a bi-universal element in the class of homogeneous families over a given infinite set and give an explicit…

Logic · Mathematics 2009-09-25 Menachem Kojman , Saharon Shelah

Let $(X,\S)$ be a set system on an $n$-point set $X$. The \emph{discrepancy} of $\S$ is defined as the minimum of the largest deviation from an even split, over all subsets of $S \in \S$ and two-colorings $\chi$ on $X$. We consider the…

Computational Geometry · Computer Science 2013-08-01 Esther Ezra

We say that a set $A$ $t$-intersects a set $B$ if $A$ and $B$ have at least $t$ common elements. Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-$t$-intersecting if each set in $\mathcal{A}$ $t$-intersects each set…

Combinatorics · Mathematics 2016-05-30 Peter Borg

Let G be a graph with vertices V and edges E. Let F be the union-closed family of sets generated by E. Then F is the family of subsets of V without isolated points. Theorem: There is an edge e belongs to E such that |{U belongs to F | e…

Combinatorics · Mathematics 2016-09-06 Emanuel Knill

We prove that given a constant $k \ge 2$ and a large set system $\mathcal{F}$ of sets of size at most $w$, a typical $k$-tuple of sets $(S_1, \cdots, S_k)$ from $\mathcal{F}$ can be ``blown up" in the following sense: for each $1 \le i \le…

Combinatorics · Mathematics 2025-06-03 Ryan Alweiss

We study and solve several problems in two closely related settings: set families in $2^{[n]}$ with many disjoint pairs of sets and low rank matrices with many zero entries. - More than 40 years ago, Daykin and Erd\H{o}s asked for the…

Combinatorics · Mathematics 2024-11-21 Zach Hunter , Aleksa Milojević , Benny Sudakov , István Tomon

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

Combinatorics · Mathematics 2019-09-17 Peter Bernstein , Cashous Bortner , Samuel Coskey , Shuni Li , Connor Simpson

For a family $\mathcal F$ define $\nu(\mathcal F,t)$ as the largest $s$ for which there exist $A_1,\ldots, A_{s}\in \mathcal F$ such that for $i\ne j$ we have $|A_i\cap A_j|< t$. What is the largest family $\mathcal F\subset{[n]\choose k}$…

Combinatorics · Mathematics 2025-02-11 Peter Frankl , Andrey Kupavskii

A linear system is a pair $(P,\mathcal{L})$ where $\mathcal{L}$ is a family of subsets on a ground finite set $P$, such that $|l\cap l^\prime|\leq 1$, for every $l,l^\prime \in \mathcal{L}$. The elements of $P$ and $\mathcal{L}$ are called…

Combinatorics · Mathematics 2019-03-29 Carlos A. Alfaro , G. Araujo-Pardo , C. Rubio-Montiel , Adrián Vázquez-Ávila

We prove that, e.g., if mu >cf(mu)= aleph_0 and mu>2^{aleph_0} and every stationary family of countable subsets of mu^+ reflect in some subset of mu^+ of cardinality aleph_1, then the SCH for mu^+ (moreover, for mu^+, any scale for mu^+ has…

Logic · Mathematics 2007-09-30 Saharon Shelah

In this article, we consider the notion of almost irredundant sets: A subset $\mathcal{X}$ of a C*-algebra $\mathcal{A}$ is called almost irredundant if and only if for every $a\in \mathcal{X}$, the element $a$ does not belong to the…

Operator Algebras · Mathematics 2020-12-29 Clayton Suguio Hida

We prove that the union-closed sets conjecture is true for separating union-closed families $\mathcal{A}$ with $|\mathcal{A}| \leq 2\left(m+\frac{m}{\log_2(m)-\log_2\log_2(m)}\right)$ where $m$ denotes the number of elements in…

Combinatorics · Mathematics 2015-08-26 Jens Maßberg

We address several extremal problems concerning the spreading property of point sets of Steiner triple systems. This property is closely related to the structure of subsystems, as a set is spreading if and only if there is no proper…

Combinatorics · Mathematics 2021-03-02 Zoltán Lóránt Nagy , Levente Szemerédi

A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. The paper studies Rogers semilattices, i.e. upper semilattices induced by the reducibility between numberings, for families…

Logic · Mathematics 2020-10-05 Nikolay Bazhenov , Manat Mustafa