相关论文: Counting graded lattices of rank three that have f…
This paper deals with distinct computational methods to enumerate the set $\mathrm{PLR}(r,s,n;m)$ of $r \times s$ partial Latin rectangles on $n$ symbols with $m$ non-empty cells. For fixed $r$, $s$, and $n$, we prove that the size of this…
We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most…
If Gamma is a nonuniform, irreducible lattice in a semisimple Lie group whose real rank is greater than 1, we show Gamma contains a subgroup that is isomorphic to a nonuniform, irreducible lattice in either SL(3,R), SL(3,C), or a direct…
As the main achievement of the paper, we construct a three-generated, 2-distributive, atomless lattice that is not finitely presented. Also, the paper contains the following three observations. First, every coatomless three-generated…
This paper provides an in-depth analysis of how computational algebraic geometry can be used to deal with the problem of counting and classifying $r\times s$ partial Latin rectangles based on $n$ symbols of a given size, shape, type or…
We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
In addition to the unique cover $M^+$ of the variety of modular lattices, we also deal with those twenty-three known covers of $M^+$ that can be extracted from the literature. For $M^+$ and for each of these twenty-three known varieties…
A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…
We prove an explicit asymptotic formula for the logarithm of the minimal ranks of $n$-universal lattices over the ring of integers of totally real number fields. We also show that, for any constant $C > 0$ and $n \geq 3$, there are only…
The nonnegative rank of a matrix A is the smallest integer r such that A can be written as the sum of r rank-one nonnegative matrices. The nonnegative rank has received a lot of attention recently due to its application in optimization,…
Given a finite set of vectors spanning a lattice and lying in a halfspace of a real vector space, to each vector $a$ in this vector space one can associate a polytope consisting of nonnegative linear combinations of the vectors in the set…
We present several methods of counting the orbifolds C^D/Gamma. A correspondence between counting orbifold actions on C^D, brane tilings, and toric diagrams in D-1 dimensions is drawn. Barycentric coordinates and scaling mechanisms are…
We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…
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 present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a…
The hyperbolic (and more generally, Lorentzian) Kac-Moody (KM) Lie algebras $\cA$ of rank $r+2 > 2$ are shown to have a rich structure of indefinite KM subalgebras which can be described by specifying a subset of positive real roots of…
In 2002 Thakare et al.\ counted non-isomorphic lattices on $n$ elements, having nullity up to two. In 2020 Bhavale and Waphare introduced the concept of RC-lattices as the class of all lattices in which all the reducible elements are…
We present an algorithm to enumerate isometry classes of integral quadratic lattices of a given rank and determinant, and analyze its running time by giving bounds on the number of genus symbols for a fixed rank and determinant. We build on…