Related papers: An algorithm to compute minimal Sullivan algebras
The abelian category of tetramodules over an associative bialgebra $A$ is related with the Gerstenhaber-Schack (GS) cohomology as $Ext_\Tetra(A,A)=H_\GS(A)$. We construct a 2-fold monoidal structure on the category of tetramodules of a…
Topological data analysis (TDA) provides a growing body of tools for computing geometric and topological information about spaces from a finite sample of points. We present a new adaptive algorithm for finding provably dense samples of…
Abelian deformations of ordinary algebras of functions are studied. The role of Harrison cohomology in classifying such deformations is illustrated in the context of simple examples chosen for their relevance to physics. It is well known…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…
In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of…
We study cup product and cap product in Tate-Hochschild theory for a finite dimensional Frobenius algebra. We show that Tate-Hochschild cohomology ring equipped with cup product is isomorphic to singular Hochschild cohomology ring…
We consider sequences of absolute and relative homology and cohomology groups that arise naturally for a filtered cell complex. We establish algebraic relationships between their persistence modules, and show that they contain equivalent…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
A cohomology theory of the adjoint of Hopf algebras, via deformations, is presented by means of diagrammatic techniques. Explicit calculations are provided in the cases of group algebras, function algebras on groups, and the bosonization of…
These lecture notes focus on some numerical linear algebra algorithms in scientific computing. We assume that students are familiar with elementary linear algebra concepts such as vector spaces, systems of equations, matrices, norms,…
We demonstrate how a simple linear-algebraic technique used earlier to compute low-degree cohomology of current Lie algebras, can be utilized to compute other kinds of structures on such Lie algebras, and discuss further generalizations,…
We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semi-algebraic sets. Aside from…
The theory of unified product and extending structures for alternative and pre-alternative algebras are developed. It is proved that the extending structures of these algebras can be classified by using some non-abelian cohomology and…
We present a fast randomized algorithm that computes a low rank LU decomposition. Our algorithm uses random projections type techniques to efficiently compute a low rank approximation of large matrices. The randomized LU algorithm can be…
We consider a network topology design problem in which an initial undirected graph underlying the network is given and the objective is to select a set of edges to add to the graph to optimize the coherence of the resulting network. We show…
We describe two new algorithms for the computation of Whitney stratifications of real and complex algebraic varieties. The first algorithm is a modification of the algorithm of Helmer and Nanda (HN), but is made more efficient by using…
The aim of this paper is to give a relatively easy bicomplex which computes the Shukla, or Quillen cohomology in the category of associative algebras over a commutative algebra $A$, in the case when $A$ is an algebra over a field.
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of two inputs, which essentially reduces to SET COVER. We show a…
We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…
In this dissertation, we investigate the cohomology theory of restricted Lie algebras. The representation theory of restricted Lie algebras is reviewed including a description of the restricted universal enveloping algebra. In the case of…