Related papers: On lattice extensions

In a way similar to the continuous case formally, we define in different but equivalent manners the difference discrete connection and curvature on discrete vector bundle over the regular lattice as base space. We deal with the difference…

A coincidence site lattice is a sublattice formed by the intersection of a lattice $\Gamma$ in $\mathbb{R}^d$ with the image of $\Gamma$ under a linear isometry. Such a linear isometry is referred to as a linear coincidence isometry of…

In 2009, G. Gr\"atzer and E. Knapp proved that every planar semimodular lattice has a rectangular extension. We prove that, under reasonable additional conditions, this extension is unique. This theorem naturally leads to a hierarchy of…

In this paper, we propose a method of extending quasi-overlap and grouping functions defined on a sublattice $ M $ of a bounded lattice $ L $ to this lattice considering a more general version of sublattice definition, introduced by…

We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…

For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…

Let $\Lambda$ be a finite-dimensional associative algebra. The torsion classes of $mod\, \Lambda$ form a lattice under containment, denoted by $tors\, \Lambda$. In this paper, we characterize the cover relations in $tors\, \Lambda$ by…

We consider a graph called a lattice diagram, which is a graph in the $xy$-plane such that each edge is parallel to the $x$-axis or the $y$-axis. In [4], we investigated transformations of certain lattice diagrams, and we considered the…

We first define the concept of Lie algebroid in the convenient setting. In reference to the finite dimensional context, we adapt the notion of prolongation of a Lie algebroid over a fibred manifold to a convenient Lie algebroid over a…

This paper extends the recently obtained complete and continuous map of the Lattice Isometry Space (LISP) to the practical case of dimension 3. A periodic 3-dimensional lattice is an infinite set of all integer linear combinations of basis…

Dendrites with developed sidebranches are numerically studied with a coupled map lattice model. The competitive dynamics among sidebranches determines the shape of the envelope. The envelope has a parabolic shape near the tip of the…

Suppose $\Omega\subseteq\RR^d$ is a bounded and measurable set and $\Lambda \subseteq \RR^d$ is a lattice. Suppose also that $\Omega$ tiles multiply, at level $k$, when translated at the locations $\Lambda$. This means that the…

Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…

This is a survey article on the theory of lattice points in large planar domains and bodies of dimensions 3 and higher, with an emphasis on recent developments and new methods, including a lot of results established only during the last few…

The main goal of this paper is to find the discrete analogue of the Bianchi system in spaces of arbitrary dimesion together with its geometric interpretation. We show that the proper geometric framework of such generalization is the…

We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…

The projective space $\mathbb{P}_q(n)$, i.e. the set of all subspaces of the vector space $\mathbb{F}_q^n$, is a metric space endowed with the subspace distance metric. Braun, Etzion and Vardy argued that codes in a projective space are…

Algebraic lattices are those obtained from modules in the ring of integers of algebraic number fields through the canonical or twisted embeddings. In turn, well-rounded lattices are those with maximal cardinality of linearly independent…

We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…

We show a new framework for constructing good distance lattices from high dimensional expanders. For error-correcting codes, which have a similar flavor as lattices, there is a known framework that yields good codes from expanders. However,…