Related papers: A Note on Banaszczyk's Inequality
We derive an improved lattice Hamiltonian for pure gauge theory, coupling arbitrarily distant links in the kinetic term. The level of improvement achieved is examined in variational calculations of the SU(2) specific heat in 2+1 dimensions.
In this short note, we show that every convex, order bounded above functional on a Frechet lattice is automatically norm continuous. This improves a result in \cite{RS06} and applies to many deviation and variability measures. We also show…
The results of a series of theoretical studies are reported, examining the convergence rate for different approximate representations of $\alpha$-stable distributions. Although they play a key role in modelling random processes with jumps…
In this paper we investigate four concepts of exponential stability for difference equations in Banach spaces. Characterizations of these concepts are given. They can be considered as variants for the discrete-time case of the classical…
In a previous work [Scientific Reports 4, 6193(2014)] we proved the existence of scale symmetry in square and triangular (thus honeycomb) lattices by investigating the functiony=\arcsin(\sin(2\pinx)), where the parameter is either the…
The authors announce a general tail estimate, called a decoupling inequality, for a symmetrized sum of non-linear $k$-correlations of $n>k$ independent random variables.
In the context of statistical learning, the Information Bottleneck method seeks a right balance between accuracy and generalization capability through a suitable tradeoff between compression complexity, measured by minimum description…
Polar lattices, which are constructed from polar codes, are provably good for the additive white Gaussian noise (AWGN) channel. In this work, we propose a new polar lattice construction that achieves the secrecy capacity under the strong…
The Ring Learning-With-Errors (LWE) problem, whose security is based on hard ideal lattice problems, has proven to be a promising primitive with diverse applications in cryptography. There are however recent discoveries of faster algorithms…
We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…
We prove an exponential probability tail inequality for positive semidefinite quadratic forms in a subgaussian random vector. The bound is analogous to one that holds when the vector has independent Gaussian entries.
In the first part of the paper, we define an approximated Brunn-Minkowski inequality which generalizes the classical one for length spaces. Our new definition based only on distance properties allows us also to deal with discrete spaces.…
In Bayesian inference, making deductions about a parameter of interest requires one to sample from or compute an integral against a posterior distribution. A popular method to make these computations cheaper in high-dimensional settings is…
Geometric and functional Brunn-Minkowski type inequalities for the lattice point enumerator $\mathrm{G}_n(\cdot)$ are provided. In particular, we show that $$\mathrm{G}_n((1-\lambda)K + \lambda L + (-1,1)^n)^{1/n}\geq…
Lattice Boltzmann schemes rely on the enlargement of the size of the target problem in order to solve PDEs in a highly parallelizable and efficient kinetic-like fashion, split into a collision and a stream phase. This structure, despite the…
The Lanczos algorithm for matrix tridiagonalisation suffers from strong numerical instability in finite precision arithmetic when applied to evaluate matrix eigenvalues. The mechanism by which this instability arises is well documented in…
The approach used by Kalashnikov and Tsitsiashvili for constructing upper bounds for the tail distribution of a geometric sum with subexponential summands is reconsidered. By expressing the problem in a more probabilistic light, several…
We discuss two-sided bounds for moments and tails of quadratic forms in Gaussian random variables with values in Banach spaces. We state a natural conjecture and show that it holds up to additional logarithmic factors. Moreover in a certain…
In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a…
Employing the Orlicz functions we extend the Buzano's inequality which is a refinement of the Cauchy-Schwarz inequality. Also using the Orlicz functions we obtain several numerical radius inequalities for a bounded linear operator as well…