English
Related papers

Related papers: Constructions for 4-Polytopes and the Cone of Flag…

200 papers

Although the Unimodality Conjecture holds for some certain classes of cubical polytopes (e.g. cubes, capped cubical polytopes, neighborly cubical polytopes), it fails for cubical polytopes in general. A 12-dimensional cubical polytope with…

Combinatorics · Mathematics 2015-01-07 László Major , Szabolcs Tóth

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

Given a lattice $L$, a full dimensional polytope $P$ is called a {\em Delaunay polytope} if the set of its vertices is $S\cap L$ with $S$ being an {\em empty sphere} of the lattice. Extending our previous work \cite{DD-hyp} on the {\em…

Metric Geometry · Mathematics 2007-05-23 M. Dutour

We define flag structures on a real three manifold M as the choice of two complex lines on the complexified tangent space at each point of M. We suppose that the plane field defined by the complex lines is a contact plane and construct an…

Differential Geometry · Mathematics 2018-05-01 E Falbel , J Veloso

In this note we prove that the number of combinatorial types of $d$-polytopes with $d+1+\alpha$ vertices and $d+1+\beta$ facets is bounded by a constant independent of $d$.

Combinatorics · Mathematics 2015-03-16 Arnau Padrol

We classify all products of flag varieties with finitely many orbits under the diagonal action of the general linear group. We also classify the orbits in each case and construct explicit representatives. This generalizes the classical…

Algebraic Geometry · Mathematics 2016-09-07 Peter Magyar , Jerzy Weyman , Andrei Zelevinsky

This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…

Combinatorics · Mathematics 2024-11-22 Marie-Charlotte Brandenburg , Roland Púček

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

Combinatorics · Mathematics 2007-05-23 Jeff Erickson

Let $k$ be a positive integer and let $G$ be a graph with $n$ vertices. A connected $k$-subpartition of $G$ is a collection of $k$ pairwise disjoint sets (a.k.a. classes) of vertices in $G$ such that each set induces a connected subgraph.…

Combinatorics · Mathematics 2025-12-23 Phablo F. S. Moura , Hande Yaman , Roel Leus

Let $P\subset\R^d$ be a $d$-dimensional polytope. The {\em realization space} of~$P$ is the space of all polytopes $P'\subset\R^d$ that are combinatorially equivalent to~$P$, modulo affine transformations. We report on work by the first…

Metric Geometry · Mathematics 2016-09-06 Jürgen Richter-Gebert , Günter M. Ziegler

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…

Geometric Topology · Mathematics 2007-05-29 Jaejeong Lee

A flag variety is a smooth projective homogeneous variety. In this paper, we study Newton-Okounkov polytopes of the flag variety $Fl(\mathbb{C}^4)$ arising from its cluster structure. More precisely, we present defining inequalities of such…

Algebraic Geometry · Mathematics 2023-10-11 Yunhyung Cho , Naoki Fujita , Akihiro Higashitani , Eunjeong Lee

A well-known conjecture of McMullen, proved by Billera, Lee and Stanley, describes the face numbers of simple polytopes. The necessary and sufficient condition is that the toric g-vector of the polytope is an M-vector, that is, the vector…

Combinatorics · Mathematics 2014-12-19 Kalle Karu

A simplicial complex $\Delta$ is called flag if all minimal nonfaces of $\Delta$ have at most two elements. The following are proved: First, if $\Delta$ is a flag simplicial pseudomanifold of dimension $d-1$, then the graph of $\Delta$ (i)…

Combinatorics · Mathematics 2015-05-13 Christos A. Athanasiadis

We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…

Numerical Analysis · Mathematics 2021-07-07 Thomas Mejstrik , Vladimir Yu. Protasov

4-dimensional $F_{4} $ polytopes and their dual polytopes have been constructed as the orbits of the Coxeter-Weyl group $W(F_{4})$ where the group elements and the vertices of the polytopes are represented by quaternions. Branchings of an…

Mathematical Physics · Physics 2014-03-13 Mehmet Koca , Mudhahir Al-Ajmi , Nazife Koca

The aim of this paper is to classify all invariant generalized complex structure on a partial flag manifold $\mathbb{F}_\Theta$ with at most four isotropy summands. To classify them all we proved that an invariant generalized almost complex…

Differential Geometry · Mathematics 2023-04-20 Carlos A. B. Varea

Starting from Borel's description of the mod-2 cohomology of real flag manifolds, we give a minimal presentation of the cohomology ring for semi complete flag manifolds $F_{k,m}:=F(1,\ldots,1,m)$ where $1$ is repeated $k$ times. The…

Algebraic Topology · Mathematics 2015-11-19 Jesús González , Barbara Gutiérrez , Darwin Gutiérrez , Adriana Lara

We continue our study of the inclusion posets of diagonal $SL(n)$-orbit closures in a product of two partial flag varieties. We prove that, if the diagonal action is of complexity one, then the poset is isomorphic to one of the 28 posets…

Algebraic Geometry · Mathematics 2020-04-23 Mahir Bilen Can , Tien Le

Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…

Computational Geometry · Computer Science 2012-05-28 Norbert Paul