Related papers: Invariants of persistence modules defined by order…

Persistent homology (PH) provides topological descriptors for geometric data, such as weighted graphs, which are interpretable, stable to perturbations, and invariant under, e.g., relabeling. Most applications of PH focus on the…

For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $\Pi^{\bullet}_{\vec{c}}$ is a wedge of spheres of the same dimension with the multiplicity given by the number of permutations with…

In a previous paper we have presented a CEGAR approach for the verification of parameterized systems with an arbitrary number of processes organized in an array or a ring. The technique is based on the iterative computation of parameterized…

A barcode is a finite multiset of intervals on the real line, $B = \{ (b_i, d_i)\}_{i=1}^n$. Barcodes are important objects in topological data analysis, where they serve as summaries of the persistent homology groups of a filtration. The…

We study the problem of topologically order-embedding a given topological poset X in the space of all closed subsets of X which is topologized by the Fell topology and ordered by set inclusion. We show that this can be achieved whenever X…

We study permutation-invariant embeddings of $d$-dimensional point sets, which are defined by sorting $D$ independent one-dimensional projections of the input. Such embeddings arise in graph deep learning where outputs should be invariant…

Time-delay embedding is a fundamental technique in Topological Data Analysis (TDA) for reconstructing the phase space dynamics of time-series data. Persistent homology effectively identifies global topological features, such as loops…

We broaden the scope of quantum field theory by introducing a general class of discrete gauge theories that realize either topological order or fracton behavior across dimensions. We start from translation-invariant systems endowed with…

Bifurcation characterizes the qualitative changes in parameterized dynamical systems and is one of the major topics in the field. In this work, we study combinatorial bifurcations within the framework of combinatorial dynamical systems -- a…

Solving optimization tasks based on functions and losses with a topological flavor is a very active, growing field of research in data science and Topological Data Analysis, with applications in non-convex optimization, statistics and…

We study stable vector bundles over the modular curve X(p) corresponding to the principal congruence subgroup of the modular group of prime level p which are invariant with respect to its automorphism group.

For a topological space $X$ we study continuous maps $f : X\to \mathbb R^m$ such that images of every pairwise distinct $k$ points are affinely (linearly) independent. Such maps are called affinely (linearly) $k$-regular embeddings. We…

Given functors $F,G:\mathcal C\to\mathcal D$ between small categories, when is it possible to say that $F$ can be "continuously deformed" into $G$ in a manner that is not necessarily reversible? In an attempt to answer this question in…

This paper explores how to identify a reduced order model (ROM) from a physical system. A ROM captures an invariant subset of the observed dynamics. We find that there are four ways a physical system can be related to a mathematical model:…

Sequential word order is important when processing text. Currently, neural networks (NNs) address this by modeling word position using position embeddings. The problem is that position embeddings capture the position of individual words,…

The tensor network representation of many-body quantum states, given by local tensors, provides a promising numerical tool for the study of strongly correlated topological phases in two dimension. However, tensor network representations may…

In this paper, we study pointwise finite-dimensional (p.f.d.) $2$-parameter persistence modules where each module admits a finite convex isotopy subdivision. We show that a p.f.d. $2$-parameter persistence module $M$ (with a finite convex…

We show that the model-checking problem for successor-invariant first-order logic is fixed-parameter tractable on graphs with excluded topological subgraphs when parameterised by both the size of the input formula and the size of the…

Pretrained encoders for mathematical texts have achieved significant improvements on various tasks such as formula classification and information retrieval. Yet they remain limited in representing and capturing student strategies for entire…

In this paper, we propose a simple yet effective method to endow deep 3D models with rotation invariance by expressing the coordinates in an intrinsic frame determined by the object shape itself. Key to our approach is to find such an…