English
Related papers

Related papers: An example related to the slicing inequality for g…

200 papers

We determine a lower gap property for the growth of an unbounded \(\mathbb{Z}\)-valued \(k\)-regular sequence. In particular, if \(f:\mathbb{N}\to\mathbb{Z}\) is an unbounded \(k\)-regular sequence, we show that there is a constant \(c>0\)…

Number Theory · Mathematics 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare

Let us consider i.i.d. random variables $\{a_k,b_k\}_{k \geq 1}$ defined on a common probability space $(\Omega, \mathcal F, \mathbb P)$, following a symmetric Rademacher distribution and the associated random trigonometric polynomials…

Probability · Mathematics 2021-11-25 Jürgen Angst , Guillaume Poly

We prove the following theorem. Let $\mu$ be a measure on $R^n$ with even continuous density, and let $K,L$ be origin-symmetric convex bodies in $R^n$ so that $\mu(K\cap H)\le \mu(L\cap H)$ for any central hyperplane H. Then $\mu(K)\le…

Functional Analysis · Mathematics 2014-05-22 Alexander Koldobsky , Artem Zvavitch

We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability measure. This provides a refined and unified framework for the…

Data Structures and Algorithms · Computer Science 2007-05-23 Robert Krauthgamer , James R. Lee , Manor Mendel , Assaf Naor

If a convex body $K \subset \mathbb{R}^n$ is covered by the union of convex bodies $C_1, \ldots, C_N$, multiple subadditivity questions can be asked. Two classical results regard the subadditivity of the width (the smallest distance between…

Metric Geometry · Mathematics 2020-09-16 Alexey Balitskiy

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

Computational Geometry · Computer Science 2023-12-05 Friedrich Eisenbrand , Matthieu Haeberle , Neta Singer

We show that the problem of finding the simplex of largest volume in the convex hull of $n$ points in $\mathbb{Q}^d$ can be approximated with a factor of $O(\log d)^{d/2}$ in polynomial time. This improves upon the previously best known…

Computational Geometry · Computer Science 2014-06-16 Marco Di Summa , Friedrich Eisenbrand , Yuri Faenza , Carsten Moldenhauer

Let $A$ be a finite subset of an abelian group $G$, and suppose that $|A+A|\leq K|A|$. We show that for any $\epsilon>0$, there exists a constant $C_\epsilon$ such that $A$ can be covered by at most $\exp(C_\epsilon \log(2K)^{1+\epsilon})$…

Number Theory · Mathematics 2026-03-02 Rushil Raghavan

In a recent study, H. Alzer and the author showed that the sine polynomial $$ \sum_{k=1}^{n-1} \left( \frac{n}{k} - \frac{k}{n} \right) ^\beta \,\sin(kx) > 0 $$ is nonnegative for $ x\in[0,\pi ] $, $ n\geq 2, \, \beta \geq \beta _1 :=…

Classical Analysis and ODEs · Mathematics 2017-02-14 Man Kam Kwong

We demonstrate a phenomenon of condensation of the Fourier transform $\widehat{f}$ of a function $f$ defined on the real line $\mathbb{R}$ which decreases rapidly on one half of the line. For instance, we prove that if $f$ is…

Complex Variables · Mathematics 2023-11-28 Bartosz Malman

An important theorem of Banaszczyk (Random Structures & Algorithms `98) states that for any sequence of vectors of $\ell_2$ norm at most $1/5$ and any convex body $K$ of Gaussian measure $1/2$ in $\mathbb{R}^n$, there exists a signed…

Data Structures and Algorithms · Computer Science 2016-12-14 Daniel Dadush , Shashwat Garg , Shachar Lovett , Aleksandar Nikolov

For a Minkowski centered convex compact set $K$ we define $\alpha(K)$ to be the smallest possible factor to cover $K \cap (-K)$ by a rescalation of $\mathrm{conv} (K\cup (-K))$ and give a complete description of the possible values of…

Metric Geometry · Mathematics 2024-01-29 René Brandenberg , Katherina von Dichter , Bernardo González Merino

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Number Theory · Mathematics 2019-10-28 David J. Grynkiewicz

We develop a technique using dual mixed-volumes to study the isotropic constants of some classes of spaces. In particular, we recover, strengthen and generalize results of Ball and Junge concerning the isotropic constants of subspaces and…

Functional Analysis · Mathematics 2007-05-23 Emanuel Milman

We prove the congruence $\sum_{1 \leq k < \sqrt{N}} \sigma_0 (N - k^2) \equiv 0 \pmod 4$, where $\sigma_0(m)$ denotes the number of positive divisors of $m$, for $N = An + B$ with $(A,B) \in \{ (16,14),$ $(36,30),$ $(72,42),$ $(196,70),$…

Let $\mu_p$ be the generalized Gaussian distribution on $\mathbb{R}^n$ with density $e^{-\frac{|x|^p}{p}}$ multiplied by a constant depending on $p\ge 1$ and $n$, and $\alpha_p(n)$ be the largest number such that the Brunn-Minkowski type…

Metric Geometry · Mathematics 2026-05-26 Ge Xiong , Kai-Wen Yang

The Reifenberg theorem \cite{reif_orig} tells us that if a set $S\subseteq B_2\subseteq \mathbb R^n$ is uniformly close on all points and scales to a $k$-dimensional subspace, then $S$ is H\"older homeomorphic to a $k$-dimensional Euclidean…

Analysis of PDEs · Mathematics 2024-05-07 Nicholas Edelen , Aaron Naber , Daniele Valtorta

By a classical theorem of Koksma the sequence of fractional parts $(\{x^n\})_{n \geq 1}$ is uniformly distributed for almost all values of $x$. In the present paper we obtain an exact quantitative version of Koksma's theorem, by calculating…

Number Theory · Mathematics 2013-08-16 Christoph Aistleitner

We introduce the "Median Inverse Problem" for metric spaces. In particular, having a permutation $\pi$ in the symmetric group $S_n$ (endowed with the breakpoint distance), we study the set of all $k$-subsets $\{x_1,...,x_k\}\subset S_n$ for…

Combinatorics · Mathematics 2017-12-11 Poly H. da Silva , Arash Jamshidpey , David Sankoff

We give a simple conceptual proof of the consistency of a test for multivariate uniformity in a bounded set $K \subset \mathbb{R}^d$ that is based on the maximal spacing generated by i.i.d. points $X_1, \ldots,X_n$ in $K$, i.e., the volume…

Statistics Theory · Mathematics 2017-08-31 Norbert Henze