English
Related papers

Related papers: Mixing Chiral Polytopes

200 papers

A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…

Combinatorics · Mathematics 2025-06-16 Rupert H. Levene , Polona Oblak , Helena Šmigoc

Regular polygonal complexes in euclidean 3-space are discrete polyhedra-like structures with finite or infinite polygons as faces and with finite graphs as vertex-figures, such that their symmetry groups are transitive on the flags. The…

Combinatorics · Mathematics 2012-10-09 Daniel Pellicer , Egon Schulte

We call a closed, connected, orientable manifold in one of the categories TOP, PL or DIFF chiral if it does not admit an orientation-reversing automorphism and amphicheiral otherwise. Moreover, we call a manifold strongly chiral if it does…

Geometric Topology · Mathematics 2010-12-20 Daniel Müllner

In this paper, we study flag structures of matroid base polytopes. We describe faces of matroid base polytopes in terms of matroid data, and give conditions for hyperplane splits of matroid base polytopes. Also, we show how the cd-index of…

Combinatorics · Mathematics 2009-01-30 Sangwook Kim

It is known that the suspension of a simplicial complex can be realized with only one additional point. Suitable iterations of this construction generate highly symmetric simplicial complexes with various interesting combinatorial and…

Combinatorics · Mathematics 2007-05-23 Michael Joswig , Frank H. Lutz

We propose a new contact relation between polytopes. Intuitively, we say that two polytopes are in strong contact if a small enough object can pass from one of them to the other while remaining in their union. In the first half of the paper…

Logic · Mathematics 2018-02-23 Tsvetlin Marinov , Tinko Tinchev

Geometric morphisms between realizability toposes are studied in terms of morphisms between partial combinatory algebras (pcas). The morphisms inducing geometric morphisms (the {\em computationally dense\/} ones) are seen to be the ones…

Logic · Mathematics 2014-08-19 Eric Faber , Jaap van Oosten

Chirality is a fundamental concept in physics that underpins various phenomena in nonlinear optics, quantum physics, and topological photonics. Although the spin of a photon naturally brings chirality, orbital angular momentum can also…

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

Combinatorics · Mathematics 2026-05-15 Sally Cockburn , Ryhory Hatavets , Will Swartz

A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in sparse linear systems, database management, computer vision,…

Data Structures and Algorithms · Computer Science 2016-12-07 David Bergman , Carlos H. Cardonha , Andre A. Cire , Arvind U. Raghunathan

Comprehensive - that is, gauge and family - unification using spinors has many attractive features, but it has been challenged to explain chirality. Here, by combining an orbifold construction with more traditional ideas, we address that…

High Energy Physics - Phenomenology · Physics 2017-10-31 Mario Reig , José W. F. Valle , C. A. Vaquera-Araujo , Frank Wilczek

A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…

Algebraic Topology · Mathematics 2015-08-14 B. Kazarnovskii

Points of an orbit of a finite Coxeter group G, generated by n reflections starting from a single seed point, are considered as vertices of a polytope (G-polytope) centered at the origin of a real n-dimensional Euclidean space. A general…

Metric Geometry · Mathematics 2010-06-29 L. Hakova , M. Larouche , J. Patera

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

Combinatorics · Mathematics 2017-01-27 Joungmin Song

A simply connected topological space is called \emph{rationally elliptic} if the rank of its total homotopy group and its total (co)homology group are both finite. A well-known Hilali conjecture claims that for a rationally elliptic space…

Algebraic Topology · Mathematics 2025-05-08 Shoji Yokura

An object is chiral when its symmetry group contains no indirect isometry. It can be difficult to classify isometries as direct or indirect, except in the Euclidean case. We classify them with the help of outer semidirect products of…

Mathematical Physics · Physics 2022-03-09 Michel Petitjean

A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…

Combinatorics · Mathematics 2008-07-02 Sven Herrmann , Michael Joswig

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…

Combinatorics · Mathematics 2026-02-20 Torben Donzelmann , Thiago Holleben , Martina Juhnke

Coupling between light and material excitations underlies a wide range of optical phenomena. Polaritons are eigenstates of a coupled system with hybridized wave function. Owing to their hybrid composition, polaritons exhibit at the same…

Optics · Physics 2022-12-27 Denis G. Baranov , Christian Schäfer , Maxim V. Gorkunov

The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…

Combinatorics · Mathematics 2015-10-15 Francesco Grande , Juanjo Rué