Related papers: Computing spectral sequences
We present in this paper an evolution of a tool from a user interface for a concrete Computer Algebra system for Algebraic Topology (the Kenzo system), to a front-end allowing the interoperability among different sources for computation and…
In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…
The higher Leray-Serre spectral sequence associated with a tower of fibrations represents a generalization of the classical Leray-Serre spectral sequence of a fibration. In this work, we present algorithms to compute higher Leray-Serre…
In this paper, three Computational Topology methods (namely effective homology, persistent homology and discrete vector fields) are mixed together to produce algorithms for homological digital image processing. The algorithms have been…
The classical ``computation'' methods in Algebraic Topology most often work by means of highly infinite objects and in fact +are_not+ constructive. Typical examples are shown to describe the nature of the problem. The Rubio-Sergeraert…
This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…
A tensor network is a diagram that specifies a way to "multiply" a collection of tensors together to produce another tensor (or matrix). Many existing algorithms for tensor problems (such as tensor decomposition and tensor PCA), although…
The Image-Computing Spectral Sequence computes the homology of the image of a finite map from the alternating homology of the multiple point spaces of the map. A related spectral sequence was obtained by Gabrielov, Vorobjob and Zell which…
Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix…
We show the homological Serre spectral sequence with coefficients in a field is a spectral sequence of coalgebras. We also identify the comultiplication on the $E^2$ page of the spectral sequence as being induced by the usual…
Spectral clustering and co-clustering are well-known techniques in data analysis, and recent work has extended spectral clustering to square, symmetric tensors and hypermatrices derived from a network. We develop a new tensor spectral…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
In this paper the Serre spectral sequence of Moerdijk and Svensson is extended from Bredon cohomology to RO(G)-graded cohomology for finite groups G. Special attention is paid to the case G=Z/2 where the spectral sequence is used to compute…
These notes offer a unified introduction to spectral methods for the study of complex systems. They are intended as an operative manual rather than a theorem-proof textbook: the emphasis is on tools, identities, and perspectives that can be…
We are familiar with properties and structure of topological spaces. One of the powerful tools, which help us to figure out the structure of topological spaces is (Leray- Serre) spectral sequence. Although Eilenberg-Maclane space plays…
The Leray-Serre and the Eilenberg-Moore spectral sequences are fundamental tools for computing the cohomology of a group or, more generally, of a space. We describe the relationship between these two spectral sequences when both of them…
We apply the method of spectral sequences to study classical problems in analysis. We illustrate the method by finding polynomial vector fields that commute with a given polynomial vector field and finding integrals of polynomial…
This paper introduces ENFrame, a unified data processing platform for querying and mining probabilistic data. Using ENFrame, users can write programs in a fragment of Python with constructs such as bounded-range loops, list comprehension,…
We develop a new method to compute the homology groups of finite topological spaces (or equivalently of finite partially ordered sets) by means of spectral sequences giving a complete and simple description of the corresponding…
We construct some spectral sequences as tools for computing commutative cohomology of commutative Lie algebras in characteristic 2. In a first part, we focus on a Hochschild-Serre-type spectral sequence, while in a second part we obtain…