Searcharxiv⌕ Search

arXiv subjects

Aldo Guzmán-Sáenz

Publications and source records attributed to Aldo Guzmán-Sáenz.

12 recordsLinked to original sources

The gold partition conjecture and the Lexicographic sum of posets

We prove that if a finite poset $Q$ satisfies the Gold Partition Conjecture, and $P$ is a finite poset, then for any $i\in P$ the lexicographic sum $P\circ_iQ$ of $P$ with $Q$ on the point $i$, satisfies the Gold Partition Conjecture. Let $L(P)$ be the set of linearizations of $P$, $e(P)=\#L(P)$, $ \mathbb{P}(x<y)=\frac{\#\{f\in L(P)|x<_f y\}|}{e(P)}$, and $δ(P)=\max_{x,y\in P}\min\{\mathbb{P}(x<y),$ $\mathbb{P}(y<x)\}$. We describe the behavior of those numbers when $P$ is a lexicographic sum. Namely, $\prod_{i=1}^n e(Q_i)\,$ divides $\,e(P( Q_1,\dots,Q_{|P|}))$, and $δ(P(Q_1,\dots,Q_n))\geq \max_{1\leq i\leq n}\{ δ(Q_i)\}$.

math.CO↗

Knots, black holes, databases, and birthdays: Collision entropy of knot invariants

