English
Related papers

Related papers: Rational Maps and Boundaries of Convex Hulls

200 papers

Let $A$ be a unital separable simple $C^*$-algebra with tracial rank zero and let $x, \, y\in A$ be two normal elements. We show that $x$ is in the closure of the convex full of the unitary obit of $y$ if and only if there exists a sequence…

Operator Algebras · Mathematics 2018-05-17 Shanwen Hu , Huaxin Lin

Using elementary duality properties of positive semidefinite moment matrices and polynomial sum-of-squares decompositions, we prove that the convex hull of rationally parameterized algebraic varieties is semidefinite representable (that is,…

Optimization and Control · Mathematics 2011-01-31 Didier Henrion

We study the convex hull of the graph of a quadratic function $f(\mathbf{x})=\sum_{ij\in E}x_ix_j$, where the sum is over the edge set of a graph $G$ with vertex set $\{1,\dots,n\}$. Using an approach proposed by Gupte et al. (Discrete…

Optimization and Control · Mathematics 2020-07-14 Mitchell Harris , Thomas Kalinowski

We give the first differentially private algorithms that estimate a variety of geometric features of points in the Euclidean space, such as diameter, width, volume of convex hull, min-bounding box, min-enclosing ball etc. Our work relies…

Data Structures and Algorithms · Computer Science 2025-12-29 Yue Gao , Or Sheffet

We establish an exact formula for the average number of edges appearing on the boundary of the global convex hull of n independent Brownian paths in the plane. This requires the introduction of a counting criterion which amounts to "cutting…

Statistical Mechanics · Physics 2012-12-10 Julien Randon-Furling

A set in the Euclidean plane is said to be biconvex if, for some angle $\theta\in[0,\pi/2)$, all its sections along straight lines with inclination angles $\theta$ and $\theta+\pi/2$ are convex sets (i.e, empty sets or segments).…

Statistics Theory · Mathematics 2020-06-23 Alejandro Cholaquidis , Antonio Cuevas

Suppose that $f_1,\ldots ,f_m : S(V)\to R$ are $m$ ($\geq 1$) continuous functions defined on the unit sphere in a Euclidean vector space $V$ of dimension $m+1$ satisfying $f_i(-v)=-f_i(v)$ for all $v\in S(V)$. The classical Borsuk-Ulam…

Algebraic Topology · Mathematics 2024-01-05 M. C. Crabb

We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a set of $n$ points in $\mathbb{R}^{2}$. A point lies on the convex hull of a point set $S$ if it lies on the…

Computational Geometry · Computer Science 2013-07-24 Jatin Agarwal , Nadeem Moidu , Kishore Kothapalli , Kannan Srinathan

We prove that, for every norm on $\mathbb{R}^d$ and every $E \subseteq \mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\dim_{\mathrm{H}} E - (d-1)$. An explicit construction follows,…

Classical Analysis and ODEs · Mathematics 2024-11-05 Iqra Altaf , Ryan Bushling , Bobby Wilson

A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…

Computational Geometry · Computer Science 2016-05-02 P. Wiederhold , H. Reyes

The H-unistochastic matrices are a special class of symmetric bistochastic matrices obtained by taking the square of the absolute value of each entry of a Hermitian unitary matrix. We examine the geometric relationship of the convex hull of…

Operator Algebras · Mathematics 2012-11-14 Corey O'Meara , Rajesh Pereira

The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…

Algebraic Geometry · Mathematics 2011-01-19 Kristian Ranestad , Bernd Sturmfels

We introduce a new stable mathematical model for locating and measuring the medial axis of geometric objects, called the quadratic multiscale medial axis map of scale $\lambda$, and prove a sharp regularity result for the squared-distance…

Metric Geometry · Mathematics 2015-08-25 Kewei Zhang , Elaine Crooks , Antonio Orlando

Given a set $\Sigma$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $\rho_1,\rho_2,...,\rho_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(\Sigma)$ of…

Computational Geometry · Computer Science 2011-06-14 Menelaos I. Karavelas , Eleni Tzanaki

Imprecise measurements of a point set P = (p1, ..., pn) can be modelled by a family of regions F = (R1, ..., Rn), where each imprecise region Ri contains a unique point pi. A retrieval models an accurate measurement by replacing an…

Computational Geometry · Computer Science 2025-12-09 Sarita de Berg , Ivor van der Hoog , Eva Rotenberg , Daniel Rutschmann , Sampson Wong

In this paper, we study closed convex hulls of unitary orbits in various C$^*$-algebras. For unital C$^*$-algebras with real rank zero and a faithful tracial state determining equivalence of projections, a notion of majorization describes…

Operator Algebras · Mathematics 2016-09-08 Paul Skoufranis

The standard convex closed hull of a set is defined as the intersection of all images, under the action of a group of rigid motions, of a half-space containing the given set. In this paper we propose a generalisation of this classical…

Metric Geometry · Mathematics 2024-09-04 Zakhar Kabluchko , Alexander Marynych , Ilya Molchanov

The notion of a linear Coxeter system introduced by Vinberg generalizes the geometric representation of a Coxeter group. Our main theorem asserts that if $v$ is an element of the Tits cone of a linear Coxeter system and $\cW$ is the…

Representation Theory · Mathematics 2012-04-11 Georg Hofmann , Karl-Hermann Neeb

Suppose $d+1$ absolutely continuous probability measures $m_0, \ldots, m_d$ on $\mathbb{R}^d$ are given. In this paper, we prove that there exists a point of $\mathbb{R}^d$ that belongs to the convex hull of $d+1$ points $v_0, \ldots, v_d$…

Combinatorics · Mathematics 2020-06-03 Zilin Jiang

Finding the coordinate-wise maxima and the convex hull of a planar point set are probably the most classic problems in computational geometry. We consider these problems in the self-improving setting. Here, we have $n$ distributions…

Computational Geometry · Computer Science 2014-04-29 Kenneth L. Clarkson , Wolfgang Mulzer , C. Seshadhri
‹ Prev 1 4 5 6 7 8 10 Next ›