Related papers: On the error performance of the $A_n$ lattices
It is shown that the area of Voronoi cells for a generalized Archimedean spiral lattice converges under some scale normalization, if the angle parameter is badly approximable.
Several more and more efficient component--by--component (CBC) constructions for suitable rank-1 lattices were developed during the last decades. On the one hand, there exist constructions that are based on minimizing some error functional.…
Since their introduction, torsion theories have played a key role in the study of abelian and pointed categories. In representation theory, torsion theories and lattices of torsion classes of mod$ A$, for $A$ a finite-dimensional algebra,…
A natural way to describe the Penrose tiling employs the projection method on the basis of the root lattice A4 or its dual. Properties of these lattices are thus related to properties of the Penrose tiling. Moreover, the root lattice A4…
We present the complete 1-loop perturbative computation of the renormalization constants and mixing coefficients of the operators that measure the first moment of deep inelastic scattering structure functions, employing the nearest neighbor…
In this paper, we propose a probabilistic algorithm suitable for any linear code $C$ to determine whether a given vector $\mathbf{x}$ belongs to $ C$. The algorithm achieves $O(n\log n)$ time complexity, $ O(n^2)$ space complexity and with…
We study map lattices coupled by collision and show how perturbations of transfer operators associated with the spatially periodic approximation of the model can be used to extract information about collisions per lattice unit. More…
We consider hard-decision iterative decoders for product codes over the erasure channel, which employ repeated rounds of decoding rows and columns alternatingly. We derive the exact asymptotic probability of decoding failure as a function…
We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…
We establish formulae for the moments of the moments of the characteristic polynomials of random orthogonal and symplectic matrices in terms of certain lattice point count problems. This allows us to establish asymptotic formulae when the…
We give correct explicit formulas for the probabilities of rooted binary trees and cladograms under Ford's $\alpha$-model.
Results are presented for hadron spectroscopy with gauge groups SU(N) with N=3, 5, 7. Calculations use the quenched approximation. Lattice spacings are matched using the static potential. Meson spectra show independence on N and…
We introduce a general and accurate method for determining lattice phase shifts and mixing angles, which is applicable to arbitrary, non-cubic lattices. Our method combines angular momentum projection, spherical wall boundaries and an…
Lattice effective field theory applies the principles of effective field theory in a lattice framework where space and time are discretized. Nucleons are placed on the lattice sites, and the interactions are tuned to replicate the observed…
We use a simple fragmentation model to describe the statistical behavior of the Voronoi cell patterns generated by a set of points in 1D and in 2D. In particular, we are interested in the distribution of sizes of these Voronoi cells. Our…
A construction using the E8 lattice and Reed-Solomon codes for error-correction in flash memory is given. Since E8 lattice decoding errors are bursty, a Reed-Solomon code over GF($2^8$) is well suited. This is a type of coded modulation,…
We consider recent progress in algorithms for generating gauge field configurations that include the dynamical effects of light fermions. We survey what has been achieved in recent state-of-the-art computations, and examine the trade-offs…
Minkowski proved that any $n$-dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most $\sqrt{n}$; in fact, there are $2^{\Omega(n)}$ such lattice vectors. Lattices whose minimum distances come close to…
We discuss initial value problems for time evolution equations in one dimensional space which are expressed by the lattice operators and propose some new equations to which complexity of solutions is of polynomial class. Novel type of…
We present a new set of accurate formulae for the computation of random errors in the measurement of atomic and molecular indices. The new expressions are in excellent agreement with numerical simulations. We have found that, in some cases,…