English
Related papers

Related papers: Lattice Polytopes and Root Systems

200 papers

In this article we introduce a new family of lattice polytopes with rational linear precision. For this purpose, we define a new class of discrete statistical models that we call multinomial staged tree models. We prove that these models…

Combinatorics · Mathematics 2022-08-10 Isobel Davies , Eliana Duarte , Irem Portakal , Miruna-Stefana Sorea

In the Engel group with its Carnot group structure we study subsets of locally finite subRiemannian perimeter and possessing constant subRiemannian normal. We prove the rectifiability of such sets: more precisely we show that, in some…

Analysis of PDEs · Mathematics 2012-02-01 Costante Bellettini , Enrico Le Donne

The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…

Combinatorics · Mathematics 2008-09-29 Benjamin Nill

The theory of polyptych lattices is a framework to obtain a family of toric degenerations whose polytopes are related by piecewise-linear transformations. It can be regarded as a generalization of toric degenerations arising from cluster…

Algebraic Geometry · Mathematics 2026-03-24 Naoki Fujita , Akihiro Higashitani

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

Let P be a lattice polytope in R^n, and let P \cap Z^n = {v_1,...,v_N}. If the N + \binom N2 points 2v_1,...,2v_N; v_1+v_2,...v_{N-1}+v_N are distinct, we say that P is a "distinct pair-sum" or "dps" polytope. We show that, if P is a dsp…

Combinatorics · Mathematics 2007-05-23 M. D. Choi , T. Y. Lam , Bruce Reznick

A discrete subgroup $\Gamma$ of a locally compact group $H$ is called a uniform lattice if the quotient $H/\Gamma$ is compact. Such an $H$ is called an envelope of $\Gamma$. In this paper we study the problem of classifying envelopes of…

Group Theory · Mathematics 2014-04-22 Tullia Dymarz

Let $G$ be a noncompact real algebraic group and $\G<G$ a lattice. One purpose of this paper is to show that there is an smooth, volume preserving, mixing action of $G$ or $\G$ on a compact manifold which admits a smooth deformation. We…

Dynamical Systems · Mathematics 2007-05-23 David Fisher

Generalized alcoved polytopes are polytopes whose facet normals are roots in a given root system. We call a set of points in an alcoved polytope a generating set if there does not exist a strictly smaller alcoved polytope containing it. The…

Combinatorics · Mathematics 2016-08-22 Annette Werner , Josephine Yu

Let $\Gamma$ be an irreducible lattice in a product of n infinite irreducible complete Kac-Moody groups of simply laced type over finite fields. We show that if n is at least 3, then each Kac-Moody groups is in fact a simple algebraic group…

Group Theory · Mathematics 2013-07-11 Pierre-Emmanuel Caprace , Nicolas Monod

We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…

Combinatorics · Mathematics 2022-03-09 Dylan Heuer , Jessica Striker

A subgroup H of a reductive group G is horospherical if it contains a maximal unipotent subgroup. We describe the Grothendieck semigroup of invariant subspaces of regular functions on G/H as a semigroup of convex polytopes. From this we…

Algebraic Geometry · Mathematics 2010-07-27 Kiumars Kaveh , A. G. Khovanskii

Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…

General Mathematics · Mathematics 2020-03-23 Ya-Ping Lu , Shu-Fang Deng

In 3-dimensional Euclidean space there exist two exceptional polyhedra, the rhombic dodecahedron and the rhombic triacontahedron, the only known polytopes (besides polygons) that are edge-transitive without being vertex-transitive. We show…

Metric Geometry · Mathematics 2021-10-29 Frank Göring , Martin Winter

Since Gruenbaum and Shephard's investigation of self-intersection-free polyhedra with positive genus and vertex-transitive symmetry in 1984 the question of complete classification of such objects in Euclidean 3-space has been open. Due to a…

Metric Geometry · Mathematics 2015-02-27 Undine Leopold

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

Metric Geometry · Mathematics 2007-06-13 George M. Bergman

We prove that the lattice of normal subgroups of ultraproducts of compact simple non-abelian groups is distributive. In the case of ultraproducts of finite simple groups or compact connected simple Lie groups of bounded rank the set of…

Group Theory · Mathematics 2014-02-26 Abel Stolz , Andreas Thom

The paper contains a characterization of compact groups $G\subseteq\GL(V)$, where $V$ is a finite dimensional real vector space, which have the following property \SP{}: the family of convex hulls of $G$-orbits is a semigroup with respect…

Metric Geometry · Mathematics 2010-09-23 V. Gichev

We completely classify non-spanning $3$-polytopes, by which we mean lattice $3$-polytopes whose lattice points do not affinely span the lattice. We show that, except for six small polytopes (all having between five and eight lattice…

Combinatorics · Mathematics 2018-10-02 Mónica Blanco , Francisco Santos

We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…

Combinatorics · Mathematics 2024-10-23 Martin Bohnert , Justus Springer
‹ Prev 1 8 9 10 Next ›