arXiv subjects

Mario Gómez

Publications and source records attributed to Mario Gómez.

8 recordsLinked to original sources

arXiv2026

Probing Synthetic Caroli-de Gennes-Matricon States Through Critical Current in Full-Shell Nanowire Josephson Junctions

Full-shell hybrid nanowires consisting of a semiconductor core fully enveloped by a superconducting shell have emerged as a platform to study Caroli-de Gennes-Matricon (CdGM) analogs. These subgap states can be considered a synthetic version of CdGM states in Abrikosov vortices. Unlike conventional CdGM states, these analogs exhibit a level spacing comparable to the superconducting gap, making them readily observable via tunneling spectroscopy techniques. The spectral density of CdGM analogs follows a characteristic skewed pattern as a function of applied axial magnetic field, an effect that is superimposed on the Little-Parks oscillations of the shell's gap induced by fluxoid quantization. Here, we provide experimental evidence for CdGM analogs through a distinctive skewness fingerprint in the critical current and zero-bias resistance of overdamped Josephson junctions based on full-shell nanowires.

cond-mat.mes-hall↗

arXiv2025

Metrics for Parametric Families of Networks

We introduce a general framework for analyzing data modeled as parameterized families of networks. Building on a Gromov-Wasserstein variant of optimal transport, we define a family of parameterized Gromov-Wasserstein distances for comparing such parametric data, including time-varying metric spaces induced by collective motion, temporally evolving weighted social networks, and random graph models. We establish foundational properties of these distances, showing that they subsume several existing metrics in the literature, and derive theoretical approximation guarantees. In particular, we develop computationally tractable lower bounds and relate them to graph statistics commonly used in random graph theory. Furthermore, we prove that our distances can be consistently approximated in random graph and random metric space settings via empirical estimates from generative models. Finally, we demonstrate the practical utility of our framework through a series of numerical experiments.

stat.ML↗

arXiv2025

Gromov-Hausdorff distances, Borsuk-Ulam theorems, and Vietoris-Rips complexes

We explore emerging relationships between the Gromov--Hausdorff distance, Borsuk--Ulam theorems, and Vietoris--Rips simplicial complexes. The Gromov--Hausdorff distance between two metric spaces $X$ and~$Y$ can be lower bounded by the distortion of (possibly discontinuous) functions between them. The more these functions must distort the metrics, the larger the Gromov--Hausdorff distance must be. Topology has few tools to obstruct the existence of discontinuous functions. However, an arbitrary function $f\colon X\to Y$ induces a continuous map between their Vietoris--Rips simplicial complexes, where the allowable choices of scale parameters depend on how much the function $f$ distorts distances. We can then use equivariant topology to obstruct the existence of certain continuous maps between Vietoris--Rips complexes. With these ideas we bound how discontinuous an odd map between spheres $S^k\to S^n$ with $k>n$ must be, generalizing a result by Dubins and Schwarz (1981), which is the case $k=n+1$. As an application, we recover or improve upon all of the lower bounds from Lim, M{é}moli, and Smith (2022) on the Gromov--Hausdorff distances between spheres of different dimensions. We also provide new upper bounds on the Gromov--Hausdorff distance between spheres of adjacent dimensions.

math.MG↗

arXiv2025

Vietoris-Rips Complexes of Split-Decomposable Spaces

Split-metric decompositions are an important tool in the theory of phylogenetics, particularly because of the link between the tight span and the class of totally decomposable spaces, a generalization of metric trees whose decomposition does not have a ``prime'' component. Their close relationship with trees makes totally decomposable spaces attractive in the search for spaces whose persistent homology can be computed efficiently. We study the subclass of circular decomposable spaces, finite metrics that resemble subsets of $\mathbb{S}^1$ and can be recognized in quadratic time. We give an $O(n^2)$ characterization of the circular decomposable spaces whose Vietoris-Rips complexes are cyclic for all distance parameters, and compute their homotopy type using well-known results on $\mathbb{S}^1$. We extend this result to a recursive formula that computes the homology of certain circular decomposable spaces that fail the previous characterization. Going beyond totally decomposable spaces, we identify an $O(n^3)$ decomposition of $\mathrm{VR}_r(X)$ in terms of the blocks of the tight span of $X$, and use it to induce a direct-sum decomposition of the homology of $\mathrm{VR}_r(X)$.

