English
Related papers

Related papers: Convexity, critical points, and connectivity radiu…

200 papers

We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…

Computational Complexity · Computer Science 2023-11-16 Anindya De , Shivam Nadimpalli , Rocco A. Servedio

A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…

Metric Geometry · Mathematics 2019-08-26 Anthony Nixon , Stephen Power

We study a problem of minimal surfaces with free boundary written in the form of a non convex minimization problem. Our aim is to characterize optimal solutions by finding a suitable calibration field. A natural upper bound of the infimum…

Analysis of PDEs · Mathematics 2025-11-06 Guy Bouchitté , Minh Phan

We study open point sets in Euclidean spaces $\mathbb{R}^d$ without a pair of points an integral distance apart. By a result of Furstenberg, Katznelson, and Weiss such sets must be of Lebesgue upper density zero. We are interested in how…

Metric Geometry · Mathematics 2015-03-20 Sascha Kurz , Valery Mishkin

Spatially embedded networks are important in several disciplines. The prototypical spatial net- work we assume is the Random Geometric Graph of which many properties are known. Here we present new results for the two-point degree…

Statistical Mechanics · Physics 2013-03-21 Alberto Antonioni , Marco Tomassini

The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the image of a non-closed geodesic has 0 distance from the set of conical points.…

Geometric Topology · Mathematics 2016-03-08 Charalampos Charitos , Ioannis Papadoperakis , Georgios Tsapogas

This paper treats the variation of sets. We attempt to formulate convergence and continuity of set-valued functions in a different way from the theories on sequences of sets and correspondence. In the final section, we also attempt to…

Functional Analysis · Mathematics 2020-03-24 Takefumi Fujimoto

Convexity properties of Weil-Petersson geodesics on the Teichm\"{u}ller space of punctured Riemann surfaces are investigated. A normal form is presented for the Weil-Petersson Levi-Civita connection for pinched hyperbolic metrics. The…

Differential Geometry · Mathematics 2007-09-18 Scott A. Wolpert

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

Optimization and Control · Mathematics 2017-01-03 Alexander Weber , Gunther Reissig

A smooth function of the second moments of $N$ continuous variables gives rise to an uncertainty relation if it is bounded from below. We present a method to systematically derive such bounds by generalizing an approach applied previously…

Quantum Physics · Physics 2016-10-18 Spiros Kechrimparis , Stefan Weigert

Recent literature has shown that symbolic data, such as text and graphs, is often better represented by points on a curved manifold, rather than in Euclidean space. However, geometrical operations on manifolds are generally more complicated…

Machine Learning · Computer Science 2019-02-06 Max Aalto , Nakul Verma

In general, the critical points of the distance function $d_{\mathsf{M}}$ to a compact submanifold $\mathsf{M} \subset \mathbb{R}^D$ can be poorly behaved. In this article, we show that this is generically not the case by listing regularity…

Differential Geometry · Mathematics 2024-05-24 Charles Arnal , David Cohen-Steiner , Vincent Divol

We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…

Optimization and Control · Mathematics 2007-05-23 Hans J. H. Tuenter

The study of rational point sets on circles over the Euclidean plane is discussed in a more general framework, i.e. we generalize the notion rational and consider these circular point sets over arbitrary fields. We also determine the…

Combinatorics · Mathematics 2024-11-04 Chris Busenhart

In this work we investigate Gromov-Hausdorff limits of compact surfaces carrying length metrics. More precisely, we consider the case where all surfaces have the same Euler characteristic. We give a complete description of the limit spaces…

Metric Geometry · Mathematics 2024-07-03 Tobias Dott

The g-convexity of functions on manifolds is a generalization of the convexity of functions on Rn. It plays an essential role in both differential geometry and non-convex optimization theory. This paper is concerned with g-convex smooth…

Differential Geometry · Mathematics 2024-09-24 Yu Wang , Ke Ye

The (delta-) normal cone to an arbitrary intersection of sublevel sets of proper, lower semicontinuous, and convex functions is characterized, using either epsilon-subdifferentials at the nominal point or exact subdifferentials at nearby…

Optimization and Control · Mathematics 2017-10-30 Abderrahim Hantoute , Anton Svensson

In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…

Probability · Mathematics 2022-10-24 Arturo Jaramillo , James Melbourne

In this paper, we focus on a generalised version of Gabriel graphs known as Locally Gabriel graphs ($LGGs$) and Unit distance graphs ($UDGs$) on convexly independent point sets. $UDGs$ are sub graphs of $LGGs$. We give a simpler proof for…

Discrete Mathematics · Computer Science 2017-04-24 Abhijeet Khopkar

This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented,…

Combinatorics · Mathematics 2025-02-20 A. R. Akhiiarov , A. V. Bobu , A. M. Raigorodskii