English
Related papers

Related papers: Klein polyhedra and lattices with positive norm mi…

200 papers

Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…

Logic in Computer Science · Computer Science 2023-06-22 Xavier Allamigeon , Ricardo D. Katz , Pierre-Yves Strub

This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…

Computational Geometry · Computer Science 2007-09-12 Joseph O'Rourke

We construct a sequence of convex polyhedra on n vertices with the property that, as n -> infinity, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the fraction that overlap approaches 1. Nevertheless, each does…

Computational Geometry · Computer Science 2008-01-28 Alex Benton , Joseph O'Rourke

We show how to construct in an elementary way the invariant of the KHK discretisation of a cubic Hamiltonian system in two dimensions. That is, we show that this invariant is expressible as the product of the ratios of affine polynomials…

Numerical Analysis · Mathematics 2024-03-06 Giorgio Gubbiotti , David McLaren , G. R. W. Quispel

A Gelfand-Cetlin polytope is a convex polytope obtained as an image of certain completely integrable system on a partial flag variety. In this paper, we give an equivalent description of the face structure of a GC-polytope in terms of so…

Combinatorics · Mathematics 2021-01-11 Byung Hee An , Yunhyung Cho , Jang Soo Kim

In this paper, we establish that the non-zero dihedral angles of hyperbolic Coxeter polyhedra of large dimensions are not arbitrarily small. Namely, for dimensions $n\geq 32$, they are of the form $\frac{\pi}{m}$ with $m\leq 6$. Moreover,…

Combinatorics · Mathematics 2025-07-08 Naomi Bredon

A notable example due to Heier, Lu, Wong, and Zheng shows that there exist compact complex K\"ahler manifolds with ample canonical line bundle such that the holomorphic sectional curvature is negative semi-definite and vanishes along…

Differential Geometry · Mathematics 2023-11-21 Yongchang Chen , Gordon Heier

The aim of this note is to present two results that make the task of finding equivalent polyhedral norms on certain Banach spaces, having either a Schauder basis or an uncountable unconditional basis, easier and more transparent. The…

Functional Analysis · Mathematics 2022-06-14 Trond A. Abrahamsen , Vladimir P. Fonf , Richard J. Smith , Stanimir Troyanski

Lower and upper bounds for a given function are important in many mathematical and engineering contexts, where they often serve as a base for both analysis and application. In this short paper, we derive piecewise linear and quadratic…

Optimization and Control · Mathematics 2014-06-17 Gene A. Bunin , Grégory François , Dominique Bonvin

More analysis of operator determinants on homogeneous three dimensional lens spaces is presented with the emphasis on numerics so that Laplacians for massive fields can be dealt with. Polyhedral quotients are also briefly considered.…

Mathematical Physics · Physics 2015-06-12 J. S. Dowker

Positive Quaternion Kaehler Manifolds are Riemannian manifolds with holonomy contained in Sp(n)Sp(1) and with positive scalar curvature. Conjecturally, they are symmetric spaces. We prove this conjecture in dimension 20 under additional…

Differential Geometry · Mathematics 2009-11-25 Manuel Amann

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph)…

Combinatorics · Mathematics 2021-04-12 Simon Špacapan

We show that any set of quotients with fixed Chern classes of a given coherent sheaf on a compact Kaehler manifold is bounded in a sense which we define. The result is proved by adapting Grothendieck's boundedness criterium expressed via…

Complex Variables · Mathematics 2017-08-23 Matei Toma

In this paper we give a version of Krivine-Stengle's Positivstellensatz, Schweighofer's Positivstellensatz, Scheiderer's local-global principle, Scheiderer's Hessian criterion and Marshall's boundary Hessian conditions for polynomial…

Algebraic Geometry · Mathematics 2019-02-19 Công-Trình Lê

Goulden-Rattan polynomials give the exact value of the subdominant part of the normalized characters of the symmetric groups in terms of certain quantities ($C_i$) which describe the macroscopic shape of the Young diagram. The…

Combinatorics · Mathematics 2022-06-01 Mikołaj Marciniak

We define the infinitesimal and geometric orders of an effective Klein geometry G/H. Using these concepts, we prove i) For any integer m>1, there exists an effective Klein geometry G/H of infinitesimal order m such that G/H is a projective…

Differential Geometry · Mathematics 2009-12-04 Ender Abadoglu , Ercument Ortacgil

We define higher polyhedral K-groups for commutative rings, starting from the stable groups of elementary automorphisms of polyhedral algebras. Both Volodin's theory and Quillen's + construction are developed. In the special case of…

K-Theory and Homology · Mathematics 2007-05-23 Winfried Bruns , Joseph Gubeladze

It is known that the space of convex polygons in the Euclidean plane with fixed normals, up to homotheties and translations, endowed with the area form, is isometric to a hyperbolic polyhedron. In this note we show a class of convex…

Differential Geometry · Mathematics 2013-04-05 François Fillastre

Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…

Metric Geometry · Mathematics 2021-12-21 Spencer Whitehead

The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…

Combinatorics · Mathematics 2024-07-25 Carles Cardó