English
Related papers

Related papers: Maximal distance minimizers for a rectangle

200 papers

Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set $X$ is obtained by taking the integer points inside a closed neighborhood of $X$ of a certain…

Discrete Mathematics · Computer Science 2018-08-10 Boris Brimkov , Valentin E. Brimkov

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

Optimization and Control · Mathematics 2019-06-06 Victor Magron , Pierre-Loic Garoche , Didier Henrion , Xavier Thirioux

Minimizers in the least gradient problem with discontinuous boundary data need not be unique. However, all of them have a similar structure of level sets. Here, we give a full characterization of the set of minimizers in terms of any one of…

Analysis of PDEs · Mathematics 2017-09-08 Wojciech Górny

In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…

Metric Geometry · Mathematics 2013-12-10 Zakhar Ovsyannikov

This paper is a continuation of our paper about boundary rigidity and filling minimality of metrics close to flat ones. We show that compact regions close to a hyperbolic one are boundary distance rigid and strict minimal fillings. We also…

Differential Geometry · Mathematics 2019-12-19 Dmitri Burago , Sergei Ivanov

This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued…

Computational Geometry · Computer Science 2008-04-23 M. d'Amico , P. Frosini , C. Landi

This article derives lower bounds on the supremal (strict) p-negative type of finite metric spaces using purely elementary techniques. The bounds depend only on the cardinality and the (scaled) diameter of the underlying finite metric…

Functional Analysis · Mathematics 2008-07-18 Anthony Weston

Rectangles are used to approximate objects, or sets of objects, in a plethora of applications, systems and index structures. Many tasks, such as nearest neighbor search and similarity ranking, require to decide if objects in one rectangle A…

Databases · Computer Science 2020-01-17 Tobias Emrich , Hans-Peter Kriegel , Andreas Züfle , Peer Kröger , Matthias Renz

We prove an $\varepsilon$-regularity theorem at the endpoint of connected arcs for $2$-dimensional Mumford-Shah minimizers. In particular we show that, if in a given ball $B_r (x)$ the jump set of a given Mumford-Shah minimizer is…

Analysis of PDEs · Mathematics 2015-07-08 Camillo De Lellis , Matteo Focardi

Horizonless spacetimes describing spatially regular ultra-compact objects which, like black-hole spacetimes, possess closed null circular geodesics (light rings) have recently attracted much attention from physicists and mathematicians. In…

General Relativity and Quantum Cosmology · Physics 2018-10-17 Shahar Hod

Let $I$ be a homogeneous ideal in a polynomial ring $S$. In this paper, we extend the study of the asymptotic behavior of the minimum distance function $\delta_I$ of $I$ and give bounds for its stabilization point, $r_I$, when $I$ is an…

Commutative Algebra · Mathematics 2020-12-08 Luis Núñez-Betancourt , Yuriko Pitones , Rafael H. Villarreal

A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension of $\Gamma$ is the smallest size of…

Combinatorics · Mathematics 2016-01-07 Robert F. Bailey

Given a compact set $E \subset \mathbb{R}^{d - 1}$, $d \geq 1$, write $K_{E} := [0,1] \times E \subset \mathbb{R}^{d}$. A theorem of C. Bishop and J. Tyson states that any set of the form $K_{E}$ is minimal for conformal dimension: if…

Classical Analysis and ODEs · Mathematics 2018-08-10 David Bate , Tuomas Orponen

The maximal contact symmetry dimensions for scalar ODEs of order $\ge 4$ and vector ODEs of order $\ge 3$ are well known. Using a Cartan-geometric approach, we determine for these ODEs the next largest realizable (submaximal) symmetry…

Differential Geometry · Mathematics 2022-07-12 Johnson Allen Kessy , Dennis The

We consider the question which compact metric spaces can be obtained as a Lipschitz image of the middle third Cantor set, or more generally, as a Lipschitz image of a subset of a given compact metric space. In the general case we prove that…

Classical Analysis and ODEs · Mathematics 2024-04-10 Richárd Balka , Tamás Keleti

In the real-analytic setting, we show that all sub-Riemannian minimizers (parametrized by the arc-length) are real-analytic everywhere except an at most countable non-dense set. In particular, non-analyticity may occur only on a set of…

Metric Geometry · Mathematics 2018-04-10 Paolo Albano , Antonio Bove

In this paper we study the existence of minimizers for interaction energies with the presence of external potentials. We consider a class of subharmonic interaction potentials, which include the Riesz potentials $|{\bf…

Analysis of PDEs · Mathematics 2025-09-11 Ruiwen Shu

Let $\mathbb K$ be a field of characteristic 0. Let $\Gamma\subset\mathbb P^n_{\mathbb K}$ be a reduced finite set of points, not all contained in a hyperplane. Let $hyp(\Gamma)$ be the maximum number of points of $\Gamma$ contained in any…

Commutative Algebra · Mathematics 2012-03-12 Stefan O. Tohaneanu

Let $M$ be a closed Riemannian manifold and let $X\subseteq M$. If the sample $X$ is sufficiently dense relative to the curvature of $M$, then the Gromov-Hausdorff distance between $X$ and $M$ is bounded from below by half their Hausdorff…

Metric Geometry · Mathematics 2025-02-13 Henry Adams , Florian Frick , Sushovan Majhi , Nicholas McBride

Let $G$ be a finite group. A family $\mathcal{M}$ of maximal subgroups of $G$ is called `irredundant' if its intersection is not equal to the intersection of any proper subfamily. $\mathcal{M}$ is called `maximal irredundant' if…

Group Theory · Mathematics 2019-04-10 Martino Garonzi , Andrea Lucchini