English
Related papers

Related papers: Standard monomials and extremal point sets

200 papers

A finite group is said to be weakly separable if every algebraic isomorphism between two $S$-rings over this group is induced by a combinatorial isomorphism. In the paper we prove that every abelian weakly separable group belongs to one of…

Group Theory · Mathematics 2021-11-04 Grigory Ryabov

We study some strong combinatorial properties of $\textsf{MAD}$ families. An ideal $\mathcal{I}$ is Shelah-Stepr\={a}ns if for every set $X\subseteq{\left[ \omega\right]}^{<\omega}$ there is an element of $\mathcal{I}$ that either…

Logic · Mathematics 2026-01-14 Jörg Brendle , Osvaldo Guzmán , Michael Hrušák , Dilip Raghavan

We say that a family of permutations $t$-shatters a set if it induces at least $t$ distinct permutations on that set. What is the minimum number $f_k(n,t)$ of permutations of $\{1, \dots, n\}$ that $t$-shatter all subsets of size $k$? For…

Combinatorics · Mathematics 2024-07-09 António Girão , Lukas Michel , Youri Tamitegama

Let $n > k > t \geq j \geq 1$ be integers. Let $X$ be an $n$-element set, ${X\choose k}$ the collection of its $k$-subsets. A family $\mathcal F \subset {X\choose k}$ is called $t$-intersecting if $|F \cap F'| \geq t$ for all $F, F' \in…

Combinatorics · Mathematics 2021-01-11 P. Frankl , G. O. H. Katona

Let $\mathcal{F}\subset 2^{[n]}$ be a set family such that the intersection of any two members of $\mathcal{F}$ has size divisible by $\ell$. The famous Eventown theorem states that if $\ell=2$ then $|\mathcal{F}|\leq 2^{\lfloor…

Combinatorics · Mathematics 2022-09-30 Lior Gishboliner , Benny Sudakov , István Tomon

Given a saturated fusion system $\mathcal{F}$ over a $2$-group $S$, we prove that $S$ is abelian provided any element of $S$ is $\mathcal{F}$-conjugate to an element of $Z(S)$. This generalizes a Theorem of Camina--Herzog, leading to a…

Group Theory · Mathematics 2014-02-17 Ellen Henke

Recall that in a laminar family, any two sets are either disjoint or contained one in the other. Here, a parametrized weakening of this condition is introduced. Let us say that a set system $\mathcal{F} \subseteq 2^X$ is $t$-laminar if $A,B…

Combinatorics · Mathematics 2014-06-13 Peter Dukes

A set $A$ $t$-intersects a set $B$ if $A$ and $B$ have at least $t$ common elements. Families $\mathcal{A}_1, \mathcal{A}_2, \dots, \mathcal{A}_k$ of sets are cross-$t$-intersecting if, for every $i$ and $j$ in $\{1, 2, \dots, k\}$ with $i…

Combinatorics · Mathematics 2018-05-15 Peter Borg

Let $\mathcal{F}$ be any collection of linearly separable sets of a set $P$ of $n$ points either in $\mathbb{R}^2$, or in $\mathbb{R}^3$. We show that for every natural number $k$ either one can find $k$ pairwise disjoint sets in…

Combinatorics · Mathematics 2015-07-10 Shay Moran , Rom Pinchasi

We have found the most general extension of the celebrated Sauer, Perles and Shelah, Vapnik and Chervonenkis result from 0-1 sequences to $k$-ary codes still giving a polynomial bound. Let $\mathcal{C}\subseteq \{0,1,..., k-1}^n$ be a…

Combinatorics · Mathematics 2011-09-09 Zoltán Füredi , Attila Sali

A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each…

Combinatorics · Mathematics 2024-11-08 Gábor Hegedüs

Let $k\geq 2$ and $n\geq 3(k-1)$. Let $\mathcal{F}$ and $\mathcal{G}$ be families of $k$-element subsets of an $n$-element set. Suppose that $|F\cap G|\geq 2$ for all $F\in\mathcal{F}$ and $G\in\mathcal{G}$. We show that…

Combinatorics · Mathematics 2025-03-20 Hajime Tanaka , Norihide Tokushige

A family of sets $\mathcal{A}$ is union-closed if it is finite and nonempty with member sets that are all finite and distinct (at least one of which is nonempty) and it satisfies the property $X, Y \in \mathcal{A} \implies X \cup Y \in…

Combinatorics · Mathematics 2024-09-25 Christopher Bouchard

Let $\mathcal{F}\subseteq{[n]\choose k}$ be a $t$-intersecting family. Define the $t$-covering number $\tau_t(\mathcal{F})$ of $\mathcal{F}$ as the minimum size of a subset $S$ of $[n]$ with $|S\cap F|\geqslant t$ for each…

Combinatorics · Mathematics 2026-03-12 Tian Yao , Dehai Liu , Kaishun Wang

A family of sets is said to be \emph{intersecting} if any two sets in the family have nonempty intersection. In 1973, Erd\H{o}s raised the problem of determining the maximum possible size of a union of $r$ different intersecting families of…

Combinatorics · Mathematics 2019-10-09 David Ellis , Noam Lifshitz

A family $\mathcal{F}$ of $k$-subsets of an $n$-set is called $s$-almost $t$-intersecting if each member is $t$-disjoint with at most $s$ members. In this paper, we prove that, if $\left|\mathcal{F}\right|$ is maximum, then $\mathcal{F}$…

Combinatorics · Mathematics 2026-01-13 Dehai Liu , Kaishun Wang , Tian Yao

P. Frankl and J. Pach proved the following uniform version of Sauer's Lemma. Let $n,d,s$ be natural numbers such that $d\leq n$, $s+1\leq n/2$. Let $\cF \subseteq {[n] \choose d}$ be an arbitrary $d$-uniform set system such that $\cF$ does…

Combinatorics · Mathematics 2016-10-10 Gabor Hegedüs , Lajos Ronyai

Given a family $\mathcal F\subset 2^{[n]}$, its diversity is the number of sets not containing an element with the highest degree. The concept of diversity has proven to be very useful in the context of $k$-uniform intersecting families. In…

Combinatorics · Mathematics 2018-11-06 Peter Frankl , Andrey Kupavskii

Self-similar sets require a separation condition to admit a nice mathematical structure. The classical open set condition (OSC) is difficult to verify. Zerner proved that there is a positive and finite Hausdorff measure for a weaker…

Metric Geometry · Mathematics 2023-09-01 Christoph Bandt

If $T$ is the operator given by convolution with surface measure on the sphere, $(E,F)$ is a quasi-extremal pair of sets for $T$ if $\langle T\chi_E, \chi_F \rangle \gtrsim |E|^{d/(d+1)}|F|^{d/(d+1)}$. In this article, we explicitly define…

Classical Analysis and ODEs · Mathematics 2017-10-24 Betsy Stovall