Related papers: Lattice Polytopes and Root Systems

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

Let G be the group of rational points of a semisimple algebraic group of rank 1 over a nonarchimedean local field. We improve upon Lubotzky's analysis of graphs of groups describing the action of lattices in G on its Bruhat-Tits tree…

For any marked poset we define a continuous family of polytopes, parametrized by a hypercube, generalizing the notions of marked order and marked chain polytopes. By providing transfer maps, we show that the vertices of the hypercube…

The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of…

The fractional perfect b-matching polytope of an undirected graph G is the polytope of all assignments of nonnegative real numbers to the edges of G such that the sum of the numbers over all edges incident to any vertex v is a prescribed…

A subset $S$ of vertices of a graph $G$ is called a perfectly matchable set of $G$ if the subgraph induced by $S$ contains a perfect matching. The perfectly matchable set polynomial of $G$, first made explicit by Ohsugi and Tsuchiya, is the…

Let G be a totally disconnected, locally compact group. A closed subgroup of G is locally normal if its normaliser is open in G. We begin an investigation of the structure of the family of closed locally normal subgroups of G. Modulo…

Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…

In [A. Stolz and A. Thom, On the lattice of normal subgroups in ultraproducts of compact simple groups, PLMS 108(1), 2014] it was stated that the lattice of normal subgroups of an ultraproduct of finite simple groups is always linearly…

Let $G$ be a real centre-free semisimple Lie group without compact factors. I prove that irreducible lattices in $G$ are rigid under two types of sublinear distortions. The first result is that the class of lattices in groups that do not…

A lattice Delaunay polytope D is called perfect if it has the property that there is a unique circumscribing ellipsoid with interior free of lattice points, and with the surface containing only those lattice points that are the vertices of…

This is an overview of results from our experiment of merging two seemingly unrelated disciplines - higher algebraic K-theory of rings and the theory of lattice polytopes. The usual K-theory is the ``theory of a unit simplex''. A conjecture…

We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…

In this work, we present a brief but insightful overview of the gauge theories, which are defined on $ n $-dimensional lattices by using finite gauge groups, in order to show how they can be interpreted as a Hamiltonian system with…

Suppose that a finite solvable group $G$ acts faithfully, irreducibly and quasi-primitively on a finite vector space $V$, and $G$ is not metacyclic. Then $G$ always has a regular orbit on $V$ except for a few "small" cases. We completely…

A Coxeter polytope is a convex polytope in a real projective space equipped with linear reflections in its facets, such that the orbits of the polytope under the action of the group generated by the linear reflections tessellate a convex…

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing…

In this paper, a question due to Heckenberger, Shareshian and Welker on racks in [7] is positively answered. A rack is a set together with a selfdistributive bijective binary operation. We show that the lattice of subracks of every finite…

Let $G$ be a finite permutation group acting on $\mathbb{R}^d$ by permuting coordinates. A core point (for $G$) is an integral vector $z\in \mathbb{Z}^d$ such that the convex hull of the orbit $Gz$ contains no other integral vectors but…