The pyramidal growth

Joseph Gubeladze

备注：: New Section 3 (Outline of the proof) and figures added

英文摘要：

Can one build an arbitrary polytope from any polytope inside by iteratively stacking pyramids onto facets, without losing the convexity throughout the process? We prove that this is indeed possible for (i) 3-polytopes, (ii) 4-polytopes under a certain infinitesimal quasi-pyramidal relaxation, and (iii) all dimensions asymptotically. The motivation partly comes from our study of K-theory of monoid rings and of certain posets of discrete-convex objects.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

On vertex adjacencies in the polytope of pyramidal tours with step-backs

We consider the traveling salesperson problem in a directed graph. The pyramidal tours with step-backs are a special class of Hamiltonian cycles for which the traveling salesperson problem is solved by dynamic programming in polynomial time. The polytope of pyramidal tours with step-backs $PSB (n)$ is defined as the convex hull of the characteristic vectors of all possible pyramidal tours with step-backs in a complete directed graph. The skeleton of $PSB (n)$ is the graph whose vertex set is the vertex set of $PSB (n)$ and the edge set is the set of geometric edges or one-dimensional faces of …

2019-02-15math.CO

On the skeleton of the pyramidal tours polytope

We consider the skeleton of the pyramidal tours polytope. Hamiltonian tour is called pyramidal if the salesperson starts in city $1$, then visits some cities in increasing order, reaches city $n$ and returns to city $1$, visiting the remaining cities in decreasing order. The polytope $PYR(n)$ is defined as the convex hull of characteristic vectors of all pyramidal tours in the complete graph $K_{n}$. The skeleton of the polytope $PYR(n)$ is the graph whose vertex set is the vertex set of $PYR(n)$ and edge set is the set of geometric edges or one-dimensional faces of $PYR(n)$. We describe the n…

2017-10-17math.CO

On 1-skeleton of the polytope of pyramidal tours with step-backs

Pyramidal tours with step-backs are Hamiltonian tours of a special kind: the salesperson starts in city 1, then visits some cities in ascending order, reaches city $n$, and returns to city 1 visiting the remaining cities in descending order. However, in the ascending and descending direction, the order of neighboring cities can be inverted (a step-back). It is known that on pyramidal tours with step-backs the traveling salesperson problem can be solved by dynamic programming in polynomial time. We define the polytope of pyramidal tours with step-backs $\operatorname{PSB}(n)$ as the convex hull…

2022-02-07math.COmath.OC

Pyramidal Polytopes in the Stability Region

Every $n th$ order monic polynomial corresponds $n$-dimensional vector. If the given polynomial is stable that is all its roots lie in the open left half plane it is said to be Hurwitz polynomial and the corresponding vector is called stable vector. The set of stable vectors is non-convex. In this paper, we define special $(n+1) $ stable vectors such that their convex hull is stable.

2018-10-04math.COmath.DSmath.OC

Flag-approximability of convex bodies and volume growth of Hilbert geometries

We introduce the flag-approximability of a convex body to measure how easy it is to approximate by polytopes. We show that the flag-approximability is exactly half the volume entropy of the Hilbert geometry on the body, and that both quantities are maximized when the convex body is a Euclidean ball. We also compute explicitly the asymptotic volume of a convex polytope, which allows us to prove that simplices have the least asymptotic volume.

2018-09-25math.COmath.MG

Root polytopes and growth series of root lattices

The convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the root polytopes associated to the root lattices A_n, C_n, and D_n, and compute their f-and h-vectors. This leads us to recover formulae for the growth series of these root lattices, which were first conjectured by Conway-Mallows-Sloane and Baake-Grimm and proved by Conway-Sloane and Bacher-de la Harpe-Venkov.

2008-09-30math.ACmath.CO

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

Funk几何的体积增长与多胞形的旗

Volume growth of Funk geometry and the flags of polytopes

本文研究Funk几何中球的体积增长，提出并部分验证了与Mahler和旗猜想相关的极小化猜想，并计算了多胞形情形的高阶渐近项，推广了Santaló点概念。

2023-06-15math.COmath.DGmath.MG

Finite sets of operations sufficient to construct any fullerene from $C_{20}$

We study the well-known problem of combinatorial classification of fullerenes. By a (mathematical) fullerene we mean a convex simple three dimensional polytope with all facets pentagons and hexagons. We analyse approaches of construction of arbitrary fullerene from the dodecahedron (a fullerene $C_{20}$). A growth operation is a combinatorial operation that substitutes the patch with more facets and the same boundary for the patch on the surface of a simple polytope to produce a new simple polytope. It is known that an infinite set of different growth operations transforming fullerenes into fu…

2016-11-16math.CO

Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices

The coordination sequence of a lattice $Ł$ encodes the word-length function with respect to $M$, a set that generates $Ł$ as a monoid. We investigate the coordination sequence of the cyclotomic lattice $Ł= \Z[ζ_m]$, where $ζ_m$ is a primitive $mþ$ root of unity and where $M$ is the set of all $mþ$ roots of unity. We prove several conjectures by Parker regarding the structure of the rational generating function of the coordination sequence; this structure depends on the prime factorization of $m$. Our methods are based on unimodular triangulations of the $mþ$ cyclotomic polytope, the convex hul…

2006-02-15math.ACmath.COmath.NT

Generalizations of Khovanskii's theorems on growth of sumsets in abelian semigroups

We show that if $P$ is a lattice polytope in the nonnegative orthant of $\R^k$ and $χ$ is a coloring of the lattice points in the orthant such that the color $χ(a+b)$ depends only on the colors $χ(a)$ and $χ(b)$, then the number of colors of the lattice points in the dilation $nP$ of $P$ is for large $n$ given by a polynomial (or, for rational $P$, by a quasipolynomial). This unifies a classical result of Ehrhart and Macdonald on lattice points in polytopes and a result of Khovanski\uı on sumsets in semigroups. We also prove a strengthening of multivariate generalizations of Khovanski\uı's the…

2007-06-07math.COmath.NT