English
Related papers

Related papers: Steiner's Invariants and Minimal Connections

200 papers

For a compact subset K of the plane and a point x, we define the visible part of K from x to be the set K_x={u\in K : [x,u]\cap K={u}}. (Here [x,u] denotes the closed line segment joining x to u.) In this paper, we use energies to show that…

Classical Analysis and ODEs · Mathematics 2007-05-23 Toby C O'Neil

In this paper we give necessary and sufficient conditions for a connection in a plane bundle above a surface to be locally metric. These conditions are easy to be verified in any local chart. Also as a global result we give a necessary…

Differential Geometry · Mathematics 2016-09-13 Mihail Cocos

In the semi-discrete version of Monge's problem one tries to find a transport map $T$ with minimum cost from an absolutely continuous measure $\mu$ on $\mathbb{R}^d$ to a discrete measure $\nu$ that is supported on a finite set in…

Numerical Analysis · Mathematics 2017-06-23 Valentin Hartmann

We study the properties of sets $\Sigma$ having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset \mathbb{R}^2$ satisfying the inequality $\mbox{max}_{y \in M}…

Optimization and Control · Mathematics 2017-04-12 Danila Cherkashin , Yana Teplitskaya

In any closed smooth Riemannian manifold of dimension at least three, we use the min-max construction to find anisotropic minimal hyper-surfaces with respect to elliptic integrands, with a singular set of codimension~$2$ vanishing Hausdorff…

Differential Geometry · Mathematics 2024-09-24 Guido De Philippis , Antonio De Rosa , Yangyang Li

Let the circle act effectively in a Hamiltonian fashion on a compact symplectic manifold $(M, \omega)$. Assume that the fixed point set $M^{S^1}$ has exactly two components, $X$ and $Y$, and that $\dim(X) + \dim(Y) +2 = \dim(M)$. We first…

Symplectic Geometry · Mathematics 2017-05-17 Hui Li , Martin Olbermann , Donald Stanley

For a fixed, compactly supported probability measure $\mu$ on the $d$-dimensional space $\mathbb{R}^d$, we consider the problem of minimizing the $p^{\mathrm{th}}$-power average distance functional over all compact, connected $\Sigma…

Optimization and Control · Mathematics 2025-08-12 Lucas O'Brien , Forest Kobayashi , Young-Heon Kim

In this work, we present a method to compute the Kantorovich-Wasserstein distance of order one between a pair of two-dimensional histograms. Recent works in Computer Vision and Machine Learning have shown the benefits of measuring…

Optimization and Control · Mathematics 2019-07-29 Federico Bassetti , Stefano Gualandi , Marco Veneroni

We show that for any connected smooth manifold $M$ of dimension different from $3$ the restriction of the compact-open topology to the diffeomorphism group of $M$ is minimal, i.e. the group does not admit a strictly coarser Hausdorff group…

Geometric Topology · Mathematics 2024-04-17 J. de la Nuez González

We consider the problem of recovering the Riemannian metric on a compact closed manifold from the optimal transport maps when the underlying cost function is the squared Riemann distance. We show that the metric can be uniquely determined…

Analysis of PDEs · Mathematics 2025-11-20 Jian Zhai , Kelvin Shuangjian Zhang

The Milnor degree of a 3-manifold is an invariant that records the maximum simplicity, in terms of higher order linking, of any link in the 3-sphere that can be surgered to give the manifold. This invariant is investigated in the context of…

Geometric Topology · Mathematics 2014-02-26 Tim Cochran , Paul Melvin

The author defines and analyzes the $1/k$ length spectra, $L_{1/k}(M)$, whose union, over all $k\in \NN$ is the classical length spectrum. These new length spectra are shown to converge in the sense that $\lim_{i\to\infty} L_{1/k}(M_i)…

Metric Geometry · Mathematics 2009-09-29 Christina Sormani

We study a model of programmable matter systems consisting of $n$ devices lying on a 2-dimensional square grid which are able to perform the minimal mechanical operation of rotating around each other. The goal is to transform an initial…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-08-23 Matthew Connor , Othon Michail , Igor Potapov

Stone duality is an indispensable tool for the study of compact, zero-dimensional, Hausdorff spaces. In the case of general compact Hausdorff spaces one can get quite a bit of mileage by considering the `Wallman duality' between compact…

Logic · Mathematics 2026-03-12 Ilijas Farah

We present and study a family of metrics on the space of compact subsets of $R^N$ (that we call ``shapes''). These metrics are ``geometric'', that is, they are independent of rotation and translation; and these metrics enjoy many…

Metric Geometry · Mathematics 2018-09-28 A. Duci , A. C. Mennucci

In this paper the notion of modular cone metric space is introduced and some properties of such spaces are investigated. Also we define convex modular cone metric which takes values in CR(Y) where Y is a compact Hausdorff space. Then a…

Functional Analysis · Mathematics 2013-10-15 Saeedeh Shamsi Gamchi , Mohammad Janfada , Asadollah Niknam

In the absence of the Axiom of Choice, necessary and sufficient conditions for a locally compact Hausdorff space to have all non-empty second-countable compact Hausdorff spaces as remainders are given in $\mathbf{ZF}$. Among other…

General Topology · Mathematics 2020-09-22 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

The contribution of this work is twofold. The first part deals with a Hilbert-space version of McCann's celebrated result on the existence and uniqueness of monotone measure-preserving maps: given two probability measures $\rm P$ and $\rm…

Probability · Mathematics 2023-05-23 Alberto González-Sanz , Marc Hallin , Bodhisattva Sen

Given a compact basic semi-algebraic set we provide a numerical scheme to approximate as closely as desired, any finite number of moments of the Hausdorff measure on the boundary of this set. This also allows one to approximate interesting…

Optimization and Control · Mathematics 2020-01-22 Jean-Bernard Lasserre , Victor Magron

In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans all terminals. In this paper we consider the min-power…

Data Structures and Algorithms · Computer Science 2012-05-17 Fabrizio Grandoni