Related papers: Self-Polar Polytopes
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…
Polarization singularities of vectorial electromagnetic fields locate at the positions (such as points, lines, or surfaces) where properties of polarization ellipses are not defined. They are manifested as circular and linear polarization,…
A graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs. Polar graphs and…
These are lecture notes supporting a minicourse taught at the Summer School in Total Positivity and Quantum Field Theory at CMSA Harvard in June 2025. We give an introduction to positive geometries and their canonical forms. We present the…
In the present paper we study hyperbolic manifolds that are rational homology 3-spheres obtained by colouring of right--angled polytopes. We study the existence (or absence) of different kinds of symmetries of rational homology spheres that…
Metasurfaces are planar structures that can manipulate the amplitude, phase and polarization (APP) of light at subwavelength scale. Although various functionalities have been proposed based on metasurface, a most general optical control,…
This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…
We investigate a family of polytopes introduced by E.M.\ Feichtner, A.\ Postnikov and B.\ Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in…
A coordinate system is proposed for the purposes of analysis of far-field radiation from a localized source at the origin. The proposed coordinates exhibit no singularities over the far-field hemi-sphere, making them a good choice for…
The expansion of a polytope is an important parameter for the analysis of the random walks on its graph. A conjecture of Mihai and Vazirani states that all $0/1$-polytopes have expansion at least 1. We show that the generalization to…
Planar bipartite graphs can be represented as touching graphs of horizontal and vertical segments in $\mathbb{R}^2$. We study a generalization in space: touching graphs of axis-aligned rectangles in $\mathbb{R}^3$, and prove that planar…
Let $\mathcal P_{\Phi}$ be the root polytope of a finite irreducible crystallographic root system $\Phi$, i.e., the convex hull of all roots in $\Phi$. The polar of $\mathcal P_{\Phi}$, denoted $\mathcal P_{\Phi}^*$, coincides with the…
The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes are shown to be in bijection with regular triangulations of products of two simplices. Applications…
A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other…
Orthogonal polynomials on quadratic curves in the plane are studied. These include orthogonal polynomials on ellipses, parabolas, hyperbolas, and two lines. For an integral with respect to an appropriate weight function defined on any…
We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distance-regular graphs. Some of the obtained codes are optimal.…
A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of…
The purpose of this thesis is to study classical combinatorial objects, such as polytopes, polytopal complexes, and subspace arrangements, using tools that have been developed in combinatorial topology, especially those tools developed in…
Given a directed graph D = (N, A) and a sequence of positive integers 1 <= c_1 < c_2 < ... < c_m <= |N|, we consider those path and cycle polytopes that are defined as the convex hulls of simple paths and cycles of D of cardinality c_p for…
Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…