Related papers: Improved Lower Bound for Frankl's Union-Closed Set…

We apply a conjectured inequality on third chern classes of stable two-term complexes on threefolds to Fujita's conjecture. More precisely, the inequality is shown to imply a Reider-type theorem in dimension three which in turn implies that…

The $1/3$-$2/3$ Conjecture, originally formulated in 1968, is one of the best-known open problems in the theory of posets, stating that the balance constant (a quantity determined by the linear extensions) of any non-total order is at least…

We establish a general method for proving bounds on the information that can be extracted via arbitrary entangled measurements on tensor products of hidden subgroup coset states. When applied to the symmetric group, the method yields an…

Let $k\ge d\ge 3$ be fixed. Let $\mathcal{F}$ be a $k$-uniform family on $[n]$. Then $\mathcal{F}$ is $(d,s)$-conditionally intersecting if it does not contain $d$ sets with union of size at most $s$ and empty intersection. Answering a…

First we consider families in the hypercube $Q_n$ with bounded VC dimension. Frankl raised the problem of estimating the number $m(n,k)$ of maximal families of VC dimension $k$. Alon, Moran and Yehudayoff showed that…

We present a constructive lower bound of $\Omega(1/\sqrt{\varepsilon})$ for Frank-Wolfe (FW) when both the objective and the constraint set are smooth and strongly convex, showing that the known uniform $\mathcal{O}(1/\sqrt{\varepsilon})$…

We show that the uniform Littlewood Conjecture (ULC) recently introduced by Bandi, Fregoli and Kleinbock is false. More precisely the counterexamples form a residual set, the method further suggests positive Hausdorff dimension. For a…

The sandglass conjecture, posed by Simonyi, states that if a pair $(A, B)$ of families of subsets of $[n]$ is recovering then $|A| |B| \leq 2^n$. We improve the best known upper bound to $|A| |B| \leq 2.2543^n$. To do this we overcome a…

We show that there exist only constant morphisms from $\mathbb{Q}^{2n+1}(n\geq 1)$ to $\mathbb{G}(l,2n+1)$ if $l$ is even $(0<l<2n)$ and $(l,2n+1)$ is not $ (2,5)$. As an application, we prove on $\mathbb{Q}^{2m+1}$ and…

The Cycle double cover (CDC) conjecture states that for every bridgeless graph $G$, there exists a family $\mathcal{F}$ of cycles such that each edge of the graph is contained in exactly two members of $\mathcal{F}$. Given an embedding of a…

We prove that the ACC conjecture for minimal log discrepancies holds for threefolds in $[1-\delta,+\infty)$, where $\delta>0$ only depends on the coefficient set. We also study Reid's general elephant for pairs, and show Shokurov's…

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…

We give an example of a set $\Omega \subset \R^5$ which is a finite union of unit cubes, such that $L^2(\Omega)$ admits an orthonormal basis of exponentials $\{\frac{1}{|\Omega|^{1/2}} e^{2\pi i \xi_j \cdot x}: \xi_j \in \Lambda \}$ for…

Let f(n) denote the smallest positive integer such that every set of $f(n)$ points in general position in the Euclidean plane contains a convex n-gon. In a seminal paper published in 1935, Erd\H{o}s and Szekeres proved that f(n) exists and…

Foulkes' conjecture has several generalisations due to Doran, Abdesselam--Chipalkatti, Bergeron, and Troyka. For the special linear Lie algebra $\mathfrak{sl}_2(\mathbb{C})$, these assert that given $a \le c \le d \le b$ with $ab=cd$, the…

We prove the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s >= 3; this is new for s > 3, and the cases s<3 have also been previously established. More precisely, we establish that if f : [N] -> [-1,1] is a function with || f…

It has been conjectured by P\'{o}lya and Szeg\"{o} seventy years ago that the planar set which minimizes the first eigenvalue of the Dirichlet-Laplace operator among polygons with $n$ sides and fixed area is the regular polygon. Despite its…

Erd\H{o}s conjectured that every triangle-free graph $G$ on $n$ vertices contains a set of $\lfloor n/2 \rfloor$ vertices that spans at most $n^2 /50$ edges. Krivelevich proved the conjecture for graphs with minimum degree at least…

We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.

We give an arithmetic version of the recent proof of the triangle removal lemma by Fox [Fox11], for the group $\mathbb{F}_2^n$. A triangle in $\mathbb{F}_2^n$ is a triple $(x,y,z)$ such that $x+y+z = 0$. The triangle removal lemma for…