Searcharxiv⌕ Search

arXiv subjects

Eugenio Borghini

Publications and source records attributed to Eugenio Borghini.

5 recordsLinked to original sources

Intrinsic persistent homology via density-based metric learning

We address the problem of estimating topological features from data in high dimensional Euclidean spaces under the manifold assumption. Our approach is based on the computation of persistent homology of the space of data points endowed with a sample metric known as Fermat distance. We prove that such metric space converges almost surely to the manifold itself endowed with an intrinsic metric that accounts for both the geometry of the manifold and the density that produces the sample. This fact implies the convergence of the associated persistence diagrams. The use of this intrinsic distance when computing persistent homology presents advantageous properties such as robustness to the presence of outliers in the input data and less sensitiveness to the particular embedding of the underlying manifold in the ambient space. We use these ideas to propose and implement a method for pattern recognition and anomaly detection in time series, which is evaluated in applications to real data.

stat.ML↗

A systolic inequality for 2-complexes of maximal cup-length and systolic area of groups

We extend a systolic inequality of Guth for Riemannian manifolds of maximal $\mathbb{Z}_2$ cup-length to piecewise Riemannian complexes of dimension 2. As a consequence we improve the previous best universal lower bound for the systolic area of groups for a large class of groups, including free abelian and surface groups, most of irreducible 3-manifold groups, non-free Artin groups and Coxeter groups (or more generally), groups containing an element of order 2.

math.GT↗

Simplicial complexity of surface groups and systolic area

The simplicial complexity is an invariant for finitely presentable groups that was recently introduced by Babenko, Balacheff and Bulteau to study systolic area. The simplicial complexity $κ(G)$ was proved to be a good approximation of the systolic area $σ(G)$ for large values of $κ(G)$. In this paper we compute the simplicial complexity of all surface groups (both in the orientable and in the non-orientable case). This settles a problem raised by Babenko, Balacheff and Bulteau. We also prove that $κ(G\ast \mathbb{Z})=κ(G)$ for any surface group $G$. This provides the first partial evidence in favor of the conjecture of the stability of the simplicial complexity under free product with free groups. The general stability problem, both for simplicial complexity and for systolic area, remains open.

math.GT↗

Some remarks on PL collapsible covers of 2-dimensional polyhedra

We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the union of two PL collapsible subpolyhedra in terms of their simple homotopy type and certain local properties. In the process, a special class of polyhedra of dimension 2 appears naturally. We give a combinatorial description of the spaces in this class, which includes all closed surfaces and the complexes associated to one-relator presentations.

math.GT↗

The covering type of closed surfaces and minimal triangulations

The notion of covering type was recently introduced by Karoubi and Weibel to measure the complexity of a topological space by means of good coverings. When X has the homotopy type of a finite CW-complex, its covering type coincides with the minimum possible number of vertices of a simplicial complex homotopy equivalent to X. In this article we compute the covering type of all closed surfaces. Our results completely settle a problem posed by Karoubi and Weibel, and shed more light on the relationship between the topology of surfaces and the number of vertices of minimal triangulations from a homotopy point of view.

math.GT↗