Related papers: Mixing Chiral Polytopes
Consider a compact Lie group and a closed subgroup. Generalizing a result of Klyachko, we give a necessary and sufficient criterion for a coadjoint orbit of the subgroup to be contained in the projection of a given coadjoint orbit of the…
We classify here combinatorially rigid simple polytopes with three facets more than their dimension.
A polyhedron in Euclidean 3-space is called a regular polyhedron of index 2 if it is combinatorially regular and its geometric symmetry group has index 2 in its combinatorial automorphism group; thus its automorphism group is…
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…
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…
Maniplexes are coloured graphs that generalise maps on surfaces and abstract polytopes. Each maniplex uniquely defines a partially ordered set that encodes information about its structure. When this poset is an abstract polytope, we say…
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…
A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…
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 calculate chiral rings of the N=2 vertex algebras constructed from the combinatorial data of toric mirror symmetry and show that they coincide with the description of stringy cohomology conjectured previously in a joint work with A.…
A locally finite face-to-face tiling of euclidean d-space by convex polytopes is called combinatorially multihedral if its combinatorial automorphism group has only finitely many orbits on the tiles. The paper describes a local…
A regular polyhedron of type {p, q} has at least 2pq flags, and it is called tight if it has exactly 2pq flags. The values of p and q for which there exist tight orientably regular polyhedra were previously known. We determine for which…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It is then possible to define an induced chain map between the…
The chiral equivariant cohomology contains and generalizes the classical equivariant cohomology of a manifold M with an action of a compact Lie group G. For any simple G, there exist compact manifolds with the same classical equivariant…
A simple polytope $P$ is said to be \emph{B-rigid} if its combinatorial structure is characterized by its Tor-algebra, and is said to be \emph{C-rigid} if its combinatorial structure is characterized by the cohomology ring of a quasitoric…
We consider a set of cliques in any multipartite graph with two vertices in each part. Moreover, we construct a class of peculiar polytopes. Key words: multipartite graph, clique, polytope.
We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these…
This article mainly aims to give combinatorial characterizations and topological descriptions of quasitoric manifolds with string property. We provide a necessary and sufficient condition for a simple polytope in dimension 2 and 3 to be…
A maniplex of rank n s an n-valent properly edge-coloured graph that generalises, simultaneously, maps on surfaces and abstract polytopes. The problem of stability in maniplexes is a natural variant of the problem of stability in graphs. A…