English
Related papers

Related papers: Reeb Posets and Tree Approximations

200 papers

The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…

Optimization and Control · Mathematics 2025-12-19 Daniel Brosch , Diane Puges

We identify a sufficient condition, treewidth-pliability, that gives a polynomial-time algorithm for an arbitrarily good approximation of the optimal value in a large class of Max-2-CSPs parameterised by the class of allowed constraint…

Discrete Mathematics · Computer Science 2024-01-04 Miguel Romero , Marcin Wrochna , Stanislav Živný

Datasets often contain values that naturally reside in a metric space: numbers, strings, geographical locations, machine-learned embeddings in a Euclidean space, and so on. We study the computational complexity of repairing inconsistent…

Databases · Computer Science 2024-09-26 Youri Kaminsky , Benny Kimelfeld , Ester Livshits , Felix Naumann , David Wajc

A real valued function $\varphi$ of one variable is called a metric transform if for every metric space $(X,d)$ the composition $d_\varphi = \varphi\circ d$ is also a metric on $X$. We give a complete characterization of the class of…

Metric Geometry · Mathematics 2018-07-17 George Dragomir , Andrew Nicas

In the present paper we study the original Gromov-Hausdorff distance between real normed spaces. In the first part of the paper we prove that two finite-dimensional real normed spaces on a finite Gromov-Hausdorff distance are isometric to…

Metric Geometry · Mathematics 2024-07-02 I. N. Mikhailov

Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors…

Algebraic Topology · Mathematics 2017-11-01 Killian Meehan , David Meyer

The boundary $\partial X$ of a boundary continuous Gromov hyperbolic space $X$ carries a natural Moebius structure on the boundary. For a proper, geodesically complete, boundary continuous Gromov hyperbolic space $X$, the boundary $\partial…

Metric Geometry · Mathematics 2025-10-30 Kingshook Biswas , Arkajit Pal Choudhury

Let $(R, \sim )$ be the Rado graph, $Emb (R)$ the monoid of its self-embeddings, $\Pi (R)=\{ f[R]: f\in Emb (R)\}$ the set of copies of $R$ contained in $R$, and ${\mathcal I}_R$ the ideal of subsets of $R$ which do not contain a copy of…

Logic · Mathematics 2017-09-26 Miloš S. Kurilić , Stevo Todorčević

Working in the setting of i.i.d. last-passage percolation on $\mathbb{R}^D$ with no assumptions on the underlying edge\hyp{}weight distribution, we arrive at the notion of grid entropy - a Subadditive Ergodic Theorem limit of the entropies…

Probability · Mathematics 2023-12-14 Alexandru Gatea

We give a short and elementary proof of the fact that every metric space of finite asymptotic dimension can be embedded into a finite product of trees.

Metric Geometry · Mathematics 2023-02-22 Daniel Kasprowski

In [9] Kaimanovich introduced the concept of augmented tree on the symbolic space of a self-similar set. It is hyperbolic in the sense of Gromov, and it was shown in [13] that under the open set condition, a self-similar set can be…

Metric Geometry · Mathematics 2013-01-24 Jun Jason Luo , Ka-Sing Lau

We define a norm on the homology of a foliated manifold, which refines and majorizes the usual Gromov norm on homology. This norm depends in an upper semi-continuous way on the underlying foliation, in the geometric topology, and can…

Geometric Topology · Mathematics 2007-05-23 Danny Calegari

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

Combinatorics · Mathematics 2018-02-20 Alex Iosevich , Hans Parshall

We study a finite-field analogue of the Erd\H{o}s distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let $\Delta(S)$ denote the set of Hamming distances determined by \(S\). We prove the lower bound…

Combinatorics · Mathematics 2025-10-14 Nataly Brukhim , Ariel Bruner , Orit E. Raz

We present a streamlined exposition of a construction by R. Chen, A. Poulin, R. Tao, and A. Tserunyan, which proves the treeability of equivalence relations generated by any locally-finite Borel graph such that each component is a…

Logic · Mathematics 2025-04-25 Zhaoshen Zhai

In 2014, Gromov conjectured that sequences of manifolds with nonnegative scalar curvature should have subsequences which converge in some geometric sense to limit spaces with some notion of generalized nonnegative scalar curvature. In…

Metric Geometry · Mathematics 2025-10-28 Christina Sormani , Wenchuan Tian , Wai-Ho Yeung

Set $[n]=\{1, 2, \ldots , n\}$. The hypergrid $[t]^n$ is the collection of functions $f: \ [n]\rightarrow [t]$. We equip it with the natural partial order by letting $f\leq g$ whenever $f(x)\leq g(x)$ holds for all $x\in [n]$. Given a poset…

Combinatorics · Mathematics 2026-04-15 R. Altar Ciceksiz , Victor Falgas-Ravry , Sabrina Lato , Maryam Sharifzadeh

The center of distances of a metric space $(X,d)$ is the set $C(X)$ of all $t\in \mathbb R^+$ for which the equation $d(x,p)=t$ has a solution for each $p\in X$. We prove that the equalities $C(X)=\{0\}$ or $C(X)=\{0,\operatorname{diam}X\}…

General Topology · Mathematics 2026-02-23 Oleksiy Dovgoshey , Olga Rovenska

We study sequences of oriented Riemannian manifolds with boundary and, more generally, integral current spaces and metric spaces with boundary. {\color{blue}For a metric space, we define its boundary to be the completion of the space minus…

Metric Geometry · Mathematics 2021-08-18 Raquel Perales

In the $L_0$ Fitting Tree Metrics problem, we are given all pairwise distances among the elements of a set $V$ and our output is a tree metric on $V$. The goal is to minimize the number of pairwise distance disagreements between the input…

Data Structures and Algorithms · Computer Science 2023-08-01 Evangelos Kipouridis
‹ Prev 1 8 9 10 Next ›