A quasi-polynomial bound for the diameter of graphs of polyhedra
英文摘要:
The diameter of the graph of a $d$-dimensional polyhedron with $n$ facets is at most $n^{\log d+2}$
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Gil Kalai, Daniel J. Kleitman
The diameter of the graph of a $d$-dimensional polyhedron with $n$ facets is at most $n^{\log d+2}$
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
Let $Δ(d,n)$ denote the maximum diameter of a $d$-dimensional polyhedron with $n$ facets. In this paper, we propose a unified analysis of a recursive inequality about $Δ(d,n)$ established by Kalai and Kleitman in 1992. This yields much simpler proofs of a tail--polynomial and tail--almost--linear bounds on $Δ(d,n)$ which are recently discussed by Gallagher and Kim.
Borsuk and Vázsonyi problems through Reuleaux polyhedra
本文利用Reuleaux多面体建立了三维空间中Borsuk数为4的临界集与Vázsonyi问题极小结构之间的等价关系,并由此完整刻画了所有Borsuk数为4的有限集合。
We give the quasi--Euclidean classification of the maximal (with respect to the $f$--vector) alcoved polyhedra. The $f$--vector of these maximal convex bodies is $(20,30,12)$, so they are simple dodecahedra. We find eight quasi--Euclidean classes. This classification, which preserves angles, is finer than the known combinatorial classification (found in 2012 by Jiménez and de la Puente), which has only six classes. Each alcoved polyhedron $\mathcal{P}$ is represented by a unique visualized idempotent matrix $A$. Some 2--minors of $A$ are invariants of $\mathcal{P}$: they are the tropical edge-…
This short note extends a recent result (Bonifas et al, On sub-determinants and the diameter of polyhedra, Discrete Computational Geometry, 52, 2014) of an upper bound of the diameter of a convex polytope defined by an integer matrix to a similar upper bound of the diameter of a convex polytope defined by a real matrix. It also shows, by an example, that the new bound may be better than the ones of Bonifas et al.
Quasi-symmetric nets: A constructive approach to the equimodular elliptic type of Kokotsakis polyhedra
本文提出拟对称网(QS-nets)来构造四边底等模椭圆型柔性Kokotsakis多面体,给出显式代数刻画和闭式变形参数化,并开发数值管道验证实例。
We study snapping and shaky polyhedra which consist of antiprismatic skeletons covered by polyhedral belts composed of triangular faces only. In detail, we generalize Wunderlich's trisymmetric sandglass polyhedron in analogy to the generalizsation of the Jessen orthogonal icosahedron to Milka's extreme birosette structures, with the additional feature that the belt is developable into the plane as the Kresling pattern. Within the resulting 2-dimensional family of origami-like sandglasses we study the 1-parametric sets of quasi-mechanisms which are either shaky or have an extremal snap, i.e. on…
The Minkowski length of a lattice polytope $P$ is a natural generalization of the lattice diameter of $P$. It can be defined as the largest number of lattice segments whose Minkowski sum is contained in $P$. The famous Ehrhart theorem states that the number of lattice points in the positive integer dilates $tP$ of a lattice polytope $P$ behaves polynomially in $t\in\mathbb{N}$. In this paper we prove that for any lattice polytope $P$, the Minkowski length of $tP$ for $t\in\mathbb{N}$ is eventually a quasi-polynomial with linear constituents. We also give a formula for the Minkowski length of c…
We present a complete system of inequalities for the inradius, circumradius, and diameter in the $3$-dimensional Euclidean space. To do so, we prove quasiconcavity of the inradius evaluated over $n$-simplices with a common facet independently of the norm/gauge under consideration.
Finding Closed Quasigeodesics on Convex Polyhedra
针对凸多面体上闭合拟测地线的构造难题,论文提出首个有限查找算法,给出面访问次数及real RAM、word RAM下的伪多项式复杂度界,并引入表达式RAM模型。
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。