Related papers: Classification of Vertex-Transitive Zonotopes
Given a permutation group acting on coordinates of $\mathbb{R}^n$, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called \emph{core points} and they play a…
We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
A linear group G on a finite vector space V, (that is, a subgroup of GL(V)) is called (1/2)-transitive if all the G-orbits on the set of nonzero vectors have the same size. We complete the classification of all the (1/2)-transitive linear…
Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…
Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…
A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…
We prove that, if $\Gamma$ is a finite connected $3$-valent vertex-transitive, or $4$-valent vertex- and edge-transitive graph, then either $\Gamma$ is part of a well-understood family of graphs, or every non-identity automorphism of…
A cellular string of a polytope is a sequence of faces stacked on top of each other in a given direction. The poset of cellular strings, ordered by refinement, is known to be homotopy equivalent to a sphere. The subposet of coherent…
A finite simple graph $\Gamma$ is called a Nest graph if it is regular of valency $6$ and admits an automorphism $\rho$ with two orbits of the same length such that at least one of the subgraphs induced by these orbits is a cycle. We say…
Given a finite vector space $V=\mathbb{F}_q^n$, the $q$-analogue of a graph, called a $q$-graph, is a pair $\Gamma=(\mathcal{V},\mathcal{E})$, where $\mathcal{V}$ is the set of $1$-dimensional subspaces of $V$ and $\mathcal{E}$ is a subset…
This is a chapter in an upcoming Tamari Festscrift. Permutahedra are a class of convex polytopes arising naturally from the study of finite reflection groups, while generalized associahedra are a class of polytopes indexed by finite…
We generalize the definition and properties of root systems to complex reflection groups - roots become rank one projective modules over the ring of integers of a number field k. In the irreducible case, we provide a classification of root…
Voronoi conjectured that any parallelotope is affinely equivalent to a Voronoi polytope. A parallelotope is defined by a set of $m$ facet vectors $p_i$ and defines a set of $m$ lattice vectors $t_i$, $1\le i\le m$. We show that Voronoi's…
Let $G$ be a finite group acting linearly on a vector space $V$. We consider the linear symmetry groups $\operatorname{GL}(Gv)$ of orbits $Gv\subseteq V$, where the \emph{linear symmetry group} $\operatorname{GL}(S)$ of a subset $S\subseteq…
This manuscript introduces a finite collection of generalized permutohedra associated to a simple graph. The first polytope of this collection is the graphical zonotope of the graph and the last is the graph-associahedron associated to it.…
The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…
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…
We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute…
When the standard representation of a crystallographic Coxeter group $\Gamma$ is reduced modulo an odd prime $p$, a finite representation in some orthogonal space over $\mathbb{Z}_p$ is obtained. If $\Gamma$ has a string diagram, the latter…