Related papers: Classification of Vertex-Transitive Zonotopes
We study a combinatorial object, which we call a GRRS (generalized reflection root system); the classical root systems and GRSs introduced by V. Serganova are examples of finite GRRSs. A GRRS is finite if it contains a finite number of…
We prove that each bounded polytope can be represented as a polynomial zonotope, which we refer to as the Z-representation of polytopes. Previous representations are the vertex representation (V-representation) and the halfspace…
We present a classification of transitive vertex algebroids on a smooth variety X carried out in the spirit of Bressler's classification of Courant algebroids. In particular, we compute the class of the stack of transitive vertex…
Let $\Gamma =(V,E)$ be a reflexive relation having a transitive group of automorphisms and let $v\in V.$ Let $F$ be a subset of $V$ with $F\cap \Gamma ^-(v)=\{v\}$. (i) If $F$ is finite, then $| \Gamma (F)\setminus F|\ge |\Gamma (v)|-1.$…
Let $p$ be a prime and let $L$ be either the intransitive permutation group $C_p\times C_p$ of degree $2p$ or the transitive permutation group $C_p \wr C_2$ of degree $2p$. Let $\Gamma$ be a connected $G$-vertex-transitive and…
Let $\Gamma$ be a graph and let $G$ be a group of automorphisms of $\Gamma$. The graph $\Gamma$ is called $G$-normal if $G$ is normal in the automorphism group of $\Gamma$. Let $T$ be a finite non-abelian simple group and let $G = T^l$ with…
We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function…
Recently the classification of all possible faithful transitive permutation representations of the group of symmetries of a regular toroidal map was accomplished. In this paper we complete this investigation on a surface of genus 1…
A finite tensor category is called pointed if all its simple objects are invertible. We find necessary and sufficient conditions for two pointed semisimple categories to be dual to each other with respect to a module category. Whenever the…
Given a transitive permutation group, a fundamental object for studying its higher transitivity properties is the permutation action of its isotropy subgroup. We reverse this relationship and introduce a universal construction of infinite…
An $H$-decomposition of a graph $\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies…
If Y is a diagram of spectra indexed by an arbitrary poset C together with a specified sub-poset D, we define the total cofibre \Gamma (Y) of Y as the strict cofibre of the map from hocolim_D (Y) to hocolim_C (Y). We construct a comparison…
A non-complete graph $\Gamma$ is said to be $(G,2)$-distance transitive if $G$ is a subgroup of the automorphism group of $\Gamma$ that is transitive on the vertex set of $\Gamma$, and for any vertex $u$ of $\Gamma$, the stabilizer $G_u$ is…
An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…
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…
We describe all closed permutation groups which act on the set of vectors of a countable vector space $V$ over a prime field of odd order and which contain all automorphisms of $V$. In particular, we prove that their number is finite. These…
We determine that $\gamma$-vectors of partitioned permutohedra, thereby generalizing a result of Foata and Sch\"utzenberger. Our result is closely related to a result of Athanasiadis on the representation of the symmetric group on the…
We study subsets in possibly degenerate symplectic vector spaces over finite fields, which are stable under a given Coxeter/Weyl reflection group. These symplectic root systems provide crucial combinatorical data to classify…
Given a connected graph G with p vertices and q edges, the G-graphicahedron is a vertex-transitive simple abstract polytope of rank q whose edge-graph is isomorphic to a Cayley graph of the symmetric group S_p associated with G. The paper…
A map $X$ on a surface is called vertex-transitive if the automorphism group of $X$ acts transitively on the set of vertices of $X$. If the face-cycles at all the vertices in a map are of same type then the map is called semi-equivelar. In…