English
Related papers

Related papers: Facial structure of strongly convex sets generated…

200 papers

Choose n random, independent points in R^d according to a fixed distribution. The convex hull of these points is a random polytope. In some cases, central limit theorems have been proven for the components of f-vectors of random polytopes…

Metric Geometry · Mathematics 2011-09-22 Sang Du , Mark Syvuk

We introduce K-deformations of generalized complex structures on a compact Kahler manifold $M=(X, J)$ with an effective anti-canonical divisor and show that obstructions to K-deformations of generalized complex structures on $M$ always…

Differential Geometry · Mathematics 2012-07-30 Ryushi Goto

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

Metric Geometry · Mathematics 2020-07-16 Arseniy Akopyan , Herbert Edelsbrunner , Anton Nikitenko

We answer a question of Banakh, Jab\l{}o\'nska and Jab\l{}o\'nski by showing that for $d\ge 2$ there exists a compact set $K \subseteq \mathbb{R}^d$ such that the projection of $K$ onto each hyperplane is of non-empty interior, but $K+K$ is…

Classical Analysis and ODEs · Mathematics 2023-08-07 Richárd Balka , Márton Elekes , Viktor Kiss , Donát Nagy , Márk Poór

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

Combinatorics · Mathematics 2019-09-16 Toshinori Sakai , Jorge Urrutia

We investigate the asymptotic properties of random polytopes arising as convex hulls of $n$ independent random points sampled from a family of block-beta distributions. Notably, this family includes the uniform distribution on a product of…

Probability · Mathematics 2024-12-02 Florian Besau , Anna Gusakova , Christoph Thäle

Let $K \subset \mathbb R^n$ be a convex body with barycenter at the origin. We show there is a simplex $S \subset K$ having also barycenter at the origin such that $\left(\frac{vol(S)}{vol(K)}\right)^{1/n} \geq \frac{c}{\sqrt{n}},$ where…

Metric Geometry · Mathematics 2019-07-18 Daniel Galicer , Mariano Merzbacher , Damián Pinasco

A family of $k$ point sets in $d$ dimensions is well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. Well-separation is a strong assumption that allows us to conclude that certain kinds of…

Computational Geometry · Computer Science 2022-09-07 Helena Bergold , Daniel Bertschinger , Nicolas Grelier , Wolfgang Mulzer , Patrick Schnider

We study density estimation in Kullback-Leibler divergence: given an i.i.d. sample from an unknown density $p^\star$, the goal is to construct an estimator $\widehat{p}$ such that $\mathrm{KL}(p^\star,\widehat{p})$ is small with high…

Statistics Theory · Mathematics 2026-04-03 Spencer Compton , Gábor Lugosi , Jaouad Mourtada , Jian Qian , Nikita Zhivotovskiy

We analyze the facial structures of the convex set consisting of all two qubit separable states. One of faces is a four dimensional convex body generated by the trigonometric moment curve arising from polyhedral combinatorics. Another one…

Quantum Physics · Physics 2014-09-11 Seung-Hyeok Kye

Assume $K$ is a convex body in $R^d$, and $X$ is a (large) finite subset of $K$. How many convex polytopes are there whose vertices come from $X$? What is the typical shape of such a polytope? How well the largest such polytope (which is…

Combinatorics · Mathematics 2007-05-23 Imre Bárány

Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as…

Probability · Mathematics 2019-08-13 Gilles Bonnet , Eliza O'Reilly

We prove power series expansions for the expectations of the number of vertices and missed area of random $L$-convex polygons in planar convex bodies with sufficiently smooth boundaries. Random $L$-convex polygons arise as the intersection…

Metric Geometry · Mathematics 2025-09-16 Ferenc Fodor , Dániel I. Papvári

This paper describes a new link between combinatorial number theory and geometry. The main result states that A is a finite set of relatively prime positive integers if and only if A = (K-K) \cap N, where K is a compact set of real numbers…

Number Theory · Mathematics 2017-10-16 Melvyn B. Nathanson

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

Algebraic Geometry · Mathematics 2024-10-15 Claus Scheiderer

We construct a higher Whitehead torsion map, using algebraic K-theory of spaces, and show that it satisfies the usual properties of the classical Whitehead torsion. This is used to describe a "geometric assembly map" defined on stabilized…

K-Theory and Homology · Mathematics 2014-02-26 Wolfgang Steimle

We prove that if $K$ is a compact subset of an affine variety O = P^n - D (where D is a projective hypersuface), and if K is a compact subset of a closed analytic subvariety V \subset O, then the projective hull K^ of K has the property…

Complex Variables · Mathematics 2007-05-23 Blaine Lawson , John Wermer

In the paper we prove a factorization theorem for representations of fundamental groups of compact K\"{a}hler manifolds ({\em K\"{a}hler groups}) into solvable matrix groups. We apply this result to prove that the universal covering of a…

Complex Variables · Mathematics 2007-05-23 Alexander Brudnyi

Given a subset $A$ of $\mathbb{R}^n$, we define \begin{align*} \mathrm{conv}_k(A) := \left\{ \lambda_1 s_1 + \cdots + \lambda_k s_k : \lambda_i \in [0,1], \sum_{i=1}^k \lambda_i = 1 , s_i \in A \right\} \end{align*} to be the set of vectors…

Metric Geometry · Mathematics 2025-05-29 Samuel G. G. Johnston

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…

Computational Geometry · Computer Science 2010-07-22 Oswin Aichholzer , Franz Aurenhammer , Erik D. Demaine , Ferran Hurtado , Pedro Ramos , Jorge Urrutia
‹ Prev 1 3 4 5 6 7 10 Next ›