Related papers: On Talagrand's Convexity Conjecture

This paper derives a new strong Gaussian approximation bound for the sum of independent random vectors. The approach relies on the optimal transport theory and yields \textit{explicit} dependence on the dimension size $p$ and the sample…

We provide the final step in the resolution of Bourgain's slicing problem in the affirmative. Thus we establish the following theorem: for any convex body $K \subseteq \mathbb{R}^n$ of volume one, there exists a hyperplane $H \subseteq…

In these notes, we investigate the tail behaviour of the norm of subgaussian vectors in a Hilbert space. The subgaussian variance proxy is given as a trace class operator, allowing for a precise control of the moments along each dimension…

Let A be an n*n random matrix with mean zero and independent inhomogeneous non-constant subgaussian entries. We get that for any k<c\sqrt{n}, the probability of the matrix has a lower rank than n-k that is sub-exponential. Furthermore, we…

In this paper, authors study the convexity and concavity properties of real-valued function with respect to the classical means, and prove a conjecture posed by Bruce Ebanks in \cite{e}.

We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical…

Inspired by Milman's recent observation, we prove that the Gaussian correlation inequality holds for convex sets having the same barycenter, and especially for centered ones. This gives an affirmative answer to the problem proposed by…

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

Suppose that $C$ is a bounded, convex subset of $\mathbb{R}^n$, and that $P_1, \dots, P_k$ are planks which cover $C$ in respective directions $v_1, \dots, v_k$ and with widths $w_1, \dots, w_k$. In 1951, Bang conjectured that the sum of…

A recent conjecture by I. Ra\c{s}a asserts that the sum of the squared Bernstein basis polynomials is a convex function in $[0,1]$. This conjecture turns out to be equivalent to a certain upper pointwise estimate of the ratio…

We establish a general principle which states that regularizing an inverse problem with a convex function yields solutions which are convex combinations of a small number of atoms. These atoms are identified with the extreme points and…

The authors present evidence for universality in numerical computations with random data. Given a (possibly stochastic) numerical algorithm with random input data, the time (or number of iterations) to convergence (within a given tolerance)…

We prove equality of the vector field (iterated commutator) type and the regular contact type, which together with the Bloom theorem on equality of the Levi-form type and the regular contact type provides a complete solution of a long…

Olshanski's centralizer construction provides a realization of the Yangian for the Lie algebra gl(n) as a subalgebra in the projective limit of a chain of centralizers in the universal enveloping algebras. We give a modified version of this…

We show by a ridiculously simple argument that, for any norm on the tensor product of vector spaces, every element of the completion can be represented as a convergent series of elementary tensors.

We consider a general class of regression models with normally distributed covariates, and the associated nonconvex problem of fitting these models from data. We develop a general recipe for analyzing the convergence of iterative algorithms…

In this paper, using combinatorial and analytic methods, we prove an exact calculating formula on the $2m$-th power mean value of the generalized quadratic Gauss sums for $m\geq 2$. This solves a conjecture of He and Zhang [`On the $2k$-th…

A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, with $F_{n+1} = F_n + F_{n-1}$ and $F_1=1, F_2=2$. If instead we allow the…

We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $\mathcal F$ of subsets of a finite set $V$. The full conjecture implies equivalence of the "Fractional…

We introduce a novel relaxation of combinatorial discrepancy called Gaussian discrepancy, whereby binary signings are replaced with correlated standard Gaussian random variables. This relaxation effectively reformulates an optimization…