Related papers: Constructing Self-Dual Chiral Polytopes

Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical…

We introduce a notion of quadratic duality for chiral algebras. This can be viewed as a chiral version of the usual quadratic duality for quadratic associative algebras. We study the relationship between this duality notion and the…

There are two chiral Archimedean polyhedra, the snub cube and snub dodecahedron together with their duals the Catalan solids, pentagonal icositetrahedron and pentagonal hexacontahedron. In this paper we construct the chiral polyhedra and…

Self-polar polytopes are convex polytopes that are equal to an orthogonal transformation of their polar sets. These polytopes were first studied by Lov\'{a}sz as a means of establishing the chromatic number of distance graphs on spheres,…

Let $\mathcal{P}$ be a chiral polytope with type $\{k_1, k_2\}$ and $G=Aut(\mathcal{P})$. Suppose $|G|=2p^m$, where $k_1, k_2\geq 3$ and $p$ is an odd prime. Let $P$ be a Sylow $p$-subgroup of $G$. We prove that $G \cong P \rtimes…

We define biquandle structures on a given quandle, and show that any biquandle is given by some biquandle structure on its underlying quandle. By determining when two biquandle structures yield isomorphic biquandles, we obtain a…

We show that chiral symmetry can be broken spontaneously in one-component systems with isotropic interactions, i.e. many-particle systems having maximal a priori symmetry. This is achieved by designing isotropic potentials that lead to…

Given an abstract polytope $\cal P$, its flag graph is the edge-coloured graph whose vertices are the flags of $\cal P$ and the $i$-edges correspond to $i$-adjacent flags. Flag graphs of polytopes are maniplexes. On the other hand, given a…

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…

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…

Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They…

Given vertex valencies admissible for a self-dual polyhedral graph, we describe an algorithm to explicitly construct such a polyhedron. Inputting in the algorithm permutations of the degree sequence can give rise to non-isomorphic graphs.…

We classify the convex polytopes whose symmetry groups have two orbits on the flags. These exist only in two or three dimensions, and the only ones whose combinatorial automorphism group is also two-orbit are the cuboctahedron, the…

The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…

The mix of two maniplexes is the minimal maniplex that covers both. This construction has many important applications, such as finding the smallest regular cover of a maniplex. If one of the maniplexes is an abstract polytope, a natural…

We present a construction of chiral and regular polyhedra from subgroups of the general affine group AGL(1,q) for odd prime powers q. In particular, we show that the full group AGL(1,q) occurs as the automorphism group of a chiral…

A chiral polyhedron with Schl\"afli symbol $\{p, q\}$ is called tight if it has $2pq$ flags, which is the minimum possible. In this paper, we fully characterize the Schl\"afli symbols of tight chiral polyhedra. We also provide presentations…

For a particular toric variety, I explore to what extent the SYZ conjecture applied to the orbits of the torus action gives the mirror manifold, in the sense of Batyrev's mirror construction using reflexive polytopes.

The orbit graph of a k-orbit polytope is a graph on k nodes that shows how the flag orbits are related by flag adjacency. Using orbit graphs, we classify k-orbit polytopes and determine when a k-orbit polytope is i-transitive. We then…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…