Related papers: Computing spectral sequences

Szab\'o recently introduced a combinatorially-defined spectral sequence in Khovanov homology. After reviewing its construction and explaining our methodology for computing it, we present results of computations of the spectral sequence.…

Spectral algorithms are graph partitioning algorithms that partition a node set of a graph into groups by using a spectral embedding map. Clustering techniques based on the algorithms are referred to as spectral clustering and are widely…

We describe the computer algebra software package SpectralSequences for the computer algebra system Macaulay2. This package implements many data types, objects and algorithms which pertain to, among other things, filtered complexes,…

We recall how a description of local coefficients that Eilenberg introduced in the 1940s leads to spectral sequences for the computation of homology and cohomology with local coefficients. We then show how to construct new equivariant…

Spectral clustering is one of the most popular clustering methods. However, the high computational cost due to the involved eigen-decomposition procedure can immediately hinder its applications in large-scale tasks. In this paper we use…

In the world of chain complexes E_n-algebras are the analogues of based n-fold loop spaces in the category of topological spaces. Fresse showed that operadic E_n-homology of an E_n-algebra computes the homology of an n-fold algebraic…

Spectral clustering approaches have led to well-accepted algorithms for finding accurate clusters in a given dataset. However, their application to large-scale datasets has been hindered by computational complexity of eigenvalue…

Let X be a space and write LX for its free loop space equipped with the action of the circle group T given by dilation. We compute the equivariant cohomology H^*(LX_hT; Z/p) as a module over H^*(BT; Z/p) when X=CP^r for any positive integer…

We present a spectral sequence connecting the continuous and 'locally continuous' group cohomologies for topological groups. As an application it is shown that for contractible topological groups these cohomology concepts coincide. Similar…

Persistent homology is a topological feature used in a variety of applications such as generating features for data analysis and penalizing optimization problems. We develop an approach to accelerate persistent homology computations…

While Spectral Methods have long been used for Principal Component Analysis, this survey focusses on work over the last 15 years with three salient features: (i) Spectral methods are useful not only for numerical problems, but also discrete…

In this article we construct what we call a higher spectral sequence for any chain complex (or topological space) that is filtered in $n$ compatible ways. For this we extend the previous spectral system construction of the author, and we…

We investigate the question of studying spectral clustering in a Hilbert space where the set of points to cluster are drawn i.i.d. according to an unknown probability distribution whose support is a union of compact connected components. We…

A spectral sequence calculating the homology groups of some spaces of maps equivariant under compact group actions is described. For the main example, we calculate the rational homology groups of spaces of even and odd maps $S^m \to S^M$,…

This paper describes an approach to computer aided calculations in the cohomology of arithmetic groups. It complements existing literature on the topic by emphasizing homotopies and perturbation techniques, rather than cellular subdivision,…

A method for encoding and decoding spectrum shaped binary run-length constrained sequences is described. The binary sequences with predefined range of exponential sums are introduced. On the base of Cover's enumerative scheme, recurrence…

We announce new methods for using prismatic cohomology to compute the K-groups of $\mathbb{Z}/p^n$ and related rings. We use computer algebra methods to compute these K-groups through a large range in specific cases and also obtain explicit…

Networks are a natural and popular mechanism for the representation and investigation of a broad class of systems. But extracting information from a network can present significant challenges. We present NetzCope, a software application for…

Multi-manifold modeling is increasingly used in segmentation and data representation tasks in computer vision and related fields. While the general problem, modeling data by mixtures of manifolds, is very challenging, several approaches…

What is Sequence Algebra? This is a question that any teacher or student of mathematics or computer science can engage with. Sequences are in Calculus, Combinatorics, Statistics and Computation. They are foundational, a step up from number…