English
Related papers

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

200 papers

The Lagrange theorem on continued fractions states that a number is a quadratic surd if and only if its continued fraction expansion is eventually periodic. The current paper is devoted to a multidimensional generalization of this fact. As…

Number Theory · Mathematics 2008-09-27 Oleg N. German , Evgeniy L. Lakshtanov

A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…

Metric Geometry · Mathematics 2007-05-23 Chaim Goodman-Strauss , John M Sullivan

An orthant polyhedron is a polyhedron with $m$ hyperfaces, that could be realized as a section of the $m$-dimensional non-negative orthant. We classify all 2-dimensional orthant polyhedra and provide some partial results towards the…

Metric Geometry · Mathematics 2014-07-23 Nikolay Pechenkin

We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…

Combinatorics · Mathematics 2022-03-09 Dylan Heuer , Jessica Striker

Skeletal polyhedra are discrete structures made up of finite, flat or skew, or infinite, helical or zigzag, polygons as faces, with two faces on each edge and a circular vertex-figure at each vertex. When a variant of Wythoff's construction…

Metric Geometry · Mathematics 2016-10-12 Egon Schulte , Abigail Williams

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

Computational Geometry · Computer Science 2016-08-12 David Eppstein , Elena Mumford

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

In this paper we study the three-dimensional analogue of the relation between the irrationality exponent of a real number and the growth of its regular continued fraction partial quotients. As a multidimensional generalisation of continued…

Number Theory · Mathematics 2022-07-14 Elmir R. Bigushev , Oleg N. German

We show that the polyhedron defined as the convex hull of the lattice points above the hyperbola $\left\{xy = n\right\}$ has between $\Omega(n^{1/3})$ and $O(n^{1/3} \log n)$ vertices. The same bounds apply to any hyperbola with rational…

Combinatorics · Mathematics 2025-02-03 David Alcántara , Mónica Blanco , Francisco Criado , Francisco Santos

In this note, we work out a simple inductive proof showing that every polyhedral cone K is the conic hull of a finite set X of vectors. The base cases of the induction are linear subspaces and linear halfspaces of linear subspaces. The…

Combinatorics · Mathematics 2009-12-16 Volker Kaibel

The Dehn quandle of a closed orientable surface is the set of isotopy classes of non-separating simple closed curves with a natural quandle structure arising from Dehn twists. In this paper, we consider finiteness of some canonical…

Geometric Topology · Mathematics 2025-05-21 Neeraj K. Dhanwani , Mahender Singh

A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…

Metric Geometry · Mathematics 2013-02-13 Karoly Bezdek , Marton Naszodi

Orthogonal polynomials with respect to the hypergeometric distribution on lattices in polyhedral domains in ${\mathbb R}^d$, which include hexagons in ${\mathbb R}^2$ and truncated tetrahedrons in ${\mathbb R}^3$, are defined and studied.…

Classical Analysis and ODEs · Mathematics 2020-02-13 Plamen Iliev , Yuan Xu

For orthogonal polynomials defined by compact Jacobi matrix with exponential decay of the coefficients, precise properties of orthogonality measure is determined. This allows showing uniform boundedness of partial sums of orthogonal…

Functional Analysis · Mathematics 2007-05-23 Josef Obermaier , Ryszard Szwarc

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for…

Computational Geometry · Computer Science 2009-09-29 Marc Glisse , Sylvain Lazard

We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…

Metric Geometry · Mathematics 2020-06-08 Victor Alexandrov

We state that any constant curvature Riemannian metric with conical singularities of constant sign curvature on a compact (orientable) surface $S$ can be realized as a convex polyhedron in a Riemannian or Lorentzian) space-form. Moreover…

Differential Geometry · Mathematics 2010-11-16 François Fillastre

We show the existence of families of periodic polyhedra in spaces of constant curvature whose fundamental domains can be obtained by attaching prisms and antiprisms to Archimedean solids. These polyhedra have constant discrete curvature and…

Differential Geometry · Mathematics 2024-01-09 Christina Duffield , Daniel Freese , William Holt , Matthias Weber , Ramazan Yol

Indecomposable symmetric Lorentzian manifolds of non-constant curvature are called Cahen-Wallach spaces. Their isometry classes are described by continuous families of real parameters. We derive necessary and sufficient conditions for the…

Differential Geometry · Mathematics 2015-01-08 Ines Kath , Martin Olbrich

Spectrahedra are linear sections of the cone of positive semidefinite matrices that, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We reprove…

Optimization and Control · Mathematics 2015-07-22 Avinash Bhardwaj , Philipp Rostalski , Raman Sanyal
‹ Prev 1 2 3 10 Next ›