Related papers: On distances in lattices from algebraic number fie…
Measuring the distance between data points is fundamental to many statistical techniques, such as dimension reduction or clustering algorithms. However, improvements in data collection technologies has led to a growing versatility of…
Recently a systematic investigation of monoids of sequences of plus-minus weighted zero-sum sequences had been started, which is among others motivated by applications to monoids of norms of algebraic integers. In the current paper these…
Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…
Given a number field $L$, we define the degree of an algebraic number $v \in L$ with respect to a choice of a primitive element of $L$. We propose the question of computing the minimal degrees of algebraic numbers in $L$, and examine these…
We study four (families of) sets of algebraic integers of degree less than or equal to three. Apart from being simply defined, we show that they share two distinctive characteristics: almost uniformity and arithmetical independence. Here,…
These lectures about lattice field theory were written for, and given at, TASI 2019, ``The many dimensions of quantum field theory.'' The students at this TASI were mostly interested in formal things, and so these are slightly unusual…
The interleaving distance, although originally developed for persistent homology, has been generalized to measure the distance between functors modeled on many posets or even small categories. Existing theories require that such a poset…
The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…
Multilevel lattice codes, such as those associated to Constructions $C$, $\overline{D}$, D and D', have relevant applications in communications. In this paper, we investigate some properties of lattices obtained via Constructions D and D'…
We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and improved estimates on the smallest field sizes over which such…
The master-field approach to lattice QCD envisions performing calculations on a small number of large-volume gauge-field configurations. Substantial progress has been made recently in the generation of such fields, and this must be joined…
We prove that of all two-dimensional lattices of covolume 1 the hexagonal lattice has asymptotically the fewest distances. An analogous result for dimensions 3 to 8 was proved in 1991 by Conway and Sloane. Moreover, we give a survey of some…
Lattice sieving in two or more dimensions has proven to be an indispensable practical aid in integer factorization and discrete log computations involving the number field sieve. The main contribution of this article is to show that a…
By trapping cold polarizable atoms in periodic potentials created by crossed laser beams, it is now possible to experimentally create "clean" lattice systems. Experimentalists have successfully engineered local and nearest-neighbor…
We introduce the heat method for computing the shortest geodesic distance to a specified subset (e.g., point or curve) of a given domain. The heat method is robust, efficient, and simple to implement since it is based on solving a pair of…
Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…
The relationship between Salem numbers and short geodesics has been fruitful in quantitative studies of arithmetic hyperbolic orbifolds, particularly in dimensions 2 and 3. In this article, we push these connections even further. The…
We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…
We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost…
Emergence of fundamental forces from gauge symmetry is among our most profound insights about the physical universe. In nature, such symmetries remain hidden in the space of internal degrees of freedom of subatomic particles. Here we…