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

Let $\gamma_n$ be the standard Gaussian measure on $\mathbb{R}^n$. We prove that for every symmetric convex sets $K,L$ in $\mathbb{R}^n$ and every $\lambda\in(0,1)$, $$\gamma_n(\lambda K+(1-\lambda)L)^{\frac{1}{n}} \geq \lambda…

The goal of this paper is to critically evaluate a heuristic algorithm for the Inverse Banzhaf Index problem by Laruelle and Widgr\'en. Few qualitative results are known about the approximation quality of the heuristics for this problem.…

In this paper, we study the Learning With Errors problem and its binary variant, where secrets and errors are binary or taken in a small interval. We introduce a new variant of the Blum, Kalai and Wasserman algorithm, relying on a…

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

This article extends the framework of Bayesian inverse problems in infinite-dimensional parameter spaces, as advocated by Stuart (Acta Numer. 19:451--559, 2010) and others, to the case of a heavy-tailed prior measure in the family of stable…

Ratio statistics--such as relative risk and odds ratios--play a central role in hypothesis testing, model evaluation, and decision-making across many areas of machine learning, including causal inference and fairness analysis. However,…

This paper considers estimation and inference about tail features when the observations beyond some threshold are censored. We first show that ignoring such tail censoring could lead to substantial bias and size distortion, even if the…

In this paper a result of Latala about the tail behavior of Gaussian polynomials will be discussed. Latala proved an interesting result about this problem in paper [2]. But his proof applied an incorrect statement at a crucial point. Hence…

Lattice reduction is a NP-hard problem well known in computer science and cryptography. The Lenstra-Lenstra-Lovasz (LLL) algorithm based on the calculation of orthogonal Gram-Schmidt (GS) bases is efficient and gives a good solution in…

The Learning with Errors (LWE) problem is a hard math problem in lattice-based cryptography. In the simplest case of binary secrets, it is the subset sum problem, with error. Effective ML attacks on LWE were demonstrated in the case of…

Hayashi's Pinching Inequality, which establishes a matrix inequality between a semidefinite matrix and a multiple of its "pinched" version via a projective measurement, has found many applications in quantum information theory and beyond.…

The purpose of this note is to recall one remarkable theorem of Khinchin about the special role of the Gaussian distribution. This theorem allows us to give a new interpretation of the Lindeberg condition: it guarantees the uniform…

This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…

Lattice gauge theory's discretization of spacetime suffers from a drawback in that Lorentz covariance is lost because the axes of the lattice create preferred directions in spacetime. Smaller and smaller lattice spacings decrease the effect…

The well-known "Janson's inequality" gives Poisson-like upper bounds for the lower tail probability \Pr(X \le (1-\eps)\E X) when X is the sum of dependent indicator random variables of a special form. We show that, for large deviations,…

We prove an inequality that generalizes the Fan-Taussky-Todd discrete analog of the Wirtinger inequality. It is equivalent to an estimate on the spectral gap of a weighted discrete Laplacian on the circle. The proof uses a geometric…

Recently, Liu et al. [Opt. Commun. 284, 3160, 2011] proposed a protocol for quantum private comparison of equality (QPCE) based on sym- metric W state. However, Li et al. [Eur. Phys. J. D. 66, 110, 2012] pointed out that there is a flaw of…

Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been…

We give an alternative proof for discrete Brunn-Minkowski type inequalities, recently obtained by Halikias, Klartag and the author. This proof also implies somewhat stronger weighted versions of these inequalities. Our approach generalizes…

One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…