Related papers: Computing spectral sequences
We introduce Cubical Ripser for computing persistent homology of image and volume data (more precisely, weighted cubical complexes). To our best knowledge, Cubical Ripser is currently the fastest and the most memory-efficient program for…
Peptide sequencing from mass spectrometry data is a key step in proteome research. Especially de novo sequencing, the identification of a peptide from its spectrum alone, is still a challenge even for state-of-the-art algorithmic…
The concept of k-spectrum for genomes is here investigated as a basic tool to analyze genomes. Related spectral notions based on k-mers are introduced with some related mathematical properties which are relevant for informational analysis…
We present an interactive IDL program for viewing and analyzing astronomical spectra in the context of modern imaging surveys. SpecPro's interactive design lets the user simultaneously view spectroscopic, photometric, and imaging data,…
We define for every dendroidal set X a chain complex and show that this assignment determines a left Quillen functor. Then we define the homology groups $H_n(X)$ as the homology groups of this chain complex. This generalizes the homology of…
Computing spectra is a central problem in computational mathematics with an abundance of applications throughout the sciences. However, in many applications gaining an approximation of the spectrum is not enough. Often it is vital to…
Semidefinite programming (SDP) is a powerful tool for tackling a wide range of computationally hard problems such as clustering. Despite the high accuracy, semidefinite programs are often too slow in practice with poor scalability on large…
The spherical harmonic transform is a powerful tool in the analysis of spherical data sets, such as the cosmic microwave background data. In this work, we present a new scheme for the spherical harmonic transforms that supports both CPU and…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
We consider a finite group acting on a vector space and the corresponding skew group algebra generated by the group and the symmetric algebra of the space. This skew group algebra illuminates the resulting orbifold and serves as a…
Persistent homology is a popular computational tool for analyzing the topology of point clouds, such as the presence of loops or voids. However, many real-world datasets with low intrinsic dimensionality reside in an ambient space of much…
A Mathematica based program has been elaborated in order to determine the symmetry group of a finite difference equation, by means of its differential representation. The package provides functions which enable us to solve the determining…
Let $G$ be a group and $S$ a unital epsilon-strongly $G$-graded algebra. We construct spectral sequences converging to the Hochschild (co)homology of $S$. Each spectral sequence is expressed in terms of the partial group (co)homology of $G$…
The completely bounded trace and spectral norms, for finite-dimensional spaces, are known to be efficiently expressible by semidefinite programs (J. Watrous, Theory of Computing 5: 11, 2009). This paper presents two new, and arguably much…
While several feature embedding models have been developed in the literature, comparisons of these embeddings have largely focused on their numerical performance in classification-related downstream applications. However, an interpretable…
Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a $d$-dimensional system…
In this paper, we develop Leray-Serre-type spectral sequences to compute the intersection homology of the regular neighborhood and deleted regular neighborhood of the bottom stratum of a stratified PL-pseudomanifold. The E^2 terms of the…
The Boolean algebra of regular closed sets is prominent in topology, particularly as a dual for the Stone-Cech compactification. This algebra is also central for the theory of geometric computation, as a representation for combinatorial…
We study the homology groups of the complement of a complexified real line arrangement with coefficients in complex rank-one local systems. Using Borel--Moore homology, we establish an algorithm computing their dimensions via the real…
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints. The need for an efficient exploitation of the cone of positive semidefinite matrices makes the solution of such nonlinear semidefinite programs more…