Related papers: Deciding whether a Lattice has an Orthonormal Basi…
We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link…
Let p be an odd prime. The lattice of all normal subgroups and the terms of the lower and upper central series are determined for all metabelian p-groups with generator rank d=2 having abelianization of type (p,p) and minimal defect of…
We obtain variants of the classical Minkowski Theorem on inhomogeneous approximation where we require moreover that the solutions $p, q$ be coprime integers. We link the subject with density exponents of lattice orbits in the real plane.
Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial…
It is old folklore that the violation of Leibniz rule on a lattice is an obstruction for constructing a lattice supersymmetric model. While it is still true for full supersymmetry, we show that a slightly modified form of the Leibniz rule,…
We classify the unimodular Euclidean integral lattices of rank 29 by developing an elementary, yet very efficient, inductive method. As an application, we determine the isometry classes of even lattices of rank at most 28 and prime…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
The problem of determining the existence of a spectral gap in a lattice quantum spin system was previously shown to be undecidable for one [J. Bausch et al., "Undecidability of the spectral gap in one dimension", Physical Review X 10…
Topological defects play a fundamental role in the investigation of symmetries in quantum field theories. For conformal field theories in two space-time dimensions, it is possible to construct these defects using lattice models allowing…
In this review, we count and classify certain sublattices of a given lattice, as motivated by crystallography. We use methods from algebra and algebraic number theory to find and enumerate the sublattices according to their index. In…
We compute the complexity of the billiard language of the regular Euclidean $N$-gons (and other families of rational lattice polygons), answering a question posed by Cassaigne-Hubert-Troubetzkoy. Our key technical result is a counting…
Stochastic parabolic integro-differential problem is considered in the whole space. By verifying H\"ormander condition, the existence and uniqueness is proved in Lp-spaces of functions whose regularity is defined by a scalable Levy measure.…
Links of singularity and generalized algebraic links are ways of constructing three-manifolds and smooth links inside them from potentially singular complex algebraic surfaces and complex curves inside them. We prove that knot lattice…
In this paper, we show that there is a frame of norm k in the odd Leech lattice for every k\ge 3.
We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e.,…
We present a new type of basis set which is local, compact, and orthogonal. The basis functions, called orthlets, are centered at the sites of a lattice and are specifically adapted to represent the system being studied. The adaptability…
As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such…
We extend the results of spin ladder models associated with the Lie algebras $su(2^n)$ to the case of the orthogonal and symplectic algebras $o(2^n),\ sp(2^n)$ where n is the number of legs for the system. Two classes of models are found…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…