Related papers: Two-sided bounds for the logarithmic capacity of m…
Motivated by the construction of confidence intervals in statistics, we study optimal configurations of $2^d-1$ lines in real projective space $RP^{d-1}$. For small $d$, we determine line sets that numerically minimize a wide variety of…
In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the…
The paper introduces unbounded antilinear operators on Hilbert spaces and develops their fundamental theory. In particular, we establish a closed range theorem, a polar decomposition theorem, and the convexity of the numerical range for…
We establish an improved form of the classical logarithmic Sobolev inequality for the Gaussian measure restricted to probability densities which satisfy a Poincar\'e inequality. The result implies a lower bound on the deficit in terms of…
We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees…
Let $m\ge 2$ be an integer, $K$ an algebraic number field and $\alpha\in K\setminus \{0,-1\}$ with sufficiently small absolute value. In this article, we provide a new lower bound for linear form in…
We consider regularised quadratic optimal transport with subquadratic polynomial or entropic regularisation. In both cases, we prove interior Lipschitz-estimates on a transport-like map and interior gradient Lipschitz-estimates on the…
We study decaying half-line Schr\"odinger operators and the local eigenvalue spacing of their Dirichlet restrictions. While absolutely continuous spectrum is strongly associated with bulk universality and clock behavior, singular spectral…
The double-layer potential plays an important role in solving boundary value problems for elliptic equations. All the fundamental solutions of the generalized bi-axially symmetric Helmholtz equation were known, and only for the first one…
A sharp version of the Central Limit Theorem for linear combinations of iterates of an inner function is proved. The authors previously showed this result assuming a suboptimal condition on the coefficients of the linear combination. Here…
We study the excess capacity of deep networks in the context of supervised classification. That is, given a capacity measure of the underlying hypothesis class - in our case, empirical Rademacher complexity - to what extent can we (a…
Upper bounds are obtained for the $p$-capacity of compact sets in $\R^d$, with $d \ge 2$ and $1<p<d$. Upper and lower bounds are obtained for the product of $p$-capacity and powers of the $q$-torsional rigidity over the collection of all…
Given a pseudo-effective divisor L we construct the diminished ideal of L, a "continuous" extension of the asymptotic multiplier ideal for big divisors to the pseudo-effective boundary. For most pseudo-effective divisors L the multiplier…
Central limit theorems (CLTs) have a long history in probability and statistics. They play a fundamental role in constructing valid statistical inference procedures. Over the last century, various techniques have been developed in…
We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm…
A variety of large-scale machine learning problems can be cast as instances of constrained submodular maximization. Existing approaches for distributed submodular maximization have a critical drawback: The capacity - number of instances…
We introduce a linear programming framework for obtaining upper bounds for the potential energy of spherical codes of fixed cardinality and minimum distance. Using Hermite interpolation we construct polynomials to derive corresponding…
New lower and upper bounds on the reliability function of typewriter channels are given. Our lower bounds improve upon the (multiletter) expurgated bound of Gallager, furnishing a new and simple counterexample to a conjecture made in 1967…
A Central Limit Theorem for linear combinations of iterates of an inner function is proved. The main technical tool is Aleksandrov Desintegration Theorem for Aleksandrov-Clark measures.
The Shannon capacity of a graph is an important graph invariant in information theory that is extremely difficult to compute. The Lovasz number, which is based on semidefinite programming relaxation, is a well-known upper bound for the…