Related papers: Two-Source Dispersers for Polylogarithmic Entropy …

The recent line of study on randomness extractors has been a great success, resulting in exciting new techniques, new connections, and breakthroughs to long standing open problems in several seemingly different topics. These include seeded…

If the equation of the title has an integer solution with $k\ge2$, then $m>10^{9.3\cdot10^6}$. This was the current best result and proved using a method due to L. Moser (1953). This approach cannot be improved to reach the benchmark…

We propose a novel method for establishing the sparsity of the coefficients of the Laguerre generalized polynomial chaos expansion of solutions to parametric elliptic PDEs with log-gamma inputs on $\mathbb{R}_+^\infty$. The established…

The entropy of a graph was first introduced by Rashevsky \cite{Rashevsky} and Trucco \cite{Trucco} to interpret as the structural information content of the graph and serve as a complexity measure. In this paper, we first state a number of…

We show that for large integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the number of prime factors follows an approximate normal distribution, with mean $C \log_2 n$ and variance $V \log_2 n$,…

Burr and Erd\H{o}s in 1975 conjectured, and Chv\'atal, R\"odl, Szemer\'edi and Trotter later proved, that the Ramsey number of any bounded degree graph is linear in the number of vertices. In this paper, we disprove the natural directed…

As an extension of our previous work in Sun et.al (2018) [41], we develop a discontinuous Galerkin method for solving cross-diffusion systems with a formal gradient flow structure. These systems are associated with non-increasing entropy…

Haxell et. al. [%P. Haxell, T. Luczak, Y. Peng, V. R\"{o}dl, A. %Ruci\'{n}ski, M. Simonovits, J. Skokan, The Ramsey number for hypergraph cycles I, J. Combin. Theory, Ser. A, 113 (2006), 67-83] proved that the 2-color Ramsey number of…

Many important theorems in combinatorics, such as Szemer\'edi's theorem on arithmetic progressions and the Erd\H{o}s-Stone Theorem in extremal graph theory, can be phrased as statements about independent sets in uniform hypergraphs. In…

Let $f^{(r)}(n;s,k)$ denote the maximum number of edges in an $n$-vertex $r$-uniform hypergraph containing no subgraph with $k$ edges and at most $s$ vertices. Brown, Erd\H{o}s and S\'os [New directions in the theory of graphs (Proc. Third…

In the finite projective space PG$(2n,q)$ we consider flags of type $(n-1,n)$, that is, pairs $(A,B)$ consisting of an $(n-1)$-space $A$ and an $n$-space $B$ that are incident. Two such flags $(A_1,B_1)$ and $(A_2,B_2)$ are opposite if…

Erd\H{o}s conjectured in 1956 that there are $x^{1-o(1)}$ Carmichael numbers up to $x$. Pomerance made this conjecture more precise and proposed that there are $x^{1-{\frac{\{1+o(1)\}\log\log\log x}{\log\log x}}}$ Carmichael numbers up to…

The likelihood encoder with a random codebook is demonstrated as an effective tool for source coding. Coupled with a soft covering lemma (associated with channel resolvability), likelihood encoders yield simple achievability proofs for…

Let $\Sigma=\{a_1, \ldots , a_n\}$ be a set of positive integers with $a_1 < \ldots < a_n$ such that all $2^n$ subset sums are pairwise distinct. A famous conjecture of Erd\H{o}s states that $a_n>C\cdot 2^n$ for some constant $C$, while the…

The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…

After different variables and functions changes, the generalized dispersal problem, recalled in (1) below and considered in part I, see Labbas, Maingot and Thorel [14], leads us to consider, to study and to invert the sum of linear…

Roots of random polynomials have been studied exclusively in both analysis and probability for a long time. A famous result by Ibragimov and Maslova, generalizing earlier fundamental works of Kac and Erdos-Offord, showed that the…

Extending an earlier conjecture of Erd\H{o}s, Burr and Rosta conjectured that among all two-colorings of the edges of a complete graph, the uniformly random coloring asymptotically minimizes the number of monochromatic copies of any fixed…

We prove essentially sharp bounds for Ramsey numbers of ordered hypergraph matchings, inroduced recently by Dudek, Grytczuk, and Ruci\'{n}ski. Namely, for any $r \ge 2$ and $n \ge 2$, we show that any collection $\mathcal H$ of $n$ pairwise…

In this paper we provide an $O(m (\log \log n)^{O(1)} \log(1/\epsilon))$-expected time algorithm for solving Laplacian systems on $n$-node $m$-edge graphs, improving improving upon the previous best expected runtime of $O(m \sqrt{\log n}…