English
Related papers

Related papers: The Geometry of $H_4$ Polytopes

200 papers

We use the results of AG/0406290 to discuss the counting formulas of network flow polytopes and magic squares, i.e. the formula for the corresponding Ehrhart polynomial in terms of residues. We also discuss a description of the big cells…

Combinatorics · Mathematics 2007-05-23 C. De Concini , C. Procesi

We give a classification of the matrices in the unitary group U(1,1;H),where H is the division ring of the real quaternions. To this end, we consider the complex representation phi(P) for P in U(1,1;H). Next, we compute the characteristic…

Differential Geometry · Mathematics 2021-08-30 Jaime L. O. Chamorro

The hexabasic book is the cone of the 1-dimensional skeleton of the union of two tetrahedra glued along a common face. The universal 3-dimensional polyhedron UP is the product of a segment and the hexabasic book. We show that any…

Geometric Topology · Mathematics 2014-10-01 Cherry Kearton , Vitaliy Kurlin

In this paper, we show how regular convex 4-polytopes - the analogues of the Platonic solids in four dimensions - can be constructed from three-dimensional considerations concerning the Platonic solids alone. Via the Cartan-Dieudonne…

Mathematical Physics · Physics 2014-02-19 Pierre-Philippe Dechant

We classify the three-dimensional lattice polytopes with two interior lattice points. Up to unimodular equivalence there are 22,673,449 such polytopes. This classification allows us to verify, for this case only, a conjectural upper bound…

Combinatorics · Mathematics 2016-12-30 Gabriele Balletti , Alexander M. Kasprzyk

We consider polyhedra and 4-polytopes in Minkowski spacetime - in particular, null polyhedra with zero volume, and 4-polytopes that have such polyhedra as their hyperfaces. We present the basic properties of several classes of null-faced…

Combinatorics · Mathematics 2013-01-09 Yasha Neiman

Given six points $A,B,C,D,E,F$ on a nonsingular conic in the complex projective plane, Pascal's theorem says that the three intersection points $AE \cap BF, BD \cap CE, AD \cap CF$ are collinear. The line containing them is called a pascal,…

Algebraic Geometry · Mathematics 2023-03-21 Jaydeep Chipalkatti

We explicitly describe a structure of a regular cell complex $K(L)$ on the moduli space $M(L)$ of a planar polygonal linkage $L$. The combinatorics is very much related (but not equal) to the combinatorics of the permutahedron. In…

Algebraic Topology · Mathematics 2017-04-11 Gaiane Panina

We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "splitting basis" for the homology of the partition lattice given in [Wa96],…

Combinatorics · Mathematics 2007-05-23 Anders Björner , Michelle L. Wachs

Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity along the three main column directions. We deduce the…

Combinatorics · Mathematics 2007-05-23 Dominique Gouyou-Beauchamps , Pierre Leroux

In two dimensional digital geometry, two lattice points are 4-connected (resp. 8-connected) if their Euclidean distance is at most one (resp. $\sqrt{2}$). A set $S \subset Z^2$ is 4-connected (resp. 8-connected) if for all pair of points…

Computational Geometry · Computer Science 2021-03-09 Crombez Loïc

We describe a construction for d-polytopes generalising the well known stacking operation. The construction is applied to produce 2-simplicial and 2-simple 4-polytopes with g_2=0 on any number of n >= 13 vertices. In particular, this…

Combinatorics · Mathematics 2007-05-23 Andreas Paffenholz , Axel Werner

We prove that each bounded polytope can be represented as a polynomial zonotope, which we refer to as the Z-representation of polytopes. Previous representations are the vertex representation (V-representation) and the halfspace…

Combinatorics · Mathematics 2019-10-17 Niklas Kochdumper , Matthias Althoff

The symmetric edge polytope ($\mathrm{SEP}$) of a finite simple graph $G$ is a centrally symmetric lattice polytope whose vertices are defined by the edges of the graph. Among the information encoded by these polytopes are the symmetries of…

Combinatorics · Mathematics 2025-09-09 Tito Augusto Cuchilla , Joseph Hound , Cole Plepel , Andrés R. Vindas-Meléndez , Louis Ye

In this paper, we analyze the possible homotopy types of the total space of a principal $SU(2)$-bundle over a $3$-connected $8$-dimensional Poincar\'{e} duality complex. Along the way, we also classify the $3$-connected $11$-dimensional…

Algebraic Topology · Mathematics 2024-05-22 Samik Basu , Aloke Kr. Ghosh , Subhankar Sau

We study the set of square-free parts of volume polynomials associated with four planar lattice polytopes. This is motivated by the problem of describing possible pairwise intersection numbers of four curves in $(\mathbb{C}^*)^2$ with…

Combinatorics · Mathematics 2026-02-19 Darren Gerrity , Ivan Soprunov

We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…

Combinatorics · Mathematics 2019-05-15 Akihiro Higashitani , Katharina Jochemko , Mateusz Michałek

We study the moduli space of four dimensional ordinary Lie algebras, and their versal deformations. Their classification is well known; our focus in this paper is on the deformations, which yield a picture of how the moduli space is…

Representation Theory · Mathematics 2007-05-23 Alice Fialowski , Michael Penkava

A central problem of geometry is the tiling of space with simple structures. The classical solutions, such as triangles, squares, and hexagons in the plane and cubes and other polyhedra in three-dimensional space are built with sharp…

Applied Physics · Physics 2025-04-09 Gábor Domokos , Alain Goriely , Ákos G. Horváth , Krisztina Regős

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,…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke
‹ Prev 1 4 5 6 7 8 10 Next ›