English
Related papers

Related papers: Minimal Gaps and Additive Energy in real-valued se…

200 papers

Dependence among marginally constrained observations can break a finite-sample barrier. To formalize this phenomenon, we introduce the \emph{minimum list entropy coupling} $H(P\|Q_1,\dots,Q_m)$, the minimum conditional entropy…

Information Theory · Computer Science 2026-05-18 Shahab Asoodeh , Jun Chen

We discuss three convolution inequalities that are connected to additive combinatorics. Cloninger and the second author showed that for nonnegative $f \in L^1(-1/4, 1/4)$, $$ \max_{-1/2 \leq t \leq 1/2} \int_{\mathbb{R}}{f(t-x) f(x) dx}…

Classical Analysis and ODEs · Mathematics 2020-02-20 Richard C. Barnard , Stefan Steinerberger

Given a positive integer $m$, let $\mathbb{Z}_m$ be the set of residue classes mod $m$. For $A\subseteq \mathbb{Z}_m$ and $n\in \mathbb{Z}_m$, let $\sigma_A(n)$ be the number of solutions to the equation $n=x+y$ with $x,y\in A$. Let…

Number Theory · Mathematics 2024-07-11 Guangping Liang , Yu Zhang , Haode Zuo

For the Riesz and logarithmic potentials, we consider greedy energy sequences $(a_n)_{n=0}^\infty$ on the unit circle $S^1$, constructed in such a way that for every $n\geq 1$, the discrete potential generated by the first $n$ points…

Classical Analysis and ODEs · Mathematics 2024-07-16 Abey López-García , Erwin Miña-Díaz

We prove an upper bound for the least prime in an irrational Beatty sequence. This result may be compared with Linnik's theorem on the least prime in an arithmetic progression.

Number Theory · Mathematics 2016-07-26 Jörn Steuding , Marc Technau

We show that for log-concave real random variables with fixed variance the Shannon differential entropy is minimized for an exponential random variable. We apply this result to derive upper bounds on capacities of additive noise channels…

Probability · Mathematics 2024-03-19 James Melbourne , Piotr Nayar , Cyril Roberto

A small value estimate is a statement providing necessary conditions for the existence of certain sequences of non-zero polynomials with integer coefficients taking small values at points of an algebraic group. Such statements are desirable…

Number Theory · Mathematics 2014-01-14 Damien Roy

We consider sub-critical configuration models and show that the central limit theorem for any additive statistic holds when the statistics satisfies a fourth moment assumption, a variance lower bound and the degree sequence of graph…

Probability · Mathematics 2019-02-22 Siva Athreya , D. Yogeshwaran

The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. Its correct interpretation as a measure of uniformity of the degree sequence requires the determination of its extremal…

Combinatorics · Mathematics 2022-05-09 Stijn Cambie , Matteo Mazzamurro

Given $1\le q \le 2$ and $\alpha\in\mathbb R$, we study the properties of the solutions of the minimum problem \[ \lambda(\alpha,q)=\min\left\{\dfrac{\displaystyle\int_{-1}^{1}|u'|^{2}dx+\alpha\left|\int_{-1}^{1}|u|^{q-1}u\,…

Analysis of PDEs · Mathematics 2024-10-08 Francesco Della Pietra , Gianpaolo Piscitelli

Inspired by recent work on minimizers and gradient flows of constrained interaction energies, we prove that these energies arise as the slow diffusion limit of well-known aggregation-diffusion energies. We show that minimizers of…

Analysis of PDEs · Mathematics 2019-05-14 Katy Craig , Ihsan Topaloglu

Following recent work by Koll\'{a}r and Sarnak, we study gaps in the spectra of large connected cubic and quartic graphs with minimum spectral gap. We focus on two sequences of graphs, denoted $\Delta_n$ and $\Gamma_n$ which are more…

Combinatorics · Mathematics 2022-07-22 Maryam Abdi , Ebrahim Ghorbani

A power series being given as the solution of a linear differential equation with appropriate initial conditions, minimization consists in finding a non-trivial linear differential equation of minimal order having this power series as a…

Symbolic Computation · Computer Science 2023-07-19 Alin Bostan , Tanguy Rivoal , Bruno Salvy

We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer.…

Data Structures and Algorithms · Computer Science 2023-02-14 Florian Adriaens , Aristides Gionis

The Amosov-Holevo-Werner conjecture implies the additivity of the minimum Re'nyi entropies at the output of a channel. The conjecture is proven true for all Re'nyi entropies of integer order greater than two in a class of Gaussian bosonic…

Quantum Physics · Physics 2009-11-10 Vittorio Giovannetti , Seth Lloyd

In this work we review and derive some elementary properties of the discrete renewal sequences based on a positive, finite and integer-valued random variable. Our results consider these sequences as dependent on the probability masses of…

Probability · Mathematics 2024-05-28 Nikolai Nikolov , Mladen Savov

This paper extends classical probabilistic results to the broader class of demimartingales and demisubmartingales. We establish variants of Doob's-type optional sampling theorem under minimal structural conditions on stopping times, relying…

Probability · Mathematics 2025-07-24 Milto Hadjikyriakou , B. L. S Prakasa Rao

The possibility of a modification of special relativity with an invariant energy scale playing the role of a minimum energy is explored. Consistency with the equivalence of different inertial frames is obtained by an appropriate choice of a…

High Energy Physics - Phenomenology · Physics 2009-11-11 Jose Manuel Carmona , Jose Luis Cortes

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

Probability · Mathematics 2015-03-20 Kari Eloranta

Let $n$ denote the number of elements currently in a data structure. An in-place heap is stored in the first $n$ locations of an array, uses $O(1)$ extra space, and supports the operations: minimum, insert, and extract-min. We introduce an…

Data Structures and Algorithms · Computer Science 2014-07-15 Stefan Edelkamp , Jyrki Katajainen , Amr Elmasry