中文
相关论文

相关论文: Counterexample to a conjecture of Ziegler concerni…

200 篇论文

The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…

组合数学 · 数学 2013-04-30 Francisco Santos

In this paper, we present a minimal counterexample to a conjecture of Perles that answers a question of Haase and Ziegler. The example is a simple 4-polytope that has an induced 3-connected 3-regular subgraph, whose graph complement is…

组合数学 · 数学 2018-09-10 Joseph Doolittle

We consider the conjecture by Aichholzer, Aurenhammer, Hurtado, and Krasser that any two points sets with the same cardinality and the same size convex hull can be triangulated in the "same" way, more precisely via \emph{compatible…

We present a simple dyadic construction that yields a new counterexample to Zygmund's conjecture. Our result recovers Soria's classical result in dimension three, through a different construction, and gives new ones in all other dimensions…

经典分析与常微分方程 · 数学 2020-04-07 Guillermo Rey

We define an abstract regular polytope to be internally self-dual if its self-duality can be realized as one of its symmetries. This property has many interesting implications on the structure of the polytope, which we present here. Then,…

群论 · 数学 2016-10-11 Gabe Cunningham , Mark Mixer

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

组合数学 · 数学 2007-05-23 Christian Haase , Günter M. Ziegler

In a paper of Bosio and Meersseman (Real quadrics in Cn, complex manifolds and convex polytopes) the following is conjectured: If P is dual neighborly, then Zp is diffeomorphic to the connected sum of products of spheres. In this paper a…

辛几何 · 数学 2008-03-15 David Allen , Jose La Luz

We determine the combinatorial types of all the 3-dimensional simple convex polytopes in R^3 that can be realized as mean curvature convex (or totally geodesic) Riemannian polyhedra with non-obtuse dihedral angles in Riemannian 3-manifolds…

微分几何 · 数学 2024-07-30 Li Yu

We show that the "double circle" order type and some of its generalizations have a compatible triangulation with any other order types with the same number of points and number of edges on convex hull, thus proving another special case of…

组合数学 · 数学 2025-08-07 Hong Duc Bui

We prove that the second derived subdivision of any rectilinear triangulation of any convex polytope is shellable. Also, we prove that the first derived subdivision of every rectilinear triangulation of any convex 3-dimensional polytope is…

组合数学 · 数学 2015-03-20 Karim Alexander Adiprasito , Bruno Benedetti

We prove that the intersection of a Hirsch polytope and a cube may be a non-Hirsch polytope.

组合数学 · 数学 2019-12-03 Kean P. Fallon , Madisyn Janusiak , Edward D. Kim , Avery McLain

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…

几何拓扑 · 数学 2007-05-29 Jaejeong Lee

We prove that every polytope described by algebraic coordinates is the face of a projectively unique polytope. This provides a universality property for projectively unique polytopes. Using a closely related result of Below, we construct a…

度量几何 · 数学 2013-06-14 Karim Alexander Adiprasito , Arnau Padrol

Corsten and Frankl conjectured that a simplex is diameter-Ramsey if and only if its circumcenter lies in its convex hull. We disprove this conjecture in every dimension $d\ge 3$. The main tool is a sufficient criterion based on a…

组合数学 · 数学 2026-04-22 Yaping Mao

A polytrope is a tropical polytope which at the same time is convex in the ordinary sense. A $d$-dimensional polytrope turns out to be a tropical simplex, that is, it is the tropical convex hull of $d+1$ points. This statement is equivalent…

组合数学 · 数学 2010-03-24 Michael Joswig , Katja Kulas

A theorem of Howe states that every 3-dimensional lattice polytope $P$ whose only lattice points are its vertices, is a Cayley polytope, i.e. $P$ is the convex hull of two lattice polygons with distance one. We want to generalize this…

组合数学 · 数学 2008-09-11 Jaron Treutlein

For every integer $k\geq 2$ and every $R>1$ one can find a dimension $n$ and construct a symmetric convex body $K\subset\mathbb{R}^n$ with $\text{diam}\,Q_{k-1}(K)\geq R\cdot\text{diam}\,Q_k(K)$, where $Q_k(K)$ denotes the $k$-convex hull…

度量几何 · 数学 2025-10-01 Davide Ravasini

A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…

代数几何 · 数学 2022-12-21 Jaeho Shin

We describe convex hulls of the simplest compact space curves, reducible quartics consisting of two circles. When the circles do not meet in complex projective space, their algebraic boundary contains an irrational ruled surface of degree…

代数几何 · 数学 2017-01-24 Evan D. Nash , Ata Firat Pir , Frank Sottile , Li Ying

We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…

组合数学 · 数学 2026-03-11 Matthias Himmelmann , Bernd Schulze , Martin Winter
‹ 上一页 1 2 3 10 下一页 ›