相关论文: On Gale and braxial polytopes
A graph $G$ is called matching covered if all of its edges are contained in some perfect matching of $G$. Furthermore, a cycle $C \subseteq G$ is called conformal if $G - V(C)$ has a perfect matching and $G$ itself is called cycle-conformal…
The simplicial complexity is an invariant for finitely presentable groups that was recently introduced by Babenko, Balacheff and Bulteau to study systolic area. The simplicial complexity $\kappa(G)$ was proved to be a good approximation of…
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…
A cyclic base ordering of a connected graph $G$, is a cyclic ordering of $E(G)$ such that every cyclically consecutive $|V(G)|-1$ edges form a spanning tree. In this project, we study cyclic base ordering of various families of graphs,…
In 1995, Rips and Sela asked if torsionfree hyperbolic groups admit globally stable cylinders. We establish this property for all residually finite hyperbolic groups and curve graphs of finite-type surfaces. These cylinders are fine…
An abstract $n$-polytope $\mathcal{P}$ is a partially-ordered set which captures important properties of a geometric polytope, for any dimension $n$. For even $n \ge 2$, the incidences between elements in the middle two layers of the Hasse…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
The majority of graphs whose sandpile groups are known are either regular or simple. We give an explicit formula for a family of non-regular multi-graphs called thick cycles. A thick cycle graph is a cycle where multi-edges are permitted.…
We consider the diagonal limit of the conformal bootstrap in arbitrary dimensions and investigate the question if physical theories are given in terms of cyclic polytopes. Recently, it has been pointed out that in $d=1$, the geometric…
Unique features of particle orbits produce novel signatures of gravitational observable phenomena, and are quite useful in testing compact astrophysical objects in general relativity or modified theories of gravity. Here we observe a…
Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group…
If $p$ is prime, a compact Riemann surface $X$ of genus $g\geq 2$ is called cyclic $p$-gonal if it admits a cyclic group of automorphisms $C_{p}$ of order $p$ such that the quotient space $X/C_{p}$ has genus 0. If in addition $C_{p}$ is not…
It is well known that the vertices of any Euclidean simplicial regular polytope determine an optimal packing of equal spherical balls. We prove a stability version of optimal order of this result.
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In the present paper we highlight their connections to the Kuramoto synchronization model in physics -- where they are called adjacency…
Groups defined by presentations for which the components of the corresponding star graph are the incidence graphs of generalized polygons are of interest as they are small cancellation groups that - via results of Edjvet and Vdovina - are…
We borrow a classical construction from the study of rational billiards in dynamical systems known as the "unfolding construction" and show that it can be used to study the automorphism group of a Platonic surface. More precisely, the…
A hyperbolic polygon is defined to be cyclic, horocyclic, or equidistant if its vertices lie on a metric circle, horocycle, or a component of the equidistant locus to a hyperbolic geodesic, respectively. Convex such $n$-gons are…
A polytope is called {\em regular-faced} if every one of its facets is a regular polytope. The 4-dimensional regular-faced polytopes were determined by G. Blind and R. Blind \cite{BlBl2,roswitha,roswitha2}. The last class of such polytopes…
A graph with $v$ vertices is $(r)$-pancyclic if it contains precisely $r$ cycles of every length from 3 to $v$. A bipartite graph with even number of vertices $v$ is said to be $(r)$-bipancyclic if it contains precisely $r$ cycles of each…