English
Related papers

Related papers: Computing Connection Matrices of Conley Complexes …

200 papers

Using Morse theory and a new relative homological linking of pairs, we prove a ``homological linking principle'', thereby generalizing many well known results in critical point theory.

Analysis of PDEs · Mathematics 2008-01-29 Alexandre Girouard

This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…

Geometric Topology · Mathematics 2020-06-08 Andrew Putman

We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) $2$-complexes. We show, as an extension of an earlier work, that computing first homology of $2$-complexes is…

Computational Geometry · Computer Science 2016-04-11 Salman Parsa

The goal of this paper is to generalize some of the existing toolkit of combinatorial algebraic topology in order to study the homology of abstract chain complexes. We define shellability of chain complexes in a similar way as for cell…

Algebraic Topology · Mathematics 2012-10-18 Gerrit Grenzebach , Björn Walker

Homological algebra is often understood as the translator between the world of topology and algebra. However, this branch of mathematics is worth studying by itself, given that it provides fascinating perspectives about other disciplines,…

History and Overview · Mathematics 2022-09-08 Andy Eskenazi , Kevin You , Will Vauclain , Robin Murugadoss

Degree correlation is an important topological property common to many real-world networks. In this paper, the statistical measures for characterizing the degree correlation in networks are investigated analytically. We give an exact proof…

Physics and Society · Physics 2015-09-03 Ju Xiang , Ke Hu , Tao Hu , Yan Zhang , Jian-Ming Li

We generalize and extend the Conley-Morse-Forman theory for combinatorial multivector fields introduced in \cite{Mr2017}. The generalization consists in dropping the restrictive assumption in \cite{Mr2017} that every multivector has a…

Dynamical Systems · Mathematics 2024-09-18 Michał Lipiński , Jacek Kubica , Marian Mrozek , Thomas Wanner

We introduce combinatorial multivector fields, associate with them multivalued dynamics and study their topological features. Our combinatorial multivector fields generalize combinatorial vector fields of Forman. We define isolated…

Dynamical Systems · Mathematics 2016-05-24 Marian Mrozek

In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression…

Rings and Algebras · Mathematics 2024-11-12 Ivan-Vanja Boroja , Hamid Reza Dorbidi , Damjana Kokol Bukovšek , Nik Stopar

While sparse inverse covariance matrices are very popular for modeling network connectivity, the value of the dense solution is often overlooked. In fact the L2-regularized solution has deep connections to a number of important applications…

Machine Learning · Computer Science 2019-03-19 Keith Dillon

In this paper we focus on preprocessing for persistent homology computations. We adapt some techniques which were successfully used for standard homology computations. The main idea is to reduce the complex prior to generating its boundary…

Geometric Topology · Mathematics 2013-05-01 Paweł Dłotko , Hubert Wagner

Matrix reduction is the standard procedure for computing the persistent homology of a filtered simplicial complex with $m$ simplices. Its output is a particular decomposition of the total boundary matrix, from which the persistence diagrams…

Computational Geometry · Computer Science 2023-10-17 Matthew Piekenbrock , Jose A. Perea

Inspired by Brown's collapsing method (or discrete Morse theory) to obtain a free resolution of $\bbZ$ over the monoid ring $\bbZ M$, we apply algebraic discrete Morse theory to compute the homology groups of Lawvere theories, which is…

K-Theory and Homology · Mathematics 2026-03-31 Mirai Ikebuchi

Most of the time, the first step to learn word embeddings is to build a word co-occurrence matrix. As such matrices are equivalent to graphs, complex networks theory can naturally be used to deal with such data. In this paper, we consider…

Computation and Language · Computer Science 2019-10-04 Nicolas Dugué , Victor Connes

We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…

Machine Learning · Computer Science 2014-08-20 Franz J. Király , Louis Theran , Ryota Tomioka

We give a new proof of the Morse Homology Theorem by constructing a chain complex associated to a Morse-Bott-Smale function that reduces to the Morse-Smale-Witten chain complex when the function is Morse-Smale and to the chain complex of…

Algebraic Topology · Mathematics 2013-01-04 Augustin Banyaga , David E. Hurtubise

We develop a framework that systematically casts the solvability and uniqueness conditions of linearized geometric boundary-value problems into cohomological terms. The theory is designed to be applicable without assumptions on the…

Differential Geometry · Mathematics 2026-03-16 Roee Leder

Hodge correlators are complex numbers given by certain integrals assigned to a smooth complex curve. We show that they are correlators of a Feynman integral, and describe the real mixed Hodge structure on the pronilpotent completion of the…

Algebraic Geometry · Mathematics 2016-01-12 A. B. Goncharov

The aim of this paper is to study the behavior of Hodge-theoretic (intersection homology) genera and their associated characteristic classes under proper morphisms of complex algebraic varieties. We obtain formulae that relate (parametrized…

Algebraic Geometry · Mathematics 2012-04-03 Sylvain E. Cappell , Laurentiu G. Maxim , Julius L. Shaneson

A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…

Combinatorics · Mathematics 2021-02-01 Marija Jelić Milutinović , Helen Jenne , Alex McDonough , Julianne Vega