English
Related papers

Related papers: A convexity theorem for real projective structures

200 papers

Motivated by strong desire to understand the natural geometry of moduli spaces of hyperbolic monopoles, we introduce and study a new type of geometry: pluricomplex geometry. It is a generalisation of hypercomplex geometry: we still have a…

Differential Geometry · Mathematics 2011-04-15 Roger Bielawski , Lorenz Schwachhöfer

A $3$-dimensional polytope $P$ is $k$-equiprojective when the projection of $P$ along any line that is not parallel to a facet of $P$ is a polygon with $k$ vertices. In 1968, Geoffrey Shephard asked for a description of all equiprojective…

Metric Geometry · Mathematics 2025-10-06 Théophile Buffière , Lionel Pournin

In this paper we shall discuss local polynomial convexity at the origin of the union of finitely many totally-real planes through $0 \in\mathbb{C}^2$. The planes, say $P_0,..., P_N$, satisfy a mild transversality condition that enables us…

Complex Variables · Mathematics 2011-08-31 Sushil Gorai

We prove that there is no d such that all finite projective planes can be represented by convex sets in R^d, answering a question of Alon, Kalai, Matousek, and Meshulam. Here, if P is a projective plane with lines l_1,...,l_n, a…

Combinatorics · Mathematics 2009-08-28 Martin Tancer

Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.

Combinatorics · Mathematics 2017-09-19 Ferran Hurtado , Eduardo Rivera-Campo

A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…

Algebraic Geometry · Mathematics 2022-12-21 Jaeho Shin

We extend the canonical cell decomposition due to Epstein and Penner of a hyperbolic manifold with cusps to the strictly convex setting. It follows that a sufficiently small deformation of the holonomy of a finite volume strictly convex…

Geometric Topology · Mathematics 2013-07-19 Daryl Cooper , Darren Long

We provide an affirmative answer to a problem posed by Barvinok and Veomett, showing that in general an n-dimensional convex body cannot be approximated by a projection of a section of a simplex of a sub-exponential dimension. Moreover, we…

Functional Analysis · Mathematics 2012-09-28 Alexander E. Litvak , Mark Rudelson , Nicole Tomczak-Jaegermann

We show that the rate of convergence on the approximation of volumes of a convex symmetric polytope P in R^n by its dual L_{p$-centroid bodies is independent of the geometry of P. In particular we show that if P has volume 1,…

Functional Analysis · Mathematics 2011-07-20 Grigoris Paouris , Elisabeth M. Werner

Let $\mathcal{P}$ be a set of points in the plane, and $\mathcal{S}$ a strictly convex set of points. In this note, we show that if $\mathcal{P}$ contains many translates of $\mathcal{S}$, then these translates must come from a generalized…

Combinatorics · Mathematics 2023-02-28 Gabriel Currier , Jozsef Solymosi , Ethan Patrick White

For convex real projective manifolds we prove an analogue of the higher rank rigidity theorem of Ballmann and Burns-Spatzier.

Differential Geometry · Mathematics 2023-09-27 Andrew Zimmer

We determine the combinatorial types of all the 3-dimensional simple convex polytopes in R^3 that can be realized as mean curvature convex (or totally geodesic) Riemannian polyhedra with non-obtuse dihedral angles in Riemannian 3-manifolds…

Differential Geometry · Mathematics 2024-07-30 Li Yu

A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…

Quantum Physics · Physics 2007-05-23 Ingemar Bengtsson , Asa Ericsson

Toric topology assigns to each $n$-dimensional combinatorial simple convex polytope $P$ with $m$ facets an $(m+n)$-dimensional moment-angle manifold $\mathcal{Z}_P$ with an action of a compact torus $T^m$ such that $\mathcal{Z}_P/T^m$ is a…

Algebraic Topology · Mathematics 2020-12-29 Nikolai Erokhovets

A simple convex polytope $P$ is \emph{cohomologically rigid} if its combinatorial structure is determined by the cohomology ring of a quasitoric manifold over $P$. Not every $P$ has this property, but some important polytopes such as…

Algebraic Topology · Mathematics 2014-02-26 Suyoung Choi , Taras Panov , Dong Youp Suh

Let $M$ be a smooth manifold of dimension $n$ embedded in $\mathbb{C}^n$. If $T_pM \subset T_p\mathbb{C}^n$ is a totally real subspace for $p\in M$, then $M$ is locally polynomially convex at $p$. For a generic embedding $M$, we are…

Complex Variables · Mathematics 2025-11-25 Harshith Alagandala

We study structures of embedded projective manifolds swept out by cubic varieties. We show if an embedded projective manifold is swept out by high-dimensional smooth cubic hypersurfaces, then it admits an extremal contraction which is a…

Algebraic Geometry · Mathematics 2011-11-03 Kiwamu Watanabe

A contact projective structure is a contact path geometry the paths of which are among the geodesics of some affine connection. In the manner of T.Y. Thomas there is associated to each contact projective structure an ambient affine…

Differential Geometry · Mathematics 2010-05-10 Daniel J. F. Fox

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…

Differential Geometry · Mathematics 2007-05-23 Jean-Marc Schlenker

A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , David Eppstein , Greg N. Frederickson , Erich Friedman
‹ Prev 1 4 5 6 7 8 10 Next ›