Related papers: Classification of eight dimensional perfect forms
Here we explain geometrically why the ideal I = (L 3 1 ,. .. , L 3 8) $\subset$ C[x 0 ,. .. , x 6 ] has the WLP in degree 3 and why it fails to have it in degree 5.
In this paper, we count all non-isomorphic lattices on $n$ elements, containing four reducible elements and having nullity three. This work is in respect of Birkhoff's open problem (which is NP-complete) of counting all finite lattices on…
In this paper, we classify eight-dimensional non-solvable Lie algebras that support a symplectic structure. As well as a complete classification is given, up to symplectomorphism, of eight-dimensional symplectic non-solvable Lie algebras.
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
A generalization of the filled-in Julia set is presented using the multicomplex numbers and an algorithm is presented to visualize these sets in the tridimensional space. There are many ways to visualize these higher dimensional fractals…
After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth…
We classify all complex $7$- and $8$-dimensional dual mock-Lie algebras by algebraic and geometric way. Also we find all non-trivial complex $9$-dimensional dual mock-Lie algebras.
We present all real solvable algebraically rigid Lie algebras of dimension $n\leq 8$. The difference between the classification of complex and real rigid Lie algebras is analyzed.
We prove an explicit upper bound on the number of real quadratic fields that admit a universal quadratic form of a given rank, thus establishing a density zero statement. More generally, we obtain such a result for totally positive definite…
We give an enumeration of all positive definite primitive Z-lattices in dimension >= 3 whose genus consists of a single isometry class. This is achieved by using bounds obtained from the Smith-Minkowski-Siegel mass formula to…
We show that the degree of a graded lattice ideal of dimension 1 is the order of the torsion subgroup of the quotient group of the lattice. This gives an efficient method to compute the degree of this type of lattice ideals.
We describe odd-length-cube tilings of the n-dimensional q-ary torus what includes q-periodic integer lattice tilings of R^n. In the language of coding theory these tilings correspond to perfect codes with respect to the maximum metric. A…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…
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…
In this paper for any dimension n we give a complete list of lattice convex polytopes in R^n that are regular with respect to the group of affine transformations preserving the lattice.
Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…
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…
An integral lattice which is generated by some vectors of norm $q$ is called $q$-lattice. Classification of 3-lattices of dimension at most four is given by Mimura (On 3-lattice, 2006). As a expansion, we give a classification of 3-lattices…
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.