English
Related papers

Related papers: Bounding the norm of a log-concave vector via thin…

200 papers

We prove estimates for $\mathbb{E} \| X: \ell_{p'}^n \to \ell_q^m\|$ for $p,q\ge 2$ and any random matrix $X$ having the entries of the form $a_{ij}Y_{ij}$, where $Y=(Y_{ij})_{1\le i\le m, 1\le j\le n}$ has i.i.d. isotropic log-concave…

Probability · Mathematics 2025-02-05 Marta Strzelecka

Let $\pi'$ be a fixed unitary cuspidal representation of $\mathrm{GL}(n)/\mathbb{Q}.$ We establish a subconvex bound in the $t$-aspect $$ L(1/2+it,\pi\times\pi')\ll_{\pi,\pi',\varepsilon}(1+|t|)^{\frac{n(n+1)}{4}-\frac{1}{4\cdot…

Number Theory · Mathematics 2023-09-15 Liyang Yang

For any $\epsilon > 0$, we show that if $G$ is a regular graph on $n \gg_\epsilon 1$ vertices that is $\epsilon$-far (differs by at least $\epsilon n^2$ edges) from any Tur\'{a}n graph, then its second eigenvalue $\lambda_2$ satisfies…

Combinatorics · Mathematics 2025-07-15 Shengtong Zhang

We prove a sharp moment inequality for a log-concave or a log-convex function, on Gaussian random vectors. As an application we take a stability result for the classical logarithmic Sobolev inequality of L. Gross in the case where the…

Probability · Mathematics 2016-10-17 Nikos Dafnis , Grigoris Paouris

In 2004, Kim and Vu conjectured that, when $d=\omega(\log n)$, the random $d$-regular graph $G_d(n)$ can be sandwiched with high probability between two random binomial graphs $G(n,p)$ with edge probabilities asymptotically equal to…

Combinatorics · Mathematics 2025-12-09 Natalie Behague , Daniel Il'kovič , Richard Montgomery

The X-ray numbers of some classes of convex bodies are investigated. In particular, we give a proof of the X-ray Conjecture as well as of the Illumination Conjecture for almost smooth convex bodies of any dimension and for convex bodies of…

Metric Geometry · Mathematics 2011-09-29 Karoly Bezdek , Gyorgy Kiss

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

Statistics Theory · Mathematics 2013-11-13 Victor-Emmanuel Brunel

The Local Converse Problem is to determine how the family of the local gamma factors $\gamma(s,\pi\times\tau,\psi)$ characterizes the isomorphism class of an irreducible admissible generic representation $\pi$ of $\mathrm{GL}_n(F)$, with…

Number Theory · Mathematics 2015-04-14 Dihua Jiang , Chufeng Nien , Shaun Stevens

Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a given star-shaped body. The complexity of the algorithm grows…

Data Structures and Algorithms · Computer Science 2009-04-06 Karthekeyan Chandrasekaran , Daniel Dadush , Santosh Vempala

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…

Group Theory · Mathematics 2013-01-30 Daniela Bubboloni , Cheryl E. Praeger , Pablo Spiga

Let $\Gamma$ be a countable abelian group. An (abstract) $\Gamma$-system $\mathrm{X}$ - that is, an (abstract) probability space equipped with an (abstract) probability-preserving action of $\Gamma$ - is said to be a Conze-Lesigne system if…

Dynamical Systems · Mathematics 2024-02-20 Asgar Jamneshan , Or Shalom , Terence Tao

Let $G$ be a graph with adjacency matrix $A(G)$. We conjecture that \[2n^+(G) \le n^-(G)(n^-(G) + 1),\] where $n^+(G)$ and $n^-(G)$ denote the number of positive and negative eigenvalues of $A(G)$, respectively. This conjecture generalizes…

Combinatorics · Mathematics 2025-12-23 Saieed Akbari , Clive Elphick , Hitesh Kumar , Shivaramakrishna Pragada , Quanyu Tang

Let a random simplex in a d-dimensional convex body be the convex hull of d+1 random points from the body. We study the following question: As a function of the convex body, is the expected volume of a random simplex monotone non-decreasing…

Probability · Mathematics 2014-01-14 Luis Rademacher

We consider the Gaussian correlation inequality for nonsymmetric convex sets. More precisely, if $A\subset\mathbb{R}^d$ is convex and the origin $0\in A$, then for any ball $B$ centered at the origin, it holds $\gamma_d(A\cap B)\geq…

Probability · Mathematics 2013-01-30 Adrian P. C. Lim , Dejun Luo

Let $T$ be a bijective map on $\mathbb{R}^n$ such that both $T$ and $T^{-1}$ are Borel measurable. For any $\btheta \in \mathbb{R}^n$ and any real $n \times n$ positive definite matrix $\Sigma,$ let $N (\btheta, \Sigma)$ denote the…

Probability · Mathematics 2011-11-28 K. R. Parthasarathy

Bayesian statistical inference for Generalized Linear Models (GLMs) with parameters lying on a constrained space is of general interest (e.g., in monotonic or convex regression), but often constructing valid prior distributions supported on…

Methodology · Statistics 2021-09-02 Rahul Ghosal , Sujit K. Ghosh

The key point to prove the optimal $C^{1,\frac12}$ regularity of the thin obstacle problem is that the frequency at a point of the free boundary $x_0\in\Gamma(u)$, say $N^{x_0}(0^+,u)$, satisfies the lower bound $N^{x_0}(0^+,u)\ge\frac32$.…

Analysis of PDEs · Mathematics 2023-07-25 Matteo Carducci

We prove that any centered $1$-subgaussian random vector in $\mathbb{R}^{n}$ can be written as the sum of a universal number of standard Gaussian vectors. Following the work of the second-named author, this solves M. Talagrand's convexity…

Probability · Mathematics 2026-05-12 Dongming Merrick Hua , Antoine Song , Stefan Tudose

We prove a conjecture of Menasco and Zhang that if a tangle is completely tubing compressible then it consists of at most two families of parallel strands. This is related to problems of graphs in 3-manifold. A 1-vertex graph $\Gamma$ in a…

Geometric Topology · Mathematics 2007-05-23 Ying-Qing Wu

Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid…

Combinatorics · Mathematics 2023-09-01 Blas Fernández , Roghayeh Maleki , Štefko Miklavič , Giusy Monzillo