English
Related papers

Related papers: Steinhaus conditions for convex polyhedra

200 papers

We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity rho(S) of S is given by the smallest number of reflex vertices in a simple polygonalization of S.…

Computational Geometry · Computer Science 2007-05-23 Esther M. Arkin , Sandor P. Fekete , Ferran Hurtado , Joseph S. B. Mitchell , Marc Noy , Vera Sacristan , Saurabh Sethia

Let $f_1(x),\ldots,f_n(x)$ be some polynomials. The upper bound on the number of $x\in\mathbb F_p$ such that $f_1(x),\ldots,f_n(x)$ are roots of unit of order $t$ is obtained. This bound generalize the bound of the paper \cite{V-S} to the…

Combinatorics · Mathematics 2018-11-26 Ilya Vyugin

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

Metric Geometry · Mathematics 2026-03-10 Steven Hoehner

We consider an inverse problem associated with some 2-dimensional non-compact surfaces with conical singularities, cusps and regular ends. Our motivating example is a Riemann surface $\mathcal M = \Gamma\backslash{\bf H}^2$ associated with…

Analysis of PDEs · Mathematics 2011-08-09 Hiroshi Isozaki , Yaroslav Kurylev , Matti Lassas

Let S be a closed connected real surface and f a smooth embedding or immersion of S into a complex surface X. Assuming that the number of complex points of the immersion (counted with algebraic multiplicities) is non-positive we prove that…

Complex Variables · Mathematics 2007-05-23 Franc Forstneric

A nonempty closed convex set in ${\mathbb R}^n$, not containing the origin, is called a pseudo-cone if with every $x$ it also contains $\lambda x$ for $x\ge 1$. We consider pseudo-cones with a given recession cone $C$, called…

Metric Geometry · Mathematics 2023-11-29 Rolf Schneider

We consider the formation of trapped surfaces in the evolution of the Einstein-scalar field system without symmetries. To this end, we follow An's strategy to analyse the formation of trapped surfaces in vacuum and for the Einstein-Maxwell…

General Relativity and Quantum Cosmology · Physics 2023-04-05 Peng Zhao , David Hilditch , Juan A. Valiente Kroon

Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…

Computational Geometry · Computer Science 2014-02-04 Adrian Dumitrescu , Sariel Har-Peled , Csaba D. Tóth

This paper gives a note on an application of the enclosure method to an inverse obstacle scattering problem governed by the Helmholtz equation in two dimensions. It is shown that one can uniquely determine the convex hull of an unknown…

Analysis of PDEs · Mathematics 2011-09-21 Masaru Ikehata

The cyclohedron (Bott-Taubes polytope) arises both as the polyhedral realization of the poset of all cyclic bracketings of a circular word and as an essential part of the Fulton-MacPherson compactification of the configuration space of n…

Combinatorics · Mathematics 2008-11-11 Sinisa Vrecica , Rade Zivaljevic

Let $\mathcal{P}$ and $\mathcal{P}'$ be $3$-dimensional convex polytopes in $\mathbb{R}^3$ and $S \subseteq \mathbb{R}^3$ be a non-empty intersection of an open set with a sphere. As a consequence of a somewhat more general result it is…

Metric Geometry · Mathematics 2020-09-23 Konrad Engel , Bastian Laasch

An affine invariant point on the class of convex bodies in R^n, endowed with the Hausdorff metric, is a continuous map p which is invariant under one-to-one affine transformations A on R^n, that is, p(A(K))=A(p(K)). We define here the new…

Functional Analysis · Mathematics 2013-10-02 Mathieu Meyer , Carsten Schuett , Elisabeth M. Werner

Let $S_{g,n}$ be a surface of genus $g > 1$ with $n>0$ punctures equipped with a complete hyperbolic cusp metric. Then it can be uniquely realized as the boundary metric of an ideal Fuchsian polyhedron. In the present paper we give a new…

Geometric Topology · Mathematics 2019-04-30 Roman Prosanov

Given a combinatorial description $C$ of a polyhedron having $E$ edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize $C$ is generally not a convex subset of $\mathbb{R}^E$ \cite{DIAZ}. If $C$ has five or…

Geometric Topology · Mathematics 2007-05-23 Roland K. W. Roeder

A polyhedron is flexible if it can be continuously deformed preserving the shape and dimensions of every its face. In the late 1970's Klaus Steffen constructed a sphere-homeomorphic embedded flexible polyhedron with triangular faces and…

Metric Geometry · Mathematics 2025-09-23 Victor Alexandrov , Evgenii Volokitin

We relate the existence problem of harmonic maps into $S^2$ to the convex geometry of $S^2$. On one hand, this allows us to construct new examples of harmonic maps of degree 0 from compact surfaces of arbitrary genus into $S^2$. On the…

Differential Geometry · Mathematics 2019-11-05 Renan Assimos , Jürgen Jost

We prove that a 2-convex closed surface $S\subset E^4$ in the four-dimensional Euclidean space $E^4$, which is either $C^2$-smooth or polyhedral, provided that each vertex is incident to at most five edges, admits a mapping of degree one to…

Geometric Topology · Mathematics 2024-12-30 Dmitry V. Bolotov

We consider a one-dimensional totally asymmetric nearest-neighbor zero-range process with site-dependent jump-rates - an environment. For each environment p we prove that the set of all invariant measures is the convex hull of a set of…

Probability · Mathematics 2010-11-10 Enrique D. Andjel , Pablo A. Ferrari , Herve Guiol , Claudio Landim

We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…

Computational Geometry · Computer Science 2023-08-29 Csaba D. Tóth , Jorge Urrutia , Giovanni Viglietta

Let $p$ be a real zero polynomial in $n$ variables. Then $p$ defines a rigidly convex set $C(p)$. We construct a linear matrix inequality of size $n+1$ in the same $n$ variables that depends only on the cubic part of $p$ and defines a…

Optimization and Control · Mathematics 2023-07-26 Markus Schweighofer