相关论文: A Note on Banaszczyk's Inequality

A classical observation in analysis asserts that lacunary systems of dilated functions show many properties which are also typical for systems of independent random variables. For example, if $(n_k)_{k \ge 1}$ is a sequence of integers…

Recently, a design criterion depending on a lattice's volume and theta series, called the secrecy gain, was proposed to quantify the secrecy-goodness of the applied lattice code for the Gaussian wiretap channel. To address the secrecy gain…

Lattice coding for the Gaussian wiretap channel is considered, where the goal is to ensure reliable communication between two authorized parties while preventing an eavesdropper from learning the transmitted messages. Recently, a measure…

We introduce a lattice random walk discretisation scheme for stochastic differential equations (SDEs) that samples binary or ternary increments at each step, suppressing complex drift and diffusion computations to simple 1 or 2 bit random…

We develop an averaging approach to robust risk measurement under payoff uncertainty. Instead of taking a worst-case value over an uncertainty neighborhood, we weight nearby payoffs more heavily under a chosen metric and average the…

We propose the first Bayesian encoder for metric learning. Rather than relying on neural amortization as done in prior works, we learn a distribution over the network weights with the Laplace Approximation. We actualize this by first…

We investigate a simple model using the numerical simulation in the complex Langevin equation (CLE) and the analytical approximation with the Gaussian Ansatz. We find that the Gaussian Ansatz captures the essential and even quantitative…

We propose a regular way to construct lattice versions of $W$-algebras, both for quantum and classical cases. In the classical case we write the algebra explicitly and derive the lattice analogue of Boussinesq equation from the Hamiltonian…

We present an alternative, short proof of a recent discrete version of the Brunn-Minkowski inequality due to Lehec and the second named author. Our proof also yields the four functions theorem of Ahlswede and Daykin as well as some new…

In this paper we investigate iteration of maps on lattices and the corresponding polynomial-like iterative equation. Since a lattice need not have a metric space structure, neither the Schauder fixed point theorem nor the Banach fixed point…

We show that for real Banach spaces that are either separable or dual spaces, the Lipschitz numerical index coincides with the classical (linear) numerical index. This result provides partial evidence toward the question posed by Wang,…

We propose of an improved version of the ubiquitous symmetrization inequality making use of the Wasserstein distance between a measure and its reflection in order to quantify the symmetry of the given measure. An empirical bound on this…

In this paper we present new versions of the classical Brunn-Minkowski inequality for different classes of measures and sets. We show that the inequality \[ \mu(\lambda A + (1-\lambda)B)^{1/n} \geq \lambda \mu(A)^{1/n} +…

We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…

We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian distributions around lattice points. Our results include two…

We demonstrate that a direct approach to improving Hamiltonian lattice gauge theory is possible. Our approach is to correct errors in the Kogut-Susskind Hamiltonian by incorporating additional gauge invariant terms. The coefficients of…

Recently, Chernozhukov, Chetverikov, and Kato [Ann. Statist. 42 (2014) 1564--1597] developed a new Gaussian comparison inequality for approximating the suprema of empirical processes. This paper exploits this technique to devise sharp…

We use lattice topology as a laboratory to compare the Wilson action (WA) with the Symanzik-Weisz (SW) action constructed from a combination of (1x1) and (1x2) Wilson loops, and the estimate of the renormalization trajectory (RT) from a…

A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI statements and a…

A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI statements and a…