Related papers: Mixing Chiral Polytopes
We introduce the notion of bi-monoid in general monoidal category generalizing by this the notion of bialgebra. In the case of bimodules over a noncommutative algebra, we obtain a compatibility condition between ring and coring whenever…
Refining a basic result of Alexander, we show that two flag simplicial complexes are piecewise linearly homeomorphic if and only if they can be connected by a sequence of flag complexes, each obtained from the previous one by either an edge…
A neighborliness property of marginal polytopes of hierarchical models, depending on the cardinality of the smallest non-face of the underlying simplicial complex, is shown. The case of binary variables is studied explicitly, then the…
Chirality is of primary importance in many areas of chemistry and has been extensively investigated since its discovery. We introduce here the description of central chirality for tetrahedral molecules using a geometrical approach based on…
The fundamental issues of symmetry related to chirality are discussed and applied to simple situations relevant to liquid crystals. We show that any chiral measure of a geometric object is a pseudoscalar (invariant under proper rotations…
Light scattering from chiral plasmonic structures can create near fields with an asymmetry greater than the equivalent circularly polarised light, a property sometimes referred to as superchirality. These near fields with enhanced chiral…
In this note we give the definition of the "doubling operation" for simple polytopes, find the formula for the h-polynomial of new polytope.As an application of this operation we establish the relationship between moment-angle manifolds and…
Mirkovic and Vilonen discovered a canonical basis of algebraic cycles for the intersection homology of (the closures of the strata of) the loop Grassmannian. The moment map images of these varieties are a collection of polytopes, and they…
This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…
Inspired by recent developments in self-assembled chiral nanostructures, we have explored the possibility of using spherical particles packed in cylinders as building blocks for chiral photonic crystals. In particular, we focused on an…
The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of…
We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular…
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 paper studies modular reduction techniques for abstract regular and chiral polytopes, with two purposes in mind: first, to survey the literature about modular reduction in polytopes; and second, to apply modular reduction, with moduli…
Over the complex numbers, the complement of a collection of hyperplanes is a widely-studied object; the cohomology ring, in particular, is known to have a structure depending only on the combinatorial properties of the intersection of…
We give a necessary and sufficient condition for two circles, each with finitely many points added inside, to be betweenness isomorphic. We fully characterize the betweenness isomorphism classes in the family consisting of all circles with…
We describe an elementary convex geometric algorithm for realizing Schubert cycles in complete flag varieties by unions of faces of polytopes. For GL_n and Gelfand--Zetlin polytopes, combinatorics of this algorithm coincides with that of…
A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be…
In this paper, we explore a connection between binary hierarchical models, their marginal polytopes and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is…
The action of ring automorphisms of the polynomial ring in two variables over the real numbers on real plane curves is considered. The orbits containing degree-three polynomials are computed, with one representative per orbit being…