Related papers: Classification of eight dimensional perfect forms
We consider close-packed dimers, or perfect matchings, on two-dimensional regular lattices. We review known results and derive new expressions for the free energy, entropy, and the molecular freedom of dimers for a number of lattices…
We present an algorithm for the exact computer-aided construction of the Voronoi cells of lattices with known symmetry group. Our algorithm scales better than linearly with the total number of faces and is applicable to dimensions beyond…
A celebrated theorem of Hopf, Bott, Milnor, and Kervaire states that every finite-dimensional real division algebra has dimension 1, 2, 4, or 8. While the real division algebras of dimension 1 or 2 and the real quadratic division algebras…
We find a one-parameter family of non-isomorphic nilpotent Lie algebras $\mathfrak{g}_a$, with $a \in [0,\infty)$, of real dimension eight with (strongly non-nilpotent) complex structures. By restricting $a$ to take rational values, we…
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…
In this paper we discuss the classification rank $3$ lattices preserved by finite orthogonal groups of isometries and derive from it the classification of regular polyhedra in the $3$-dimensional torus. This classification is highly related…
A lattice Delaunay polytope D is called perfect if it has the property that there is a unique circumscribing ellipsoid with interior free of lattice points, and with the surface containing only those lattice points that are the vertices of…
A positive-definite integral quadratic form is called regular if it represents every positive integer which is locally represented. In this article, we classify all regular diagonal quadratic forms of rank greater than 3.
We classify the nilpotent Lie algebras of real dimension eight and minimal center that admit a complex structure. Furthermore, for every such nilpotent Lie algebra $\mathfrak{g}$, we describe the space of complex structures on…
An empty simplex is a lattice simplex with only its vertices as lattice points. Their classification in dimension three was completed by White in 1964. In dimension four, the same task was started in 1988 by Mori, Morrison, and Morrison,…
In this paper we discuss near-perfect numbers of various forms. In particular, we study the existence of near-perfect numbers in the Fibonacci and Lucas sequences, near-perfect values taken by integer polynomials and repdigit near-perfect…
We study the class of finite lattices that are isomorphic to the congruence lattices of algebras from a given finitely generated congruence-distributive variety. If this class is as large as allowed by an obvious necessary condition, the…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
This paper contains a complete description of classes of the unitary equivalence of the admissible representations of infinite-dimensional classic matrix groups paper.
In this paper we prove an analogue of Mordell's inequality for lattices in finite-dimensional complex or quaternionic Hermitian space that are modules over a maximal order in an imaginary quadratic number field or a totally definite…
The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…
We give a comprehensive survey of the theory of finite dimensional Lie algebras over an algebraically closed field of characteristic p>0 and announce that for p>3 the classification of finite dimensional simple Lie algebras is complete. Any…
We introduce the multi-width of a lattice polytope and use this to classify and count all lattice tetrahedra with multi-width $(1,w_2,w_3)$. The approach used in this classification can be extended into a computer algorithm to classify…
We give the complete algebraic classification of all complex 4-dimensional nilpotent algebras. The final list has 234 (parametric families of) isomorphism classes of algebras, 66 of which are new in the literature.
We extend White's classification of empty tetrahedra to the complete classification of lattice $3$-polytopes with five lattice points, showing that, apart from infinitely many of width one, there are exactly nine equivalence classes of them…