Related papers: Extension of a Method of Gilmer

In this paper, we study the regularity properties of bounded entropy solutions to the isentropic Euler equations with $\gamma = 3$. First, we use a blow-up technique to obtain a new trace theorem for all such solutions. Second, we use a…

Gilbert proposed an algorithm for bounding the distance between a given point and a convex set. In this article we apply the Gilbert's algorithm to get an upper bound on the Hilbert-Schmidt distance between a given state and the set of…

We examine strategy-proof elections to select a winner amongst a set of agents, each of whom cares only about winning. This impartial selection problem was introduced independently by Holzman and Moulin and Alon et al. Fisher and Klimm…

The well known maximum-entropy principle due to Jaynes, which states that given mean parameters, the maximum entropy distribution matching them is in an exponential family, has been very popular in machine learning due to its "Occam's…

Grammar compression represents a string as a context free grammar. Achieving compression requires encoding such grammar as a binary string; there are a few commonly used encodings. We bound the size of practically used encodings for several…

This paper studies bounds in a strong form of regularity for $3$-uniform hypergraphs which was developed by Frankl, Gowers, Kohayakawa, Nagle, R\"{o}dl, Skokan, and Schacht. Regular decompositions of this type involve two structural…

Newman, Schneider and Shalev defined the entropy of a graded associative algebra A as H(A) = \limsup_{n \to \infty} \sqrt[n]{a_n}, where a_n is the vector space dimension of the n'th homogeneous component. When A is the homogeneous quotient…

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Engbers and Galvin asked how large $i_t(G)$ could be in graphs with minimum degree at least $\delta$. They further conjectured that when $n\geq 2\delta$ and $t\geq…

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

Let $A_1, A_2, \ldots, A_n$ be events in a sample space. Given the probability of the intersection of each collection of up to $k+1$ of these events, what can we say about the probability that at least $r$ of the events occur? This question…

A family of sets is union-closed (UC) if the union of any two sets in the family is also in the family. Frankl's UC sets conjecture states that for any nonempty UC family $\mathcal{F} \subseteq 2^{[n]}$ such that $\mathcal{F} \neq…

A new, constructive proof with a small explicit constant is given to the Erd\H{o}s-Pyber theorem which says that the edges of a graph on $n$ vertices can be partitioned into complete bipartite subgraphs so that every vertex is covered at…

We prove existence and regularity of minimizers for a class of functionals defined on Borel sets in $R^n$. Combining these results with a refinement of the selection principle introduced by the authors in arXiv:0911.0786, we describe a…

In this short note, I show how a recent result of Alhejji and Smith [arXiv:1909.00787] regarding an optimal uniform continuity bound for classical conditional entropy leads to an optimal uniform continuity bound for quantum conditional…

We consider the problem of guessing the realization of a random variable but under more general Tsallis' non-extensive entropic framework rather than the classical Maxwell-Boltzman-Gibbs-Shannon framework. We consider both the conditional…

Let $A,B$ be sets of positive integers such that $A+B$ contains all but finitely many positive integers. S\'ark\"ozy and Szemer\'edi proved that if $ A(x)B(x)/x \to 1$, then $A(x)B(x)-x \to \infty $. Chen and Fang considerably improved…

In 1992, Bollob\'as and Meir showed that for every $k \geq 1$ there exists a constant $c_k$ such that, for any $n$ points in the $k$-dimensional unit cube $[0, 1]^k$, one can find a tour $x_1, \dots, x_n$ through these $n$ points with…

Best possible bounds are established for families without s pairwise disjoint members and the more general problem for several families. The results are shown to apply several classical results.

Although convolution on Euclidean space and the Heisenberg group satisfy the same $L^p$ bounds with the same optimal constants, the former has maximizers while the latter does not. However, as work of Christ has shown, it is still possible…

We consider a Wigner-type ensemble, i.e. large hermitian $N\times N$ random matrices $H=H^*$ with centered independent entries and with a general matrix of variances $S_{xy}=\mathbb E|H_{xy}|^2$. The norm of $H$ is asymptotically given by…