math.MG↗

arXiv2023

Curvature Sets Over Persistence Diagrams

We study a family of invariants of compact metric spaces that combines the Curvature Sets defined by Gromov in the 1980s with Vietoris-Rips Persistent Homology. For given integers $k\geq 0$ and $n\geq 1$ we consider the dimension $k$ Vietoris-Rips persistence diagrams of \emph{all} subsets of a given metric space with cardinality at most $n$. We call these invariants \emph{persistence sets} and denote them as $\mathbf{D}_{n,k}^\textrm{VR}$. We establish that (1) computing these invariants is often significantly more efficient than computing the usual Vietoris-Rips persistence diagrams, (2) these invariants have very good discriminating power and, in many cases, capture information that is imperceptible through standard Vietoris-Rips persistence diagrams, and (3) they enjoy stability properties. We precisely characterize some of them in the case of spheres and surfaces with constant curvature using a generalization of Ptolemy's inequality. We also identify a rich family of metric graphs for which $\mathbf{D}_{4,1}^\textrm{VR}$ fully recovers their homotopy type by studying split-metric decompositions. Along the way we prove some useful properties of Vietoris-Rips persistence diagrams using Mayer-Vietoris sequences. These yield a geometric algorithm for computing the Vietoris-Rips persistence diagram of a space $X$ with cardinality $2k+2$ with quadratic time complexity as opposed to the much higher cost incurred by the usual algebraic algorithms relying on matrix reduction.

math.AT↗

arXiv2023

Homology groups of the curvature sets of $\mathbb{S}^1$

For $n \geq 2$, the $n$-th curvature set of a metric space $X$ is the set consisting of all $n$-by-$n$ distance matrices of $n$ points sampled from $X$. Curvature sets can be regarded as a geometric analogue of configuration spaces. In this paper we carry out a geometric and topological study of the curvature sets of the unit circle $\mathbb{S}^1$ equipped with the geodesic metric. Via an inductive argument we compute the homology groups of all curvature sets of $\mathbb{S}^1$. We also construct an abstract simplicial complex, called the $n$-th State Complex, whose geometric realization is homeomorphic to the $n$-th Curvature Set of $\mathbb{S}^1$.

math.AT↗

arXiv2023

The Four Point Condition: An Elementary Tropicalization of Ptolemy's Inequality

Ptolemy's inequality is a classic relationship between the distances among four points in Euclidean space. Another relationship between six distances is the 4-point condition, an inequality satisfied by the lengths of the six paths that join any four points of a metric (or weighted) tree. The 4-point condition also characterizes when a finite metric space can be embedded in such a tree. The curious observer might realize that these inequalities have similar forms: if one replaces addition and multiplication in Ptolemy's inequality with maximum and addition, respectively, one obtains the 4-point condition. We show that this similarity is more than a coincidence. We identify a family of Ptolemaic inequalities in CAT-spaces parametrized by a real number and show that a certain limit involving these inequalities, as the parameter goes to negative infinity, yields the 4-point condition, giving an elementary proof that the latter is the tropicalization of Ptolemy's inequality.

math.MG↗

arXiv2016

Group Structures on Families of Subsets of a Group

A binary operation on any set induces a binary operation on its subsets. We explore families of subsets of a group that become a group under the induced operation and refer to such families as power groups of the given group. Our results serve to characterize some types of groups in terms of their power groups. In particular, we consider when the only power groups of a group are the factor groups of its subgroups and when that is the case up to isomorphism. We prove that the former are precisely those groups for which every element has finite order and provide examples to illustrate that the latter is not always the case. In the process we consider several natural questions such as whether the identity element of the group must belong to the identity element of a power group or the inverse of an element in a power group must consist of the inverses of its elements.

math.GR↗