Related papers: Classification of positive definite lattices

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

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…

We show that there are uncountably many countable lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many…

We show that there are 105 isometric classes of fractal cubes of order 3 with 7 copies possessing one-point intersection property which are subdivided to 5 bi-Lipschitz classes of dendrites and 7 bi-Lipschitz classes of non-dendrites

It is well-known that a symmetric matrix with its entries $\pm1$ is not positive definite. But this is not ture for symmetric tensors (hyper-matrix). In this paper, we mainly dicuss the positive (semi-)definiteness criterion of a class of…

We classify all the symmetric integer bilinear forms of signature (2,1) whose isometry groups are generated up to finite index by reflections. There are 8595 of them up to scale, whose 374 distinct Weyl groups fall into 39 commensurability…

This article introduces the notion of good labellings for asymptotic lattices in order to study joint spectra of quantum integrable systems from the point of view of inverse spectral theory. As an application, we consider a new spectral…

In this note, we study linear determinantal representations of smooth plane cubics over finite fields. We give an explicit formula of linear determinantal representations corresponding to rational points. Using Schoof's formula, we count…

We provide a new class of Z_N x Z_M heterotic orbifolds on non-factorisable tori, whose boundary conditions are defined by Lie lattices. Generally, point groups of these orbifolds are generated by Weyl reflections and outer automorphisms of…

We prove tight probabilistic bounds for the shortest vectors in module lattices over number fields using the results of arXiv:2308.15275. Moreover, establishing asymptotic formulae for counts of fixed rank matrices with algebraic integer…

We obtain 866 isomorphism classes of five-dimensional nonsingular toric Fano varieties using a computer program and the database of four-dimensional reflexive polytopes. The algorithm is based on the existence of facets of Fano polytopes…

The study of positive-definite matrices has focused on Hermitian matrices, that is, square matrices with complex (or real) entries that are equal to their own conjugate transposes. In the classical setting, positive-definite matrices enjoy…

The current series of two papers focus on a 3-dimensional Lotka-Volterra competition model of differential equations with seasonal succession, which exhibits that populations experience an external periodically forced environment. We are…

We devise an algorithm which allows one to count the number of Killing vectors for a Lorentzian manifold of dimension 3. Our algorithm relies on the principal traces of powers of the Ricci tensor and branches intricately according to the…

A poset is called upper homogeneous, or "upho," if every principal order filter of the poset is isomorphic to the whole poset. We study (finite type $\mathbb{N}$-graded) upho lattices, with an eye towards their classification. Any upho…

Positive definite functions are fundamental to many areas of applied mathematics, probability theory, spatial statistics and machine learning, amogst others. Motivated by a problem coming from the maximum likelihood estimation under fixed…

We consider the automorphism groups of various Lorentzian lattices over the Eisenstein, Gaussian, and Hurwitz integers, and in some of them we find reflection groups of finite index. These provide new finite-covolume reflection groups…

We give a formula that expresses the Hilbert series of one-sided ladder determinantal rings, up to a trivial factor, in form of a determinant. This allows the convenient computation of these Hilbert series. The formula follows from a…

In this article, we completely determine the isomorphism classes of lattice vertex operator algebras and the vertex operator subalgebras fixed by a lift of the -1-isometry of the lattice. We also provide similar results for certain even…

In this letter, the 6-vertex model on dynamical random lattices is defined via a matrix model and rewritten (following I. Kostov) as a deformation of the O(2) model. In the large N planar limit, an exact solution is found at criticality.…