We consider certain E n -type root lattices embedded within the standard Lorentzian lattice Z n + 1 ( 3 ≤ n ≤ 8 ) and study their discrete geometry from the point of view of del Pezzo surface geometry. The lattice Z n + 1 decomposes as a disjoint union of affine hyperplanes which satisfy a certain periodicity. We introduce the notions of line vectors, rational conic vectors, and rational cubics vectors and their relations to E-polytopes. We also discuss the relation between these special vectors and the combinatorics of the Gosset polytopes of type ( n − 4 ) 21
AbstractThis paper discusses algorithms and software for the enumeration of all lattice points insid...
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In ...
We present several recent results on the structure of the lattice of combinatorial Rees–Sushkevich v...
We consider certain E -type root lattices embedded within the standard Lorentzian lattice ℤ (3 ≤ n ...
The aim of the paper is to make geometers and combinatorialists familiar with old and new connection...
In this article, we introduce special divisors (root, line, ruling, exceptional system and rational ...
This book lays out the theory of Mordell–Weil lattices, a very powerful and influential tool at the ...
The convex hull of the roots of a classical root lattice is called a root polytope. We determine exp...
We give a new definition of lattice-face polytopes by removing an unnecessary restriction i...
We exhibit a set of three related Gaussian Lorentzian lattices with ``Coxeter-like\u27\u27 root diag...
Inspired by ideas from algebraic geometry, Batyrev and the first named author have introduced the st...
Abstract. For A ∈ Zm×n we investigate the behaviour of the number of lattice points in PA(b) = {x ∈...
We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: G...
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In ...
AbstractThis paper discusses algorithms and software for the enumeration of all lattice points insid...
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In ...
We present several recent results on the structure of the lattice of combinatorial Rees–Sushkevich v...
We consider certain E -type root lattices embedded within the standard Lorentzian lattice ℤ (3 ≤ n ...
The aim of the paper is to make geometers and combinatorialists familiar with old and new connection...
In this article, we introduce special divisors (root, line, ruling, exceptional system and rational ...
This book lays out the theory of Mordell–Weil lattices, a very powerful and influential tool at the ...
The convex hull of the roots of a classical root lattice is called a root polytope. We determine exp...
We give a new definition of lattice-face polytopes by removing an unnecessary restriction i...
We exhibit a set of three related Gaussian Lorentzian lattices with ``Coxeter-like\u27\u27 root diag...
Inspired by ideas from algebraic geometry, Batyrev and the first named author have introduced the st...
Abstract. For A ∈ Zm×n we investigate the behaviour of the number of lattice points in PA(b) = {x ∈...
We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: G...
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In ...
AbstractThis paper discusses algorithms and software for the enumeration of all lattice points insid...
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In ...
We present several recent results on the structure of the lattice of combinatorial Rees–Sushkevich v...