Related papers: Mathematics of 2-dimensional lattices

Periodic lattices in hyperbolic space are characterized by symmetries beyond Euclidean crystallographic groups, offering a new platform for classical and quantum waves, demonstrating great potentials for a new class of topological…

In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

Three-dimensional lattices are fundamental to solid-state physics. The description of a lattice with an atomic basis constitutes the necessary information to predict solid phase properties and evolution. Here, we present a new algorithm for…

Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions of…

We consider divergent orbits of the group of diagonal matrices in the space of lattices in Euclidean space. We define two natural numerical invariants of such orbits: The discriminant - an integer - and the type - an integer vector. We then…

The main aim of the paper is to give a full classification (up to isometry) of all metric spaces X with the following two properties: X contains a compact set with non-empty interior; and for any three distinct points a, b and c of X there…

Lattices and Z-modules in Euclidean space possess an infinitude of subsets that are images of the original set under similarity transformation. We classify such self-similar images according to their indices for certain 4D examples that are…

Magnitude is a canonical invariant of finite metric spaces which has its origins in category theory; it is analogous to cardinality of finite sets. Here, by approximating certain compact subsets of Euclidean space with finite subsets, the…

We establish the most general form of the discrete elasticity of a 2D triangular lattice embedded in three dimensions, taking into account up to next-nearest neighbour interactions. Besides crystalline system, this is relevant to biological…

The Euclidean algorithm is the oldest algorithms known to mankind. Given two integral numbers $a_1$ and $a_2$, it computes the greatest common divisor (gcd) of $a_1$ and $a_2$ in a very elegant way. From a lattice perspective, it computes a…

In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…

Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…

While studying some properties of linear operators in a Euclidean Jordan algebra, Gowda, Sznajder and Tao have introduced generalized lattice operations based on the projection onto the cone of squares. In two recent papers of the authors…

We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…

We give an answer to the following question: for which metric in an abstract lattice the completion as a metric space coincides with the completion as a lattice. We obtain the answer for inductive limits of lattices which are complete in…

It is shown that the coincidence isometries of certain modules in Euclidean $n$-space can be decomposed into a product of at most $n$ coincidence reflections defined by their non-zero elements. This generalizes previous results obtained for…

Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive…

The phase diagram of binary mixtures of particles interacting via a pair potential of parallel dipoles is computed at zero temperature as a function of composition and the ratio of their magnetic susceptibilities. Using lattice sums, a rich…

We study the connection between the theory of spherical designs and the question of extrema of the height function of lattices. More precisely, we show that a full-rank n-dimensional Euclidean lattice, all layers of which hold a spherical…