Related papers: Derandomizing Chernoff Bound with Union Bound with…
Two types of errors can occur when discriminating pairs of quantum states. Asymmetric state discrimination involves minimizing the probability of one type of error, subject to a constraint on the other. We give explicit expressions bounding…
A refined expression for the Faddeev-Popov determinant is derived for gauge theories quantised around a reducible classical solution. We apply this result to Chern-Simons perturbation theory on compact spacetime 3-manifolds with…
We prove a Cherednik style $p$-adic uniformization theorem for Shimura varieties associated to certain groups of unitary similitudes of size two over totally real fields. Our basic tool is the alternative modular interpretation of the…
We study dynamical systems arising as time-dependent compositions of Pomeau-Manneville-type intermittent maps. We establish central limit theorems for appropriately scaled and centered Birkhoff-like partial sums, with estimates on the rate…
We destroy a finite tree of size $n$ by cutting its edges one after the other and in uniform random order. Informally, the associated cut-tree describes the genealogy of the connected components created by this destruction process. We…
We develop a class of exponential bounds for the probability that a martingale sequence crosses a time-dependent linear threshold. Our key insight is that it is both natural and fruitful to formulate exponential concentration inequalities…
In this paper we construct compact manifolds with fixed boundary geometry which admit Riemannian metrics of unit volume with arbitrarily large Steklov spectral gap. We also study the effect of localized conformal deformations that fix the…
We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational…
We improve the over-parametrization size over two beautiful results [Li and Liang' 2018] and [Du, Zhai, Poczos and Singh' 2019] in deep learning theory.
Comparisons of arithmetic and geometric monodromy groups coupled with the Chebotarev density theorem enable to obtain families of trinomials defined over finite fields of even characteristic with high differential uniformity when the base…
We prove the existence of an upper bound on the asymptotic dimension of tree amalgamations of locally finite quasi-transitive connected graphs. This generalises a result of Dranishnikov for free products with amalgamation and a result of…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
The connection of orthogonal polynomials on the unit circle (OPUC) to the defocusing Ablowitz-Ladik integrable system involves the definition of a Poisson structure on the space of Verblunsky coefficients. In this paper, we compute the…
Recent work of [Dasgupta-Kumar-Sarlos, STOC 2010] gave a sparse Johnson-Lindenstrauss transform and left as a main open question whether their construction could be efficiently derandomized. We answer their question affirmatively by giving…
We prove that if a rectangular matrix with uniformly small entries and approximately orthogonal rows is applied to the independent standardized random variables with uniformly bounded third moments, then the empirical CDF of the resulting…
The results in this paper add useful tools to the theory of sets of desirable gambles, a growing toolbox for reasoning with partial probability assessments. We investigate how to combine a number of marginal coherent sets of desirable…
In this paper is described the general aspect of a numerical method for piecewise determin-istic Markov processes with boundary. Under very natural hypotheses, a crucial result about uniqueness of solution of a generalized Kolmogorov…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
We consider the problem of finding the shortest possible period for an exactly periodic solution to some given autonomous ordinary differential equation. We show that, given a pair of Lyapunov-like observable functions defined over the…
We give a general recipe for derandomising PAC-Bayesian bounds using margins, with the critical ingredient being that our randomised predictions concentrate around some value. The tools we develop straightforwardly lead to margin bounds for…