Related papers: On Gale and braxial polytopes
We study finite groups that occur as combinatorial automorphism groups or geometric symmetry groups of convex polytopes. When $\Gamma$ is a subgroup of the combinatorial automorphism group of a convex $d$-polytope, $d\geq 3$, then there…
In this paper, we prove that for any smooth hypersurface $Y$ of degree $d$ in $\mathbb{P}^{n+1}_k$, the cyclic $d$-fold cover $\widetilde{Y} \to \mathbb{P}^{n+1}_k$ branched along $Y$ completely characterizes $Y$ up to projective…
In this paper, we investigate some polynomial conditions that arise from Euclidean geometry. First we study polynomials related to quadrilaterals with supplementary angles, this includes convex cyclic quadrilaterals, as well as certain…
Formulas about the side lengths, diagonal lengths or radius of the circumcircle of a cyclic polygon in Euclidean geometry, hyperbolic geometry or spherical geometry can be unified.
We study incidence geometries that are thin and residually connected. These geometries generalise abstract polytopes. In this generalised setting, guided by the ideas from the polytopes theory, we introduce the concept of chirality, a…
For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…
The paper surveys highlights of the ongoing program to classify discrete polyhedral structures in Euclidean 3-space by distinguished transitivity properties of their symmetry groups, focussing in particular on various aspects of the…
We give a complete characterization of polynomials in two complex variables that are cyclic with respect to the coordinate shifts acting on Dirichlet-type spaces in the bidisk, which include the Hardy space and the Dirichlet space of the…
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…
The Ehrhart ring of the edge polytope $\mathcal{P}_G$ for a connected simple graph $G$ is known to coincide with the edge ring of the same graph if $G$ satisfies the odd cycle condition. This paper gives for a graph which does not satisfy…
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…
We present new accretion solutions of a polytropic perfect fluid onto an f(R)-gravity de Sitter-like black hole. We consider two f(R)-gravity models and obtain finite-period cyclic flows oscillating between the event and cosmological…
Gale transform is a simple but powerful tool in convex geometry. In particular, the use of Gale transform is the main argument in the classification of polytopes with few vertices. Many books and documents cover the definition of Gale…
Let P a polytope and let G(P) be the graph of P. Following Gil Kalai, we say that an acyclic orientation O of G(P) is good if, for every non-empty face F of P, the induced graph G(F) has exactly one sink. Gil Kalai gave a simple way to tell…
As the parameters of a piecewise-smooth system of ODEs are varied, a periodic orbit undergoes a bifurcation when it collides with a surface where the system is discontinuous. Under certain conditions this is a grazing-sliding bifurcation.…
This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…
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 \textit{$k$-linked} if,…
The set of triangulations of a cyclic polytope possesses two a priori different partial orders, known as the higher Stasheff-Tamari orders. The first of these orders was introduced by Kapranov and Voevodsky, while the second order was…
The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…
We build a new theory for analyzing the coefficients of any cyclotomic polynomial by considering it as a gcd of simpler polynomials. Using this theory, we generalize a result known as periodicity and provide two new families of flat…