相关论文: Quantizing Using Lattice Intersections
For a regular coupled cell network, synchrony subspaces are the polydiagonal subspaces that are invariant under the network adjacency matrix. The complete lattice of synchrony subspaces of an $n$-cell regular network can be seen as an…
New lattice quantizers with lower normalized second moments than previously reported are constructed in 13 and 14 dimensions and conjectured to be optimal. Our construction combines an initial numerical optimization with a subsequent…
The question of list decoding error-correcting codes over finite fields (under the Hamming metric) has been widely studied in recent years. Motivated by the similar discrete structure of linear codes and point lattices in R^N, and their…
The coincidence site lattices (CSLs) of prominent 4-dimensional lattices are considered. CSLs in 3 dimensions have been used for decades to describe grain boundaries in crystals. Quasicrystals suggest to also look at CSLs in dimensions…
Lattice decoders constructed with neural networks are presented. Firstly, we show how the fundamental parallelotope is used as a compact set for the approximation by a neural lattice decoder. Secondly, we introduce the notion of…
Cubical rectangles are being defined and explored here over the $n-$dimensional geometric cube $Q_n.$ They form a new class of geometric objects that includes all the edges and all the squares of the $n-$cube. We enumerate and characterize…
We characterize all possible relative positions between a hyperboloid of one sheet and a sphere through the roots of a characteristic polynomial associated to these quadrics. The classification is also suitable for a hyperboloid and a…
We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…
The entanglement of hard-core bosons in square and honeycomb lattices with nearest-neighbor interactions is estimated by means of quantum Monte Carlo simulations and spin-wave analysis. The particular U(1)-invariant form of the concurrence…
The recent proposal of Romero-Isart {\em et al.}~\cite{romero-isart_superconducting_2013} to utilize the vortex lattice phases of superconducting materials to prepare a lattice for ultra-cold atoms-based quantum emulators, raises the need…
The problem of designing a multiple description vector quantizer with lattice codebook Lambda is considered. A general solution is given to a labeling problem which plays a crucial role in the design of such quantizers. Numerical…
Unit cells are used to represent crystallographic lattices. Calculations measuring the differences between unit cells are used to provide metrics for measuring meaningful distances between three-dimensional crystallographic lattices. This…
A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
We consider the CSLs of 4-dimensional hypercubic lattices. In particular, we derive the coincidence index $\Sigma$ and calculate the number of different CSLs as well as the number of inequivalent CSLs for a given $\Sigma$. The hypercubic…
A classification algorithm, called the Linear Centralization Classifier (LCC), is introduced. The algorithm seeks to find a transformation that best maps instances from the feature space to a space where they concentrate towards the center…
In 2021, Hibi et. al. studied lattice points in $\mathbb{N}^2$ that appear as $(\depth R/I,\dim R/I)$ when $I$ is the edge ideal of a graph on $n$ vertices, and showed these points lie between two convex polytopes. When restricting to the…
Pure gauge lattice QCD at arbitrary D is considered. Exact integration over link variables in an arbitrary D-volume leads naturally to an appearance of a set of surfaces filling the volume and gives an exact expression for functional of…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…