中文
相关论文

相关论文: All polytopes are coset geometries: characterizing…

200 篇论文

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…

组合数学 · 数学 2015-06-16 Satyan L. Devadoss , Rahul Shah , Xuancheng Shao , Ezra Winston

The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…

组合数学 · 数学 2007-05-23 Thomas Lam , Alexander Postnikov

In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that,…

组合数学 · 数学 2009-05-06 Kari Ragnarsson , Bridget Eileen Tenner

Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…

度量几何 · 数学 2016-10-11 Egon Schulte , Asia Ivić Weiss

A $3$-polytope is a $3$-connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other $3$-polytope, up to graph isomorphism. The classification of unigraphic $3$-polytopes appears to be a…

组合数学 · 数学 2024-10-08 Riccardo W. Maffucci

We consider two polytopes. The quadratic assignment polytope $QAP(n)$ is the convex hull of the set of tensors $x\otimes x$, $x \in P_n$, where $P_n$ is the set of $n\times n$ permutation matrices. The second polytope is defined as follows.…

计算复杂性 · 计算机科学 2017-06-20 Aleksandr Maksimenko

In this note on coarse geometry we revisit coarse homotopy. We prove that coarse homotopy indeed is an equivalence relation, and this in the most general context of abstract coarse structures. We introduce (in a geometric way) coarse…

几何拓扑 · 数学 2023-08-14 Paul D. Mitchener , Behnam Norouzizadeh , Thomas Schick

A 3-dimensional polytope is called k-equiprojective if every planar projection along a direction non-parallel to any facet is a k-gon. In this article, we generalise equiprojectivity to higher dimensions and give a lower bound on the number…

组合数学 · 数学 2026-01-21 Alice Cousaert

In a d-simplex every facet is a (d-1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this…

组合数学 · 数学 2007-05-23 Margaret M. Bayer , Tibor Bisztriczky

We study properties of the realizations of groups as the combinatorial automorphism group of a convex polytope. We show that for any non-abelian group $G$ with a central involution there is a centrally symmetric polytope with $G$ as its…

度量几何 · 数学 2020-04-27 Alexandru Chirvasitu , Frieder Ladisch , Pablo Soberón

For each $d\geq 3$, $n \geq 10$, and $k_1, k_2, \ldots, k_{d-1}\geq 2$ with $k_1+k_2+\ldots+k_{d-1}\leq n-1$, we construct a regular $d$-polytope whose automorphism group is of order $2^n$ and whose Schl\"afli type is $\{2^{k_1},2^{k_2},…

群论 · 数学 2019-01-23 Dong-Dong Hou , Yanquan Feng , Dimitri Leemans

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…

组合数学 · 数学 2007-05-23 Volker Kaibel , Marc E. Pfetsch

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

群论 · 数学 2023-07-25 Reymond Akpanya , Tom Goertzen

We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster…

组合数学 · 数学 2023-11-14 Vincent Pilaud , Christian Stump

The Solomon-Tits theorem says that the poset of proper non-trivial subspaces of a finite-dimensional vector space has realisation equivalent to a wedge of spheres. In this paper we prove a variant of this result for collections of geodesic…

代数拓扑 · 数学 2026-05-04 Alexander Kupers , Ezekiel Lemann , Cary Malkiewich , Jeremy Miller , Robin J. Sroka

Polytopes in R^n with integral vertices form a monoid under the Minkowski sum, and the Grothendieck construction gives rise to a group. We show that every symmetric polytope is a norm in this group for every n.

几何拓扑 · 数学 2015-12-22 Jae Choon Cha , Stefan Friedl , Florian Funke

Every Ree group $R(q)$, with $q\neq 3$ an odd power of 3, is the automorphism group of an abstract regular polytope, and any such polytope is necessarily a regular polyhedron (a map on a surface). However, an almost simple group $G$ with…

群论 · 数学 2015-01-07 Dimitri Leemans , Egon Schulte , Hendrik Van Maldeghem

A normal subgroup of the (extended) mapping class group of a surface is said to be geometric if its automorphism group is the mapping class group. We prove that in the case of the Cantor tree surface, every normal subgroup is geometric. We…

群论 · 数学 2020-02-18 Alan McLeay

In this note we gather and review some facts about existence of toric spaces over 3-dimensional simple polytopes. First, over every combinatorial 3-polytope there exists a quasitoric manifold. Second, there exist combinatorial 3-polytopes,…

代数拓扑 · 数学 2026-02-10 Anton Ayzenberg

We provide an intrinsic notion of curved cosets for arbitrary Cartan geometries, simplifying the existing construction of curved orbits for a given holonomy reduction. To do this, we define an intrinsic holonomy group, which is shown to…

微分几何 · 数学 2022-07-25 Jacob W. Erickson