Related papers: A Proof of Talagrand's Creating Large Sets Conject…
A spectral set in R^n is a set X of finite Lebesgue measure such that L^2(X) has an orthogonal basis of exponentials. It is conjectured that every spectral set tiles R^n by translations. A set of translations T has a universal spectrum if…
The theory of majorizing measures, extensively developed by Fernique, Talagrand and many others, provides one of the most general frameworks for controlling the behavior of stochastic processes. In particular, it can be applied to derive…
Fuglede's conjecture states that for a subset $\Omega$ of a locally compact abelian group $G$ with positive and finite Haar measure, there exists a subset of the dual group of $G$ which is an orthogonal basis of $L^{2}(\Omega)$ if and only…
We prove the following variant of the Falconer conjecture in the plane. If the dimension of a compact planar set is greater than one, then the distance set with respect to almost every ellipse has positive Lebesgue measure.
Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…
Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided there are at least two members). The conjecture has an…
The most powerful formulation of the Central Sets Theorem in an arbitrary semigroup was proved in the work of De, Hindman, and Strauss. The sets which satisfy the conclusion of the above Central Sets Theorem are called $C$-sets. The…
We exhibit a strong connection between cover times of graphs, Gaussian processes, and Talagrand's theory of majorizing measures. In particular, we show that the cover time of any graph $G$ is equivalent, up to universal constants, to the…
Let $t$ be a non-negative integer and $\mbox{$\cal P$}=\{(A_i,B_i)\}_{1\leq i\leq m}$ be a set-pair family satisfying $|A_i \cap B_i|\leq t$ for $1\leq i \leq m$. $\mbox{$\cal P$}$ is called strong Bollob\'as $t$-system, if $|A_i\cap…
The Union-Closed Sets Conjecture asks whether every union-closed set family $\mathcal{F}$ has an element contained in half of its sets. In 2022, Nagel posed a generalisation of this problem, suggesting that the $k$th-most popular element in…
A balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We define the notion of a good pair and…
The union-closed sets conjecture, attributed to P\'eter Frankl from 1979, states that for any non-empty finite union-closed family of finite sets not consisting of only the empty set, there is an element that is in at least half of the sets…
The Falconer conjecture asserts that if E is a planar set with Hausdorff dimension strictly greater than 1, then its Euclidean distance set has positive one-dimensional Lebesgue measure. We discuss the analogous question with the Euclidean…
A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family $\mathcal F$ of subsets of $[n]$ with all pairwise intersections of size $\lambda$ can have at most $n$ non-empty sets. One may weaken the…
An old conjecture of Kahn and Saks says, roughly, that any poset $P$ of large enough width contains elements $x,y$ which are "balanced" in the sense that the probability that $x$ precedes $y$ in a uniformly random linear extension of $P$ is…
An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to…
We show that a topologically generating set $S$ of a connected compact Lie group $G$ of size larger than a fixed polynomial in the rank of $G$ must be redundant (i.e., some proper subset of $S$ still topologically generates $G$). Similar…
Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…
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…
Let $X$ be an $n$-element set, where $n$ is even. We refute a conjecture of J. Gordon and Y. Teplitskaya, according to which, for every maximal intersecting family $\mathcal{F}$ of $\frac{n}2$-element subsets of $X$, one can partition $X$…