Related papers: Kissing numbers and transference theorems from gen…
We show that the number of lattice points lying in a thin annulus has a Gaussian value distribution if the width of the annulus tends to zero sufficiently slowly as we increase the inner radius.
We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and conjecture its optimal form. The conjecture exhibits…
I present a recent piece of work on semileptonic $B \to \pi$ decays in which lattice results and kinematical and dispersive constraints are combined to obtain model-independent bounds on the relevant form factors and rates.
Random measures provide flexible parameters for Bayesian nonparametric models. Given two different priors for a random measure, we develop a natural framework to investigate the rate at which the corresponding posteriors merge, as the…
The kissing number $\tau(d)$ is the maximum number of pairwise non-overlapping unit spheres each touching a central unit sphere in the $d$-dimensional Euclidean space. In this note we report on how we discovered a new, previously unknown…
Two-body matrix elements of arbitrary local interactions are written as the sum of separable terms in a way that is well suited for the exchange and pairing channels present in mean-field calculations. The expansion relies on the…
In this study we revisit the telephone exchange problem. We discuss a generalization of the telephone exchange problem by discuss two generalizations of the Bessel polynomials. We study combinatorial properties of these polynomials, and…
Using terminologies of information geometry, we derive upper and lower bounds of the tail probability of the sample mean. Employing these bounds, we obtain upper and lower bounds of the minimum error probability of the 2nd kind of error…
We study the error of the number of unimodular lattice points that fall into a dilated and centred ellipse around $0$. We first show that the study of the error, when the error is normalized by $\sqrt{t}$ with $t$ the parameter of…
We study the generalisation properties of majority voting on finite ensembles of classifiers, proving margin-based generalisation bounds via the PAC-Bayes theory. These provide state-of-the-art guarantees on a number of classification…
We establish an error estimate for counting lattice points in Euclidean norm balls (associated to an arbitrary irreducible linear representation) for lattices in simple Lie groups of real rank at least two. Our approach utilizes refined…
In this paper, we consider a transmission problem in a bounded domain with a viscoelastic term and a delay term. Under appropriate hypothesis on the relaxation function and the relationship between the weight of the damping and the weight…
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…
We prove the first generalization bound for large-margin halfspaces that is asymptotically tight in the tradeoff between the margin, the fraction of training points with the given margin, the failure probability and the number of training…
Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…
Using projective limits as subsets of Cartesian products of homomorphisms from a lattice to the structure group, a consistent interaction measure and an infinite-dimensional calculus has been constructed for a theory of non-abelian…
A kissing sphere is a sphere that is tangent to a fixed reference ball. We develop in this paper a distance geometry for kissing spheres, which turns out to be a generalization of the classical Euclidean distance geometry.
Consider the stationary measure of open asymmetric simple exclusion process (ASEP) on the lattice $\{1,\dots,n\}$. Taking $n$ to infinity while fixing the jump rates, this measure converges to a measure on the semi-infinite lattice. In the…
We generalize the Griesmer bound in the case of systematic codes over a field of size q greater than the distance d of the code. We also generalize the Griesmer bound in the case of any systematic code of distance 2,3,4 and in the case of…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…