Related papers: Sum-difference exponents for boundedly many slopes…
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree of each term should be small (up to 10), and the number of…
Let $\mathbb{K}$ be a field of characteristic $0$. For each choice of distinct $a_1, \ldots, a_n\in \mathbb{K}$ and distinct $b_1, \ldots, b_n\in \mathbb{K}$, consider the sum $S=\sum_{i=1}^n a_i b_{\pi(i)}$ as $\pi$ ranges over the…
We prove two theorems concerning extreme values of general Gaussian fields. Our first theorem concerns with the concept of multiple peaks. A theorem of Chatterjee states that when a centered Gaussian field admits the so-called…
We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…
Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…
A rational distance set is a subset of the plane such that the distance between any two points is a rational number. We show, assuming Lang's Conjecture, that the cardinalities of rational distance sets in general position are uniformly…
A (d,k) set is a subset of R^d containing a translate of every k-dimensional plane. Bourgain showed that for k \geq k_{cr}(d), where k_{cr}(d) solves 2^{k_{cr}-1}+k_{cr} = d, every (d,k) set has positive Lebesgue measure. We give a short…
Strong data processing inequalities (SDPI) are an important object of study in Information Theory and have been well studied for $f$-divergences. Universal upper and lower bounds have been provided along with several applications,…
Let $K_n$ denote the number of distinct values among the first $n$ terms of an infinite exchangeable sequence of random variables $(X_1,X_2,\ldots)$. We prove for $n=3$ that the extreme points of the convex set of all possible laws of $K_3$…
A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…
The union-closed sets conjecture states that in any nonempty union-closed family $\mathcal{F}$ of subsets of a finite set, there exists an element contained in at least a proportion $1/2$ of the sets of $\mathcal{F}$. Using the…
It is shown that at least 50% of the probability mass of a sum of independent Rademacher random variables is within one standard deviation from its mean. This lower bound is sharp, it is much better than for instance the bound that can be…
In this article we establish an asymptotic formula for the number of rational points, with bounded denominators, within a given distance to a compact submanifold $\mathcal{M}$ of $\mathbb{R}^M$ with a certain curvature condition. Our result…
In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…
Optimal upper bounds are provided for the dominant dimensions of Nakayama algebras and more generally algebras $A$ with an idempotent $e$ such that there is a minimal faithful injective-projective module $eA$ and such that $eAe$ is a…
We establish a new bound for the exponential sum \begin{eqnarray*} \sum_{x\in\mathcal{X}}\Big|\sum_{y\in \mathcal{Y}}\gamma(y)\exp(2\pi i a \lambda^{xy}/p)\Big|, \end{eqnarray*} where $\lambda$ is an element of the residue ring modulo a…
We present combinatorial upper bounds on dimensions of certain imaginary root spaces for symmetric Kac-Moody algebras. These come from the realization of the corresponding infinity-crystal using quiver varieties. The framework is general,…
We prove that the range of exponents in Mockenhaupt's restriction theorem for Salem sets, with the endpoint estimate due to Bak and Seeger, is optimal.
Handling an infinite number of inequality constraints in infinite-dimensional spaces occurs in many fields, from global optimization to optimal transport. These problems have been tackled individually in several previous articles through…
For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…