相关论文: Quantizing Using Lattice Intersections

The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…

Ordinary Coincidence Site Lattices (CSLs) are defined as the intersection of a lattice $\Gamma$ with a rotated copy $R\Gamma$ of itself. They are useful for classifying grain boundaries and have been studied extensively since the mid…

We present an algorithm for the exact computer-aided construction of the Voronoi cells of lattices with known symmetry group. Our algorithm scales better than linearly with the total number of faces and is applicable to dimensions beyond…

Lattice sums of cuboidal lattices, which connect the face-centered with the mean-centered and the body-centered cubic lattices through parameter dependent lattice vectors, are evaluated by decomposing them into two separate lattice sums…

Voronoi and Delaunay (Delone) cells of the root and weight lattices of the Coxeter-Weyl groups W(an) and W(dn) are constructed. The face centered cubic (fcc) and body centered cubic (bcc)lattices are obtained in this context. Basic…

A lattice quantizer approximates an arbitrary real-valued source vector with a vector taken from a specific discrete lattice. The quantization error is the difference between the source vector and the lattice vector. In a classic 1996…

We classify all the lattices realized as the intersection form of a positive definite four manifold with boundary $S_n^3(K)$ for a knot $K$ in the three sphere and a positive integer $n$ greater than $4g_4(K)+3$. We then use this result to…

In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm…

Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes…

We characterized the combinatorial structure of the Voronoi cell of the $A_n$ lattice in arbitrary dimensions. Based on the well-known fact that the Voronoi cell is the disjoint union of $(n+1)!$ congruent simplices, we show that it is the…

Characterization of crystallographic lattices is an important tool in structure solution, crystallographic database searches and clustering of diffraction images in serial crystallography. Characterization of lattices by Niggli-reduced…

We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other.…

Natural and artificial honeycomb lattices are of great interest because the band structure of these lattices, if properly constructed, contains a Dirac point. Such lattices occur naturally in the form of graphene and carbon nanotubes. They…

A 3-dimensional quasiperiodic lattice, with overlapping unit cells and periodic in one direction, is constructed using grid and projection methods pioneered by de Bruijn. Each unit cell consists of 26 points, of which 22 are the vertices of…

In this paper, using compute-and-forward as an example, we provide an overview of constructions of lattices from codes that possess the right algebraic structures for harnessing interference. This includes Construction A, Construction D,…

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…

Intertwiners between \ade lattice models are presented and the general theory developed. The intertwiners are discussed at three levels: at the level of the adjacency matrices, at the level of the cell calculus intertwining the face…

We consider hyperplane arrangements generated by generic points and study their intersection lattices. These arrangements are known to be equivalent to discriminantal arrangements. We show a fundamental structure of the intersection…

We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…

In this paper we address the problem of finding well approximating lattices for a given finite set $A$ of points in ${\mathbb R}^n$. More precisely, we search for $\v{o},\v{d_1}, \dots,\v{d_n}\in \mathbb{R}^n$ such that $\v{a}-\v{o}$ is…