English
Related papers

Related papers: Union-closed families with small average overlap d…

200 papers

We prove that if there is a dominating family of size ${\aleph}_{1}$, then there is are ${\aleph}_{1}$ many compact subsets of ${\omega}^{\omega}$ whose union is a maximal almost disjoint family of functions that is also maximal with…

Logic · Mathematics 2011-11-01 Dilip Raghavan , Saharon Shelah

We give a number of results about families of Ulam sets. Generalizing behavior of Ulam sets U(1,n), we prove using an novel model theoretic approach that there is a rigidity phenomenon for Ulam sets U(a,b) as b increases. Based on this, we…

Number Theory · Mathematics 2017-11-02 Joshua Hinman , Borys Kuca , Alexander Schlesinger , Arseniy Sheydvasser

A family of subsets of $\{1,2,\ldots,n\}$ is said to be {\em antipodal} if it is closed under taking complements. We prove a best-possible isoperimetric inequality for antipodal families of subsets of $\{1,2,\ldots,n\}$. Our inequality…

Combinatorics · Mathematics 2017-11-15 David Ellis , Imre Leader

We consider a measure of similarity for infinite words that generalizes the notion of asymptotic or natural density of subsets of natural numbers from number theory. We show that every overlap-free infinite binary word, other than the…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Chen Fei Du , Jeffrey Shallit

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…

Combinatorics · Mathematics 2011-08-17 Paul A. Russell

For $n > 2k \geq 4$ we consider intersecting families $\mathcal F$ consisting of $k$-subsets of $\{1, 2, \ldots, n\}$. Let $\mathcal I(\mathcal F)$ denote the family of all distinct intersections $F \cap F'$, $F \neq F'$ and $F, F'\in…

Combinatorics · Mathematics 2021-08-03 Peter Frankl , Sergei Kiselev , Andrey Kupavskii

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

Combinatorics · Mathematics 2015-01-30 Christine Bachoc , Alberto Passuello , Alain Thiery

Given a positive, non-increasing sequence $a$ with finite sum equal to $1$, we consider the family of all closed subsets of $[0,1]$ whose complementary open intervals have lengths given by a rearrangement of the sequence $a$. We study the…

Classical Analysis and ODEs · Mathematics 2025-11-18 Nicolas Angelini , Ursula Molter

It is well known that an intersecting family of subsets of an n-element set can contain at most 2^(n-1) sets. It is natural to wonder how `close' to intersecting a family of size greater than 2^(n-1) can be. Katona, Katona and Katona…

Combinatorics · Mathematics 2011-08-30 Paul A. Russell , Mark Walters

We show that every space that is the union of a `small' family consisting of special P-sets that are F-spaces, is an F-space. We also comment on the sharpness of our results.

General Topology · Mathematics 2014-01-15 Klaas Pieter Hart , Leon Luo , Jan van Mill

Given a finite set $X$ of points in $R^n$ and a family $F$ of sets generated by the pairs of points of $X$, we determine volumetric and structural conditions for the sets that allow us to guarantee the existence of a positive-fraction…

Metric Geometry · Mathematics 2016-08-22 Alexander Magazinov , Pablo Soberón

We argue that the mean crossing number of a random polymer configuration is simply a measure of opacity, without being closely related to entanglement as claimed by several authors. We present an easy way of estimating its asymptotic…

Statistical Mechanics · Physics 2009-10-31 Peter Grassberger

Let $\mathscr{F}=(F_n)$ be a sequence of nonempty finite subsets of $\omega$ such that $\lim_n |F_n|=\infty$ and define the ideal $$\mathcal{I}(\mathscr{F}):=\left\{A\subseteq \omega: |A\cap F_n|/|F_n|\to 0~\mbox{as}~n\to \infty \right\}.$$…

General Topology · Mathematics 2020-07-20 Sumit Som

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

Combinatorics · Mathematics 2013-12-12 Peter Borg

Fix a density d in (0,1], and let F_p^n be a finite field, where we think of p fixed and n tending to infinity. Let S be any subset of F_p^n having the minimal number of three-term progressions, subject to the constraint |S| is at least…

Number Theory · Mathematics 2007-05-23 Ernie Croot

Let $n$, $r$, and $k$ be positive integers such that $k, r \geq 2$, $L$ a non-empty subset of $[k]$, and $\mathcal{F}_i \subseteq \binom{[n]}{k}$ for $1 \leq i \leq r$. We say that non-empty families $\mathcal{F}_1, \mathcal{F}_2, \ldots,…

Combinatorics · Mathematics 2025-09-30 Xiamiao Zhao , Haixiang Zhang , Mei Lu

In this paper we give an example of a closed, strongly one-sided dense set which is not of uniform density type. We also show that there is a set of uniform density type which is not of strong uniform density type.

Classical Analysis and ODEs · Mathematics 2022-08-26 Zoltán Buczolich , Bruce Hanson , Balázs Maga , Gáspár Vértesy

Approximations for an unknown density $g$ in terms of a reference density $f_\nu$ and its associated orthonormal polynomials are discussed. The main application is the approximation of the density $f$ of a sum $S$ of lognormals which may…

Probability · Mathematics 2016-01-11 Søren Asmussen , Pierre-Olivier Goffard , Patrick J. Laub

Using the sunflower method, we show that if $\theta \in (0,1) \cap \mathbb{Q}$ and $\mathcal{F}$ is a $O(n^{1/3})$-bounded $\theta$-intersecting family over $[n]$, then $\lvert \mathcal{F} \rvert = O(n)$, and that if $\mathcal{F}$ is…

Combinatorics · Mathematics 2025-09-17 Niranjan Balachandran , Shagnik Das , Brahadeesh Sankarnarayanan

Let $\mathcal A=\{A_1,\ldots,A_n\}$ be a family of sets in the plane. For $0 \leq i < n$, denote by $f_i$ the number of subsets $\sigma$ of $\{1,\ldots,n\}$ of cardinality $i+1$ that satisfy $\bigcap_{i \in \sigma} A_i \neq \emptyset$. Let…

Combinatorics · Mathematics 2019-12-17 Gil Kalai , Zuzana Patáková