English
Related papers

Related papers: A convexity theorem for real projective structures

200 papers

A simple closed curve $\gamma$ in the real projective plane $P^2$ is called anti-convex if for each point $p$ on the curve, there exists a line which is transversal to the curve and meets the curve only at $p$. We shall prove the relation…

Differential Geometry · Mathematics 2007-05-23 Gudlaugur Thorbergsson , Masaaki Umehara

Let $p\neq 2$, and let $R$ be a smooth affine algebra of dimension $3$ over $\overline{F}_p$ and $P, Q$ be projective $R$-modules of rank $2$, each with trivial determinant. We prove: $P$ is isomorphic to $Q$ if and only if there is an…

Commutative Algebra · Mathematics 2017-10-26 Mrinal Kanti Das

Let us consider the set of all joint probabilities generated by local binary measurements on two separated quantum systems of a given local dimension d. We address the question of whether the shape of this quantum body is convex or not. We…

Quantum Physics · Physics 2015-05-13 K. F. Pál , T. Vértesi

If $M$ is a closed Nil geometry 3-manifold then $\pi_1(M)$ is almost convex with respect to a fairly simple ``geometric'' generating set. If $G$ is a central extension or a ${\Bbb Z}$-extension of a word hyperbolic group, then $G$ is also…

Group Theory · Mathematics 2008-02-03 Michael Shapiro , Melany Stein

Let $K$ and $L$ be two convex bodies in ${\mathbb R^4}$, such that their projections onto all $3$-dimensional subspaces are directly congruent. We prove that if the set of diameters of the bodies satisfy an additional condition and some…

Metric Geometry · Mathematics 2015-09-30 M. Angeles Alfonseca , Michelle Cordier , Dmitry Ryabogin

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

Computational Geometry · Computer Science 2020-07-30 Erik D. Demaine , Martin L. Demaine , David Eppstein

We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…

Complex Variables · Mathematics 2023-06-21 Giovanni Domenico Di Salvo

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…

Combinatorics · Mathematics 2022-04-22 Joseph Gubeladze

A graph embedded in a surface with all faces of size 4 is known as a quadrangulation. We extend the definition of quadrangulation to higher dimensions, and prove that any graph G which embeds as a quadrangulation in the real projective…

Combinatorics · Mathematics 2015-05-07 Tomáš Kaiser , Matěj Stehlík

A spherical set is called convex if for every pair of its points there is at least one minimal geodesic segment that joins these points and lies in the set. We prove that for n >= 3 a complete locally-convex (topological) immersion of a…

Metric Geometry · Mathematics 2007-10-02 Konstantin Rybnikov

For a polytope P a simplex S with vertex set V(S) is called a special simplex if every facet of P contains all but exactly one vertex of S. For such polytopes P with face complex F(P) containing a special simplex the subcomplex F(P) / V(S)…

Combinatorics · Mathematics 2010-10-01 Timo de Wolff

Let G be an infinitesimal group scheme of finite height r and V(G) the scheme which represents 1-parameter subgroups of G. We consider sheaves over the projectivization P(G) of V(G) constructed from a G-module M. We show that if P(G) is…

Representation Theory · Mathematics 2015-04-01 Jim Stark

We construct a 2-parameter family of 4-dimensional polytopes with extreme combinatorial structure: In this family, the ``fatness'' of the f-vector gets arbitrarily close to 9, the ``complexity'' (given by the flag vector) gets arbitrarily…

Metric Geometry · Mathematics 2007-05-23 Günter M. Ziegler

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…

Metric Geometry · Mathematics 2016-09-06 Carsten Schütt

Here we propose a class of frameworks in the plane, braced polygons, that may be globally rigid and are analogous to convex polyopes in 3 space that are rigid by Cauchy's rigidity Theorem in 1813.

Metric Geometry · Mathematics 2024-10-10 Robert Connelly , Bill Jackson , Shin-ichi Tanigawa , Zhen Zhang

Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including…

Computational Geometry · Computer Science 2020-02-07 Elena Arseneva , Stefan Langerman

A two-step model for generating random polytopes is considered. For parameters $d$, $m$, and $p$, the first step is to generate a simple polytope $P$ whose facets are given by $m$ uniform random hyperplanes tangent to the unit sphere in…

Combinatorics · Mathematics 2021-08-16 Andrew Newman

The paper is devoted to the well-known problem of smooth structures on moment-angle manifolds. Each real or complex moment-angle manifold has an equivariant smooth structure given by an intersection of quadrics corresponding to a geometric…

Geometric Topology · Mathematics 2025-03-04 Nikolai Erokhovets , Elena Erokhovets

The complex projective structures considered is this article are compact curves locally modeled on $\mathbb{CP}^1$. To such a geometric object, modulo marked isomorphism, the monodromy map associates an algebraic one: a representation of…

Differential Geometry · Mathematics 2025-08-28 Titouan Sérandour

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…

Combinatorics · Mathematics 2007-10-26 W. R. G. James , I. Jensen , A. J. Guttmann
‹ Prev 1 8 9 10 Next ›