Related papers: The union-closed sets conjecture for non-uniform d…

A family of sets is called $r$-\emph{cover free} if no set in the family is contained in the union of $r$ (or less) other sets in the family. A $1$-cover free family is simply an antichain with respect to set inclusion. Thus, Sperner's…

We introduce the concept of inverse powerset by adding three axioms to the Zermelo-Fraenkel set theory. This extends the Zermelo-Fraenkel set theory with a new type of set which is motivated by an intuitive meaning and interesting…

Let $L/K$ be a Galois extension of number fields and let $G=\mathrm{Gal}(L/K)$. We show that under certain hypotheses on $G$, for a fixed prime number $p$, Leopoldt's conjecture at $p$ for certain proper intermediate fields of $L/K$ implies…

In this very short note, we give a counterexample to a recent conjecture of Gilmer which would have implied the union-closed conjecture.

We prove that for any pair of constants $\epsilon>0$ and $\Delta$ and for $n$ sufficiently large, every family of trees of orders at most $n$, maximum degrees at most $\Delta$, and with at most $\binom{n}{2}$ edges in total packs into…

The concept of uniform distribution in $[0,1]$ is extended for a certain strictly separated maximal (in the sense of cardinality) family $(\lambda_t)_{t \in [0,1]}$ of invariant extensions of the linear Lebesgue measure $\lambda$ in…

We prove that any quasirandom graph with $n$ vertices and $rn$ edges can be decomposed into $n$ copies of any fixed tree with $r$ edges. The case of decomposing a complete graph establishes a conjecture of Ringel from 1963.

Talagrand conjectured that if a family of sets $\mathcal{F}$ over $X = \{ 1,2,\cdots, N \}$ is of large measure, then constant times of unions of sets in $\mathcal{F}$ will cover a large portion of the power set of $X$. This conjecture is a…

For integers $n\ge s\ge2$, let $e(n,s)$ be the maximum size of a family $\mathcal F\subseteq2^{[n]}$ with no $s$ pairwise disjoint members. The study of determining $e(n,s)$ is closely related to its uniform counterpart, the well-known…

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…

We say that a set system $\mathcal{F}\subseteq 2^{[n]}$ shatters a given set $S\subseteq [n]$ if $2^S= \{F~\cap~S:~F~\in~\mathcal{F}\}$. The Sauer-Shelah lemma states that in general, a set system $\mathcal{F}$ shatters at least…

In the early 2000's the first and second named authors worked for a period of six years in an attempt of proving the Compositional Shuffle Conjecture [1]. Their approach was based on the discovery that all the Combinatorial properties…

A fundamental result in extremal set theory is Katona's shadow intersection theorem, which extends the Kruskal-Katona theorem by giving a lower bound on the size of the shadow of an intersecting family of $k$-sets in terms of its size. We…

We improve the best known constant $\frac{3-\sqrt 5}{2}$ for which the union-closed conjecture is known to be true, by using dependent samples as suggested by Sawin and the entropy approach on this problem initiated by Gilmer. Meanwhile, we…

In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…

In his 1985 survey of notions of exchangeability, Aldous introduced a form of exchangeability corresponding to the symmetries of the infinite discrete cube, and asked whether these exchangeable probability measures enjoy a representation…

The Central Sets Theorem was introduced by H. Furstenberg and then afterwards several mathematicians have provided various versions and extensions of this theorem. All of these theorems deal with central sets, and its origin from the…

In 2000, Kadell gave an orthogonality conjecture for a symmetric function generalization of the $q$-Dyson constant term identity or the Zeilberger--Bressoud $q$-Dyson theorem. The non-zero part of Kadell's orthogonality conjecture is a…

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,…

One of the most well known random fractals is the so-called Fractal percolation set. This is defined as follows: we divide the unique cube in $\mathbb{R}^d$ into $M^d$ congruent sub-cubes. For each of these cubes a certain retention…