English
Related papers

Related papers: Toward the best constant factor for the Rademacher…

200 papers

We consider a random graph G(n,p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u,v} of vertices have a distance…

Computational Geometry · Computer Science 2013-04-10 Abbas Mehrabian , Nick Wormald

We prove a sharp quantitative version of the $p$-Sobolev inequality for any $1<p<n$, with a control on the strongest possible distance from the class of optimal functions. Surprisingly, the sharp exponent is constant for $p<2$, while it…

Functional Analysis · Mathematics 2020-03-10 Alessio Figalli , Yi Ru-Ya Zhang

In this work we improve the sharp Hardy inequality in the case $p>n$ by adding an optimal weighted Hoelder semi-norm. To achieve this we first obtain a local improvement. We also obtain a refinement of both the Sobolev inequality for $p>n$…

Analysis of PDEs · Mathematics 2013-10-14 Georgios Psaradakis

We determine the explicit value of the optimal constant in the trace inequality for functions of bounded variations in the case the domain has a particular class of singularities.

Analysis of PDEs · Mathematics 2026-04-16 Riccardo Cristoferi , Devin van der Gulik

\begin{abstract} In this paper we address the problem of finding the best constants in inequalities of the form: $$ \|\big(|P_+f|^s+|P_-f|^s\big)^{\frac{1}{s}}\|_{L^p({\mathbb{T}})}\leq A_{p,s} \|f\|_{L^p({\mathbb{T}})},$$ where $P_+f$ and…

Complex Variables · Mathematics 2023-07-06 Petar Melentijević

Given an undirected graph $G$, the classical Cheeger constant, $h_G$, measures the optimal partition of the vertices into 2 parts with relatively few edges between them based upon the sizes of the parts. The well-known Cheeger's inequality…

Combinatorics · Mathematics 2015-03-02 Franklin Kenter , Mary Radcliffe

We estimate the rate of change of the best constant in the Sobolev inequality of a Euclidean domain which moves outward. Along the way we prove an inequality which reverses the usual Holder inequality, which may be of independent interest.

Analysis of PDEs · Mathematics 2020-01-30 Tom Carroll , Mouhamed Moustapha Fall , Jesse Ratzkin

Given $A\subseteq\mathbb Z_n$, the constant $C_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has an $A$-weighted zero-sum subsequence having consecutive terms. The value of…

Number Theory · Mathematics 2023-04-06 Santanu Mondal , Krishnendu Paul , Shameek Paul

To quantify the dependence between two random vectors of possibly different dimensions, we propose to rely on the properties of the 2-Wasserstein distance. We first propose two coefficients that are based on the Wasserstein distance between…

Statistics Theory · Mathematics 2021-10-19 Gilles Mordant , Johan Segers

Let $M_{n}$ denote a random symmetric $n\times n$ matrix, whose entries on and above the diagonal are i.i.d. Rademacher random variables (taking values $\pm 1$ with probability $1/2$ each). Resolving a conjecture of Vu, we prove that the…

Probability · Mathematics 2021-10-29 Matthew Kwan , Lisa Sauermann

Let $\mathcal{P}$ be the set of all primes and $\psi(n)=n\prod_{n\in \mathcal{P},p|n}(1+1/p)$ be the Dedekind psi function. We show that the Riemann hypothesis is satisfied if and only if $f(n)=\psi(n)/n-e^{\gamma} \log \log n <0$ for all…

General Mathematics · Mathematics 2010-10-26 Michel Planat

A combinatorial proof of the Gaussian product inequality (GPI) is given under the assumption that each component of a centered Gaussian random vector $\boldsymbol{X} = (X_1, \ldots, X_d)$ of arbitrary length can be written as a linear…

Probability · Mathematics 2022-11-18 Christian Genest , Frédéric Ouimet

Let m and r be two integers. Let G be a connected r-regular graph of order n and k an integer depending on m and r. For even kn, we find a best upper bound (in terms of r and m) on the third largest eigenvalue that is sufficient to…

Combinatorics · Mathematics 2010-03-10 Hongliang Lu

We give exponential upper bounds for $P(S \le k)$, in particular $P(S=0)$, where $S$ is a sum of indicator random variables that are positively associated. These bounds allow, in particular, a comparison with the independent case. We give…

Probability · Mathematics 2014-12-22 Matthias Löwe , Franck Vermet

Consider some convex body $K\subset\mathbb R^d$. Let $X_1,\dots, X_k$, where $k\leq d$, be random points independently and uniformly chosen in $K$, and let $\xi_k$ be a uniformly distributed random linear $k$-plane. We show that for…

Metric Geometry · Mathematics 2022-02-08 Alexander E. Litvak , Dmitry Zaporozhets

Robin's Inequality posits $G(n)<e^{\gamma}$ for $n>5040$. Robin also showed that if the Riemann Hypothesis (RH) is false, then $G(n)>e^{\gamma}\left(1+\displaystyle\frac{c}{(\log n)^{b}}\right)$ for infinitely many values of $n$. By…

Number Theory · Mathematics 2025-10-29 Bruce Zimov

We prove a Khintchine type inequality under the assumption that the sum of Rademacher random variables equals zero. As an application we show a new tail-bound for a hypergeometric random variable.

Probability · Mathematics 2019-08-15 Susanna Spektor

In this paper, we will use a suitable tranform to investigate the sharp constants and optimizers for the following Caffarelli-Kohn-Nirenberg inequalities for a wide range of parameters $(r,p,q,s,\mu,\sigma)$ and $0\leq a\leq1$:…

Analysis of PDEs · Mathematics 2015-10-06 Nguyen Lam , Guozhen Lu

We prove a dimension-free tail comparison between the Euclidean norms of sums of independent random vectors uniformly distributed in centred Euclidean spheres and properly rescaled standard Gaussian random vectors.

Probability · Mathematics 2018-01-25 Piotr Nayar , Tomasz Tkocz

In this paper, first by employing inequalities derived from the Opial inequality due to David Boyd with best constant, we will establish new unconditional lower bounds for the gaps between the zeros of the Riemann zeta function. Second, on…

Number Theory · Mathematics 2010-06-23 S. H. Saker
‹ Prev 1 8 9 10 Next ›