arXiv math/00102132000-10math.AGmath.CO

On polytopes simple in edges

Vladlen Timorin

备注：: Rewritten. The first version contained fatal errors. 16 pages, to be published in Func. Anal. and Appl
发表信息：: Funct. Anal. Appl. 35(2001) no. 3, pp. 189-198

英文摘要：

We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's conjecture for such polytopes.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Ehrhart polynomials of 3-dimensional simple integral convex polytopes

We give an explicit formula on the Ehrhart polynomial of a 3-dimensional simple integral convex polytope by using toric geometry.

2016-05-16math.AGmath.CO

Betti numbers of the geometric spaces associated to nonrational simple convex polytopes

We compute the Betti numbers of the geometric spaces associated to nonrational simple convex polytopes and find that they depend on the combinatorial type of the polytope exactly as in the rational case. This shows that the combinatorial features of the starting polytope are encoded in these generalized toric spaces as they are in their rational counterparts.

2010-04-27math.AGmath.CO

Algebraic Degrees of 3-Dimensional Polytopes

Results of Koebe (1936), Schramm (1992), and Springborn (2005) yield realizations of $3$-polytopes with edges tangent to the unit sphere. Here we study the algebraic degrees of such realizations. This initiates the research on constrained realization spaces of polytopes.

2022-03-24math.AGmath.CO

Convex-normal (pairs of) polytopes

In 2012 Gubeladze (Adv.\ Math.\ 2012) introduced the notion of k-convex-normal polytopes to show that integral polytopes all of whose edges are longer than 4d(d+1) have the integer decomposition property. In the first part of this paper we show that for lattice polytopes there is no difference between k- and (k+1)-convex-normality (for k >= 3) and improve the bound to 2d(d+1). In the second part we extend the definition to pairs of polytopes and show that for rational polytopes P and Q, where the normal fan of P is a refinement of the normal fan of Q, if every edge e_P of P is at least d times…

2014-10-23math.ACmath.AGmath.CO

多面体的变形与二阶刚性

Deformations and second-order rigidity of polytopes

Technische Universität Braunschweig（不伦瑞克工业大学）；Max-Planck-Institute for Mathematics in the Sciences（马克斯·普朗克科学促进研究所数学系）；Tsinghua University（清华大学）

研究保持棱长和面共面性的多面体变形，开发二阶理论及算法测试二阶刚性，在多面体类上验证优势，发现特殊案例，还研究棱长扰动及与刚性的联系，并以正十二面体为例进行案例研究。

2026-07-13math.AGmath.COmath.MG

Projectivities in Simplicial Complexes and Colorings of Simple Polytopes

For each strongly connected finite-dimensional (pure) simplicial complex we construct a finite group, the group of projectivities of the complex, which is a combinatorial but not a topological invariant. This group is studied for combinatorial manifolds and, in particular, for polytopal simplicial spheres. The results are applied to a coloring problem for simplicial (or, dually, simple) polytopes which arises in the area of toric algebraic varieties.

2001-06-27math.AGmath.COmath.MG

更多相关论文收起更多论文

Anti-Ramsey theory problems, lattice point counts on polytopes, and Hodge structures on the cohomology of toric varieties

We find families of graphs $G$ and subgraphs $H$ of $G$ such that the number of edge colorings of $G$ avoiding a monochromatic coloring of $H$ is determined by lattice point counts or a Hodge structure on the cohomology of a certain toric variety. In general, this gives a class of ``anti-Ramsey theory problems'' with a geometric structure. For example, we find one for Ramsey numbers of classes of such graphs. The key observation is that our previous result expressing simplicial chromatic polynomials in terms of $h$-vectors of auxiliary simplicial complexes can be reinterpreted as one on edge c…

2022-06-14math.AGmath.ATmath.CO

Representing simple d-dimensional polytopes by d polynomials

A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of polynomials in a polynomial representation of P. It is known that d \le s(d,P) \le 2d-1. Moreover, it is conjectured that s(d,P)=d for all convex d-polytopes P. We confirm this conjecture for simple d-polytopes by providing an explicit construction of d polynomials that represent a given simple d-polytope P.

2007-09-13math.AGmath.MG

Generalized toric varieties for simple non-rational convex polytopes

We call complex quasifold of dimension k a space that is locally isomorphic to the quotient of an open subset of the space C^k by the holomorphic action of a discrete group; the analogue of a complex torus in this setting is called a complex quasitorus. We associate to each simple polytope, rational or not, a family of complex quasifolds having same dimension as the polytope, each containing a dense open orbit for the action of a suitable complex quasitorus. We show that each of these spaces M is diffeomorphic to one of the symplectic quasifolds defined in http://arXiv.org/abs/math:SG/9904179,…

2001-06-01math.AGmath.COmath.CV