A knot invariant is a fingerprint shared by equivalent knots: unequal values certify inequivalence, while equal values may conceal different knots. Under two rooted random-diagram models, we prove that the incomplete normalized Alexander polynomial separates random pairs but collides in a growing database. If $D_n$ and $D_n'$ are independent $n$-crossing diagrams, then $\Pr\{Δ_{K(D_n)}=Δ_{K(D_n')}\}=O(n^{-1/2})$, and every fixed normalized Alexander polynomial is exponentially rare. With exponentially high probability, the diagram shadow contains linearly many disjoint opened-trefoil slots. Conditional on the shadow and exterior crossing signs, their indicators are independent Bernoulli$(1/4)$ variables whose sum is a binomial coordinate in the $3$-adic determinant valuation. Consequently, $\sup_{a\geq 1}\Pr\{\det K(D_n)=a\}=O(n^{-1/2})$. For a discrete invariant $I$, let $α_n(I)=\Pr\{I(D_n)=I(D_n')\}$. Its collision entropy is $H_2(I(D_n))=-\logα_n(I)$. An independent sample of size $M$ has $\binom{M}{2}α_n(I)$ colliding pairs on average and birthday scale $α_n(I)^{-1/2}$. If $M_n^2α_n(I)\to\infty$, a repeated value occurs with probability tending to one even when $α_n(I)\to0$. For the determinant, $M=o(n^{1/4})$ suffices for collision freedom with high probability; a matching lower bound is open. We also give exact finite-population formulas for fixed censuses, calculate the expected cost of invariant cascades, and relate collision probability to the frequency of calls to a complete equivalence procedure. On a balanced pair-classification benchmark, the normalized-Alexander rule has balanced accuracy $1-O(n^{-1/2})$ but cannot distinguish inequivalent pairs in one fiber.

math.GT↗

Essential Simplices Dominate in Harmonic Representatives of One-Dimensional Persistent Classes

Persistent homology summarizes the birth and death of topological features, but it does not by itself specify where a feature is located in the underlying complex. Harmonic persistent homology addresses this by assigning canonical harmonic cycle representatives to bars. In earlier work, Basu and Cox showed that harmonic representatives of simple bars maximize the total relative weight placed on essential simplices, the simplices that are forced to appear in representatives of the corresponding class. In this paper we prove that, for generic one-dimensional bars, this preference is stronger than an aggregate maximization statement. Every essential edge has strictly larger coefficient, in absolute value, than every non-essential edge in the harmonic representative, and the absolute values of the coefficients of all essential edges are equal. The key argument is a finite-dimensional variational characterization of the harmonic representative as a minimum-norm chain with prescribed boundary, combined with an elementary graph-theoretic cut argument. We then prove that the result is special to dimension one. In higher dimensions, the analogous coefficient-wise dominance statement fails. We give examples to show that harmonic representatives can place larger coefficients on non-essential higher-dimensional simplices than on essential ones. These results clarify both the power and the limitations of using harmonic representatives to assign geometric significance to simplices in persistent homology.

math.AT↗

TopoX: A Suite of Python Packages for Machine Learning on Topological Domains

We introduce TopoX, a Python software suite that provides reliable and user-friendly building blocks for computing and machine learning on topological domains that extend graphs: hypergraphs, simplicial, cellular, path and combinatorial complexes. TopoX consists of three packages: TopoNetX facilitates constructing and computing on these domains, including working with nodes, edges and higher-order cells; TopoEmbedX provides methods to embed topological domains into vector spaces, akin to popular graph-based embedding algorithms such as node2vec; TopoModelX is built on top of PyTorch and offers a comprehensive toolbox of higher-order message passing functions for neural networks on topological domains. The extensively documented and unit-tested source code of TopoX is available under MIT license at https://pyt-team.github.io/}{https://pyt-team.github.io/.

cs.LG↗

Probing omics data via harmonic persistent homology

Identifying molecular signatures from complex disease patients with underlying symptomatic similarities is a significant challenge in the analysis of high dimensional multi-omics data. Topological data analysis (TDA) provides a way of extracting such information from the geometric structure of the data and identifying multiway higher-order relationships. Here, we propose an application of Harmonic persistent homology, which overcomes the limitations of ambiguous assignment of the topological information to the original elements in a representative topological cycle from the data. When applied to multi-omics data, this leads to the discovery of hidden patterns highlighting the relationships between different omic profiles, while allowing for common tasks in multi-omics analyses, such as disease subtyping, and most importantly biomarker identification for similar latent biological pathways that are associated with complex diseases. Our experiments on multiple cancer data show that harmonic persistent homology effectively dissects multi-omics data to identify biomarkers by detecting representative cycles predictive of disease subtypes.

q-bio.GN↗

ICML 2023 Topological Deep Learning Challenge : Design and Results

This paper presents the computational challenge on topological deep learning that was hosted within the ICML 2023 Workshop on Topology and Geometry in Machine Learning. The competition asked participants to provide open-source implementations of topological neural networks from the literature by contributing to the python packages TopoNetX (data processing) and TopoModelX (deep learning). The challenge attracted twenty-eight qualifying submissions in its two-month duration. This paper describes the design of the challenge and summarizes its main findings.

cs.LG↗

Topo-MLP : A Simplicial Network Without Message Passing

Due to their ability to model meaningful higher order relations among a set of entities, higher order network models have emerged recently as a powerful alternative for graph-based network models which are only capable of modeling binary relationships. Message passing paradigm is still dominantly used to learn representations even for higher order network models. While powerful, message passing can have disadvantages during inference, particularly when the higher order connectivity information is missing or corrupted. To overcome such limitations, we propose Topo-MLP, a purely MLP-based simplicial neural network algorithm to learn the representation of elements in a simplicial complex without explicitly relying on message passing. Our framework utilizes a novel Higher Order Neighborhood Contrastive (HONC) loss which implicitly incorporates the simplicial structure into representation learning. Our proposed model's simplicity makes it faster during inference. Moreover, we show that our model is robust when faced with missing or corrupted connectivity structure.

cs.LG↗

Combinatorial Complexes: Bridging the Gap Between Cell Complexes and Hypergraphs

Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively represent the complex relations found in high-dimensional data. Such higher-order domains are typically modeled either as hypergraphs, or as simplicial, cubical or other cell complexes. In this context, cell complexes are often seen as a subclass of hypergraphs with additional algebraic structure that can be exploited, e.g., to develop a spectral theory. In this article, we promote an alternative perspective. We argue that hypergraphs and cell complexes emphasize \emph{different} types of relations, which may have different utility depending on the application context. Whereas hypergraphs are effective in modeling set-type, multi-body relations between entities, cell complexes provide an effective means to model hierarchical, interior-to-boundary type relations. We discuss the relative advantages of these two choices and elaborate on the previously introduced concept of a combinatorial complex that enables co-existing set-type and hierarchical relations. Finally, we provide a brief numerical experiment to demonstrate that this modelling flexibility can be advantageous in learning tasks.

cs.LG↗

Topological Deep Learning: Going Beyond Graph Data

Topological deep learning is a rapidly growing field that pertains to the development of deep learning models for data supported on topological domains such as simplicial complexes, cell complexes, and hypergraphs, which generalize many domains encountered in scientific computations. In this paper, we present a unifying deep learning framework built upon a richer data structure that includes widely adopted topological domains. Specifically, we first introduce combinatorial complexes, a novel type of topological domain. Combinatorial complexes can be seen as generalizations of graphs that maintain certain desirable properties. Similar to hypergraphs, combinatorial complexes impose no constraints on the set of relations. In addition, combinatorial complexes permit the construction of hierarchical higher-order relations, analogous to those found in simplicial and cell complexes. Thus, combinatorial complexes generalize and combine useful traits of both hypergraphs and cell complexes, which have emerged as two promising abstractions that facilitate the generalization of graph neural networks to topological spaces. Second, building upon combinatorial complexes and their rich combinatorial and algebraic structure, we develop a general class of message-passing combinatorial complex neural networks (CCNNs), focusing primarily on attention-based CCNNs. We characterize permutation and orientation equivariances of CCNNs, and discuss pooling and unpooling operations within CCNNs in detail. Third, we evaluate the performance of CCNNs on tasks related to mesh shape analysis and graph learning. Our experiments demonstrate that CCNNs have competitive performance as compared to state-of-the-art deep learning models specifically tailored to the same tasks. Our findings demonstrate the advantages of incorporating higher-order relations into deep learning models in different applications.

cs.LG↗

Self-Organized Criticality and Pattern Emergence through the lens of Tropical Geometry

Tropical Geometry, an established field in pure mathematics, is a place where String Theory, Mirror Symmetry, Computational Algebra, Auction Theory, etc, meet and influence each other. In this paper, we report on our discovery of a tropical model with self-organized criticality (SOC) behavior. Our model is continuous, in contrast to all known models of SOC, and is a certain scaling limit of the sandpile model, the first and archetypical model of SOC. We describe how our model is related to pattern formation and proportional growth phenomena, and discuss the dichotomy between continuous and discrete models in several contexts. Our aim in this context is to present an idealized tropical toy-model (cf. Turing reaction-diffusion model), requiring further investigation.

nlin.AO↗

The stability of the higher topological complexity of real projective spaces: an approach to their immersion dimension

The $s$-th higher topological complexity of a space $X$, $TC_s(X)$, can be estimated from above by homotopical methods, and from below by homological methods. We give a thorough analysis of the gap between such estimates when $X=RP^m$, the real projective space of dimension $m.$ In particular, we describe a number $r(m)$, which depends on the structure of zeros and ones in the binary expansion of $m$, and with the property that $TC_s(RP^m)$ is given by $sm$ with an error of at most one provided $s \geq r(m)$ and $m \not\equiv 3 \bmod 4$ (the error vanishes for even $m$). The latter fact appears to be closely related to the estimation of the Euclidean immersion dimension of $RP^m$. We illustrate the phenomenon in the case $m=3 \cdot 2^a$.

math.AT↗

The cohomology ring away from 2 of configuration spaces on real projective spaces

Let R be a commutative ring containing 1/2. We compute the R-cohomology ring of the configuration space F(m,k) of k ordered points in the m-dimensional real projective space. The method uses the observation that the orbit configuration space of k ordered points in the m-dimensional sphere (with respect to the antipodal action) is a 2^k-fold covering of F(m,k). This implies that, for odd m, the Leray spectral sequence for the inclusion of F(m,k) in the k-fold Cartesian self power of the m-dimensional real projective space collapses after its first non-trivial differential, just as it does when the projective space is replaced by a complex projective variety. The method also allows us to handle the R-cohomology ring of the configuration space of k ordered points in a punctured real projective space. Lastly, we compute the Lusternik-Schnirelmann category and all of the higher topological complexities of some of the auxiliary orbit configuration spaces.

math.AT↗