相关论文: Improved Upper Bounds on the Hermite and KZ Consta…
In this work I apply a recently proposed improvement procedure, originally conceived to reduce finite lattice spacing effects in transfer matrices for dilute Fermi systems, to tuning operators for the calculation of observables. I…
A scenario is presented on how to shift the predicted cutoff in the cosmic ray spectrum at 10**20 eV, called the Greisen-Zatsepin-Kuzmin limit (GKZ), to larger energies without breaking the Lorentz invariance. The formulation is based on a…
We study different extended formulations for the set $X = \{x\in\mathbb{Z}^n \mid Ax = Ax^0\}$ in order to tackle the feasibility problem for the set $X_+=X \cap \mathbb{Z}^n_+$. Here the goal is not to find an improved polyhedral…
Consider the setting where a $\rho$-sparse Rademacher vector is planted in a random $d$-dimensional subspace of $R^n$. A classical question is how to recover this planted vector given a random basis in this subspace. A recent result by…
We analyze the asymptotic behavior of compute-and-forward relay networks in the regime of high signal-to-noise ratios. We consider a section of such a network consisting of K transmitters and K relays. The aim of the relays is to reliably…
Physical spin configurations corresponding to topological excitations, expected to be present in the XY limit of a quantum spin 1/2 Heisenberg anti-ferromagnet, are probed on a two dimensional square lattice . Quantum vortices…
We consider the standard site percolation model on the $d$-dimensional lattice. A direct consequence of the proof of the uniqueness of the infinite cluster of Aizenman, Kesten and Newman [Comm. Math. Phys. 111 (1987) 505-531] is that the…
Olkin [3] obtained a neat upper bound for the determinant of a correlation matrix. In this note, we present an extension and improvement of his result.
This paper makes two contributions towards determining some well-studied optimal constants in Fourier analysis \newa{of Boolean functions} and high-dimensional geometry. \begin{enumerate} \item It has been known since 1994 \cite{GL:94} that…
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
Lipschitz constants are connected to many properties of neural networks, such as robustness, fairness, and generalization. Existing methods for computing Lipschitz constants either produce relatively loose upper bounds or are limited to…
We present an update on Numerical Stochastic Perturbation Theory projects for Lattice QCD, which are by now run on apeNEXT. As a first issue, we discuss a strategy to tackle finite size effects which can be quite sizeable in the computation…
The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be…
Digital nets provide an efficient way to generate integration nodes of quasi-Monte Carlo (QMC) rules. For certain applications, as e.g. in Uncertainty Quantification, we are interested in obtaining a speed-up in computing products of a…
An Ornstein-Zernike approximation for the two-body correlation function embodying thermodynamic consistency is applied to a system of classical Heisenberg spins on a three-dimensional lattice. The consistency condition determined in a…
Since the control of the Lipschitz constant has a great impact on the training stability, generalization, and robustness of neural networks, the estimation of this value is nowadays a real scientific challenge. In this paper we introduce a…
We construct uniquely satisfiable $k$-CNF formulas that are hard for the algorithm PPSZ. Firstly, we construct graph-instances on which "weak PPSZ" has savings of at most $(2 + \epsilon) / k$; the saving of an algorithm on an input formula…
In the dilute limit, the properties of fermionic lattice models with short-range attractive interactions converge to those of a dilute Fermi gas in continuum space. We investigate this connection using mean-field and we show that the…
Lattice reduction is a popular preprocessing strategy in multiple-input multiple-output (MIMO) detection. In a quest for developing a low-complexity reduction algorithm for large-scale problems, this paper investigates a new framework…
This paper investigates low-dimensional quantizers from the perspective of complex lattices. We adopt Eisenstein integers and Gaussian integers to define checkerboard lattices $\mathcal{E}_{m}$ and $\mathcal{G}_{m}$. By explicitly linking…