Related papers: Universal Barrier is $n$-Self-Concordant

This is the first paper in a sequence on Krull dimension for limit groups, answering a question of Z. Sela. In this paper we show that strict resolutions of a fixed limit group have uniformly bounded length. The upper bound plays two roles…

We obtain upper and lower bounds for Steklov eigenvalues of submanifolds with prescribed boundary in Euclidean space. A very general upper bound is proved, which depends only on the geometry of the fixed boundary and on the measure of the…

We prove quantitative sub-ballisticity for the self-avoiding walk on the hexagonal lattice. Namely, we show that with high probability a self-avoiding walk of length $n$ does not exit a ball of radius $O(n/\log{n})$. Previously, only a…

We show that domains, that allow for convex functions with unbounded gradient at their boundary, are convex.

We derive a bound on the conformal dimensions of the lightest few states in general unitary 2d conformal field theories with discrete spectra using modular invariance, including CFTs with chiral currents. We derive a bound on the conformal…

It is shown that any non-degenerate $\mathbb C$-convex domain in $\mathbb C^n$ is uniformly squeezing. It is also found the precise behavior of the squeezing function near a Dini-smooth boundary point of a plane domain.

We consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization…

We present a constructive lower bound of $\Omega(1/\sqrt{\varepsilon})$ for Frank-Wolfe (FW) when both the objective and the constraint set are smooth and strongly convex, showing that the known uniform $\mathcal{O}(1/\sqrt{\varepsilon})$…

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$.…

The leading, planar diagrams of the $1/N_c$ expansion and the usual string description suggest that quarks propagate on the boundary of a two-dimensional world surface. We restrict the quarks to the boundary of the world surface by giving…

Von Neumann's original proof of the ergodic theorem is revisited. A uniform convergence rate is established under the assumption that one can control the density of the spectrum of the underlying self-adjoint operator when restricted to…

We give a new proof of the isoperimetric inequality in the plane, based on Steiner's formula for the area of a convex neighborhood. This proof establishes the isoperimetric inequality directly, without requiring that we separately establish…

Given a line segment $I=[0,L]$, the so-called barrier, and a set of $n$ sensors with varying ranges positioned on the line containing $I$, the barrier coverage problem is to move the sensors so that they cover $I$, while minimising the…

We identify a universal structural principle underlying the smoothing of classical divergences: the optimizer of the smoothing problem is a clipped probability vector, independently of the specific divergence. This yields a…

This paper deals with the homogeneous Neumann boundary-value problem for the chemotaxis-consumption system \begin{eqnarray*} \begin{array}{llc} u_t=\Delta u-\chi\nabla\cdot (u\nabla v)+\kappa u-\mu u^2,\\ v_t=\Delta v-uv, \end{array}…

We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…

We consider a type of Hardy-Sobolev inequality, whose weight function is singular on the whole domain boundary. We are concerned with the attainability of the best constant of such inequality. In dimension two, we link the inequality to a…

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…

A classic result by Cook, Gerards, Schrijver, and Tardos provides an upper bound of $n \Delta$ on the proximity of optimal solutions of an Integer Linear Programming problem and its standard linear relaxation. In this bound, $n$ is the…

We study the Dirichlet eigenvalues of the Laplacian on a convex domain in $\mathbb{R}^n$, with $n\geq 2$. In particular, we generalize and improve upper bounds for the Riesz means of order $\sigma\geq 3/2$ established in an article by…