English
Related papers

Related papers: The complete classification of empty lattice $4$-s…

200 papers

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…

Combinatorics · Mathematics 2025-09-26 Ashok Nivrutti Bhavale

A lattice Delaunay polytope is known as perfect if the only ellipsoid, that can be circumscribed about it, is its Delaunay sphere. Perfect Delaunay polytopes are in one-to-one correspondence with arithmetic equivalence classes of positive…

Metric Geometry · Mathematics 2007-05-23 Mathieu Dutour , Robert Erdahl , Konstantin Rybnikov

Multilattices are generalisations of lattices introduced by Mihail Benado. He replaced the existence of unique lower (resp. upper) bound by the existence of maximal lower (resp. minimal upper) bound(s). A multilattice will be called pure if…

Logic · Mathematics 2026-04-08 Blaise B. Koguep Njionou , Leonard Kwuida , Celestin Lele

We prove that of all two-dimensional lattices of covolume 1 the hexagonal lattice has asymptotically the fewest distances. An analogous result for dimensions 3 to 8 was proved in 1991 by Conway and Sloane. Moreover, we give a survey of some…

Number Theory · Mathematics 2008-02-01 Pieter Moree , Robert Osburn

Let $\omega=(-1+\sqrt{-3})/2$. For any lattice $P\subseteq \mathbb{Z}^n$, $\mathcal{P}=P+\omega P$ is a subgroup of $\mathcal{O}_K^n$, where $\mathcal{O}_K=\mathbb{Z}[\omega]\subseteq \mathbb{C}$. As $\mathbb{C}$ is naturally isomorphic to…

Number Theory · Mathematics 2015-08-13 Shantian Cheng

This is an unpublished manuscript written in 1983-4. It contains several results about lattices (=integral quadratic forms) including the classification of the unimodular lattices in dimensions up to 25 and the construction of unimodular…

Number Theory · Mathematics 2007-05-23 R. E. Borcherds

Finite dimensional modular Lie superalgebras over algebraically closed fields with indecomposable Cartan matrices are classified under some technical, most probably inessential, hypotheses. If the Cartan matrix is invertible, the…

Representation Theory · Mathematics 2009-06-11 Sofiane Bouarroudj , Pavel Grozman , Dimitry Leites

In this short note we give a construction of an infinite series of Delone simplices whose relative volume grows super-exponentially with their dimension. This dramatically improves the previous best lower bound, which was linear.

Combinatorics · Mathematics 2007-05-23 F. Santos , A. Schuermann , F. Vallentin

We show that, in dimension at least $4$, the set of locally finite simplicial volumes of oriented connected open manifolds is $[0, \infty]$. Moreover, we consider the case of tame open manifolds and some low-dimensional examples.

Geometric Topology · Mathematics 2020-10-27 Nicolaus Heuer , Clara Loeh

The ellipsoid embedding function of a symplectic manifold gives the smallest amount by which the symplectic form must be scaled in order for a standard ellipsoid of the given eccentricity to embed symplectically into the manifold. It was…

Symplectic Geometry · Mathematics 2025-02-06 Nicki Magill , Ana Rita Pires , Morgan Weiler

A $d$-dimensional simplex in Euclidean space is called orthocentric if all of its altitudes intersect at a single point, referred to as the orthocenter. We explicitly compute the internal and external angles at all faces of an orthocentric…

Metric Geometry · Mathematics 2025-05-09 Zakhar Kabluchko , Philipp Schange

A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…

Rings and Algebras · Mathematics 2012-08-31 Gábor Czédli , Tamás Dékány , László Ozsvárt , Nóra Szakács , Balázs Udvari

Let $\delta(\Pc) = (\delta_0, \delta_1,..., \delta_d)$ be the $\delta$-vector of an integral polytope $\Pc \subset \RR^N$ of dimension $d$. Following the previous work of characterizing the $\delta$-vectors with $\sum_{i=0}^d \delta_i \leq…

Combinatorics · Mathematics 2011-07-20 Takayuki Hibi , Akihiro Higashitani , Nan Li

Motivated by an error-correcting generalization of Bachet's weights problem, we define and classify relaxed complete partitions. We show that these partitions enjoy a succinct description in terms of lattice points in polyhedra, with…

Combinatorics · Mathematics 2014-01-09 Jorge Bruno , Edwin O'Shea

We express the number of lattice points inside certain simplices via Dedekind-Rademacher sums. As an application, we prove a conjecture of Kronheimer and Mrowka in the special case of Brieskorn spheres (with at most 4 singular fibers). This…

Differential Geometry · Mathematics 2007-05-23 Liviu I. Nicolaescu

In this article we explore a symplectic packing problem where the targets and domains are $2n$-dimensional symplectic manifolds. We work in the context where the manifolds have first homology group equal to $\mathbb{Z}^n$, and we require…

Symplectic Geometry · Mathematics 2021-12-24 Greta Fischer , Jean Gutt , Michael Jünger

While dealing with the nontrivial task of classifying Mueller matrices, of special interest is the study of the degenerate Mueller matrices (matrices with vanishing determinant, for which the law of multiplication holds, but there exists no…

General Mathematics · Mathematics 2014-11-12 O. Veko , E. Ovsiyuk , A. Oana , M. Neagu , V. Balan , V. Red'kov

We say a lattice tetrahedron whose centroid is its only non-vertex lattice point is lattice barycentric. The notation T(a,b,c) describes the lattice tetrahedron with vertices {0, e_1, e_2, a e_1 + b e_2 + c e_3}. Our result is that all such…

Combinatorics · Mathematics 2007-05-23 Brian Mazur

Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…

Logic · Mathematics 2021-11-30 Liling Ko

Patch lattices, introduced by G. Cz\'edli and E.T. Schmidt in 2013, are the building stones for slim (and so necessarily finite and planar) semimodular lattices with respect to gluing. Slim semimodular lattices were introduced by G.…

Rings and Algebras · Mathematics 2021-05-28 Gábor Czédli