English
Related papers

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

200 papers

Four-dimensional twisted group lattices are used as models for space-time structure. Compared to other attempts at space-time deformation, they have two main advantages: They have a physical interpretation and there is no difficulty in…

High Energy Physics - Theory · Physics 2009-10-28 O. Lechtenfeld , S. Samuel

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

Diversities are a generalization of metric spaces, where instead of the non-negative function being defined on pairs of points, it is defined on arbitrary finite sets of points. Diversities have a well-developed theory. This includes the…

Metric Geometry · Mathematics 2020-10-23 David Bryant , Raúl Felipe , Mauricio Toledo-Acosta , Paul Tupper

We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…

Functional Analysis · Mathematics 2021-02-05 Albrecht Boettcher , Lenny Fukshansky , Stephan Ramon Garcia , Hiren Maharaj , Deanna Needell

We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a…

Representation Theory · Mathematics 2019-02-15 Serge Bouc , Jacques Thévenaz

We formulate and give partial answers to several combinatorial problems on volumes of simplices determined by $n$ points in 3-space, and in general in $d$ dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by $n$…

Combinatorics · Mathematics 2013-12-17 Csaba D. Toth , Adrian Dumitrescu

We classify integral rootless lattices which are sums of pairs of $EE_8$-lattices (lattices isometric to $\sqrt 2$ times the $E_8$-lattice) and which define dihedral groups of orders less than or equal to 12. Most of these may be seen in…

Representation Theory · Mathematics 2008-06-18 Robert L. Griess , Ching Hung Lam

The bottom complex of a finite polyhedal pointed rational cone is the lattice polytopal complex of the compact faces of the convex hull of nonzero lattice points in the cone. The algebra, associated to the bottom complex of a cone, defines…

Commutative Algebra · Mathematics 2022-06-09 Joseph Gubeladze

Gravitational waves with a space-translation Killing field are considered. In this case, the 4-dimensional Einstein vacuum equations are equivalent to the 3-dimensional Einstein equations with certain matter sources. This interplay between…

General Relativity and Quantum Cosmology · Physics 2014-11-17 Abhay Ashtekar , Jiri Bicak , Bernd G. Schmidt

We consider the spectrum of the totally asymmetric simple exclusion process on a periodic lattice of $L$ sites. The first eigenstates have an eigenvalue with real part scaling as $L^{-3/2}$ for large $L$ with finite density of particles.…

Statistical Mechanics · Physics 2014-09-02 Sylvain Prolhac

A polytope $D$ whose vertices belong to a lattice of rank $d$ is Delaunay if there is a circumscribing $d$-dimensional ellipsoid, $E$, with interior free of lattice points so that the vertices of $D$ lie on $E$. If in addition, the…

Number Theory · Mathematics 2007-05-23 Robert Erdahl , Andrei Ordine , Konstantin Rybnikov

In this paper we give methods to classify the central singularities of Cayley-Hamilton smooth orders up to smooth equivalence in arbitrary central dimension. We prove that there is just one type in dimension 3 (the conifold singularity),…

Rings and Algebras · Mathematics 2009-09-29 Raf Bocklandt , Lieven Le Bruyn , Geert Van de Weyer

A set of vectors all of which have a constant (non-zero) norm value in an Euclidean lattice is called a shell of the lattice. Venkov classified strongly perfect lattices of minimum 3 (R\'{e}seaux et "designs" sph\'{e}rique, 2001), whose…

Combinatorics · Mathematics 2010-06-30 Junichi Shigezumi

We introduce the dimension monoid of a lattice L, denoted by Dim L. The monoid Dim L is commutative and conical, the latter meaning that the sum of any two nonzero elements is nonzero. Furthermore, Dim L is given along with the dimension…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

Let $K$ be a totally real number field of degree $n \geq 2$. The inverse different of $K$ gives rise to a lattice in $\mathbb{R}^n$. We prove that the space of Schwartz Fourier eigenfunctions on $\mathbb{R}^n$ which vanish on the…

Number Theory · Mathematics 2022-06-09 Danylo Radchenko , Martin Stoller

It is known that a lattice simplex of dimension $d$ corresponds a finite abelian subgroup of $(\mathbb{R}/\mathbb{Z})^{d+1}$. Conversely, given a finite abelian subgroup of $(\mathbb{R}/\mathbb{Z})^{d+1}$ such that the sum of all entries of…

Combinatorics · Mathematics 2020-09-08 Akiyoshi Tsuchiya

Let E be an integral lattice. We first discuss some general properties of an SDC lattice, i.e., a sum of two diagonal copies of E in E \bot E. In particular, we show that its group of isometries contains a wreath product. We then specialize…

Group Theory · Mathematics 2012-08-27 Robert L. Griess, , Ching Hung Lam

In $1941$ Dushnik and Miller introduced the concept of dimension of a poset. In $2020$ Bhavale and Waphare introduced the concept of an RC-lattice as a lattice in which all the reducible elements are lying on a chain. In this paper, we…

Combinatorics · Mathematics 2025-09-11 Ashok Nivrutti Bhavale

Convex sets arising in a variety of applications are well-defined for every relevant dimension. Examples include the simplex and the spectraplex that correspond to probability distributions and to quantum states; combinatorial polytopes and…

Optimization and Control · Mathematics 2025-10-24 Eitan Levin , Venkat Chandrasekaran

We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…

Combinatorics · Mathematics 2010-04-26 Jean Yves Semegni , Marcel Wild
‹ Prev 1 8 9 10 Next ›