arXiv research

Z-GCNETs uses topological data to improve time series forecasting.

TabPFN's internal geometry topology correlates with dataset reliability.

The paper characterizes Conway-Coxeter friezes using rational links.

A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on opposite edges. A graph without a railroad is called tight. We consider the zigz…

Study Lagrangian zigzag cobordisms for Legendrian knots, comparing to smooth concordance.

Zigzag sampling algorithm efficiently samples from strongly log-concave distributions with low computational cost.

The study explores cohomological invariants and decomposes them into irreducible parts, focusing on zigzags.

We construct an action of the free group $F_n$ on the homotopy category of projective modules over a finite dimensional zigzag algebra. The main theorem in the paper is that this action is faithful. We describe the relationship between homotopy classes of paths in the punctured disc and complexes of projective zigzag m…

We construct a finite dimensional quiver algebra from the non-simply laced type $B$ Dynkin diagram, which we call the type $B$ zigzag algebra. This leads to a faithful categorical action of the type $B$ braid group $\mathcal{A}(B)$, acting on the homotopy category of its projective modules. This categorical action is a…

We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. Subsequently, in Section 3 we enumerate all possible symmetry groups of the spheres that showed up. In Section 4 we introduce a new Goldberg-…

In this paper, a new higher Hochschild Complex is defined with an Iterated Integral map to locally model differential forms on the space of bigons on $M$. In particular, given the local data for a gerbe with structure 2-group given by a crossed module of matrix-groups, there is an element in our curved zigzag Hochschil…

A zigzag in a map (a $2$-cell embedding of a connected graph in a connected closed $2$-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a common vertex, 2) for any three consecutive edges the first and the third edges are …

Study cohomology of Bigolin complex on complex manifolds.

New categorical actions link topological and algebraic structures.

We give a simple proof of the Emch closing theorem by introducing a new invariant measure on the circle. Special cases of that measures are well-known and have been used in the literature to prove Poncelet's and Zigzag theorems. Some further generalizations are also obtained by applying the new measure.

In the present paper, we build a bridge between Conway-Coxeter friezes and rational tangles through the Kauffman bracket polynomials. One can compute a Kauffman bracket polynomials attached to rational links by using Conway-Coxeter friezes. As an application one can give a complete invariant on Conway-Coxeter friezes o…

We determine all critical configurations for the Area function on polygons with vertices on a circle or an ellipse. For isolated critical points we compute their Morse index, resp index of the gradient vector field. We relate the computation at an isolated degenerate point to an eigenvalue question about combinations. …

Approaches for approximating persistent homology for large datasets.

Persistence landscapes map persistence diagrams into a function space, which may often be taken to be a Banach space or even a Hilbert space. In the latter case, it is a feature map and there is an associated kernel. The main advantage of this summary is that it allows one to apply tools from statistics and machine lea…

Proposes deep graph persistence to address neural persistence issues in deep learning.

Paper proves $k$-means clustering works on persistence diagrams.

Formula for interleaving distance of rectangle persistence modules.

This paper demonstrates the flaws of co-persistence theory proposed by Bollerslev and Engle (1993) which cause the theory can hardly be applied. With the introduction of the half-life of decay coefficient as the measure of the persistence, and both the weak definition of persistence and co-persistence in variance, this…

Optimizes wavelets for graph classification using spectral wavelet signatures and persistence diagrams.

New method for analyzing multiparameter persistence modules from smooth functions.

Develops robust persistence diagrams using kernel methods.

This paper interprets critical scales in persistent homology for compact metric spaces.

MuRiT efficiently computes multi-parameter persistence barcodes.

Complete classification of rod complements in 3-torus using topology.

Persistent homology can recognize knotting in curves.

This article analyzes the relationship between co-persistence and hedging which indicates co-persistence ratio is just the long-term hedging ratio. The new method of exhaustive search algorithm for deriving co-persistence ratio is derived in the article. And we also develop a new hedging strategy of combining co-persis…

Despite the obvious similarities between the metrics used in topological data analysis and those of optimal transport, an optimal-transport based formalism to study persistence diagrams and similar topological descriptors has yet to come. In this article, by considering the space of persistence diagrams as a space of d…

Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …

Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field. In this paper, we study topological persistence in general metric spaces, with a …

A new approach to reinforcement learning improves policy performance by adjusting control frequency.

Given a compact geodesic space $X$ we apply the fundamental group and alternatively the first homology group functor to the corresponding Rips or Čech filtration of $X$ to obtain what we call a persistence. This paper contains the theory describing such persistence: properties of the set of critical points, their preci…

A new method compares persistent cycles in topological data.

Improved persistence spheres map measures to functions, stable under partial transport.

We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric descriptions of the "life span" or "persistence" of a homology class. As a case study, …

This article addresses persistent tangles. These are tangles whose presence in a knot diagram forces that diagram to be knotted. We provide new methods for constructing persistent tangles. Our techniques rely mainly on the existence of non-trivial colorings for the tangles in question. Our main result in this article i…

Study cosmic structures using Topological Data Analysis and Persistence Energy.

New lattice path method for statistical inference of persistent diagrams.

The paper examines how long-memory dynamics, rough-volatility, and persistence affect equity volatility forecasting.

This review explores TDA and TDL beyond persistent homology.

Revises SWK for persistence diagrams using Figalli-Gigli distance.

New model predicts energy prices volatility by smoothing time variation and persistence.

Persistent homology reveals geometric features of metric spaces, especially geodesic circles.

Persistent Legendrian contact homology distinguishes knots using height functional.