Related papers: An algorithm to compute minimal Sullivan algebras
We consider associative algebras L over a field provided with a direct sum decomposition of a two-sided ideal M and a sub-algebra A - examples are provided by trivial extensions or triangular type matrix algebras. In this relative and split…
The cup product in the cohomology of algebras over quadratic operads has been studied in the general setting of Koszul duality for operads. We study the cup product on the cohomology of n-ary totally associative algebras with an operation…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
A condition is identified which guarantees that the coinvariants of a coaction of a Hopf algebra on an algebra form a subalgebra, even though the coaction may fail to be an algebra homomorphism. A Hilbert Theorem (finite generation of the…
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…
In this work, we study several variants of matrix reduction via Gaussian elimination that try to keep the reduced matrix sparse. The motivation comes from the growing field of topological data analysis where matrix reduction is the major…
The persistent homology with coefficients in a field F coincides with the same for cohomology because of duality. We propose an implementation of a recently introduced algorithm for persistent cohomology that attaches annotation vectors…
Two cochain complexes are constructed for an algebra A and a coalgebra C entwined with each other via the map $\psi:C\otimes A\to A\otimes C$. One complex is associated to an A-bimodule, the other to a C-bicomodule. In the former case the…
We present an algorithm for explicitly computing the number of generators of the stable cohomology algebra of any rationally smooth partial toroidal compactification of ${\mathcal A}_g$, satisfying certain additivity and finiteness…
We construct a canonical map from the Poisson vertex algebra cohomology complex to the differential Harrison cohomology complex, which restricts to an isomorphism on the top degree. This is an important step in the computation of Poisson…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of semialgebraic sets given by Boolean formulas. The algorithm works in weak exponential time. This means that outside a…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
Following Manin's approach to renormalization in the theory of computation, we investigate Dyson-Schwinger equations on Hopf algebras, operads and properads of flow charts, as a way of encoding self-similarity structures in the theory of…
In this article we study the possibilities of recovering the structure of port-Hamiltonian systems starting from ``unlabelled'' ordinary differential equations describing mechanical systems. The algorithm we suggest solves the problem in…
This paper constructs the cohomology theory for grading-restricted vertex superalgebras, generalizing Yi-Zhi Huang's cohomology theory of grading-restricted vertex algebras. To simplify the discussion, motivate the construction, and make it…
We obtain a mixed complex simpler than the canonical one the computes the type cyclic homologies of a crossed product with invertible cocycle $A\times_{\rho}^f H$, of a weak module algebra $A$ by a weak Hopf algebra $H$ whose unit…
Persistent (co)homology is a central construction in topological data analysis, where it is used to quantify prominence of features in data to produce stable descriptors suitable for downstream analysis. Persistence is challenging to…
The primitive elements of the supersymmetry algebra cohomology as defined in a previous paper are computed for standard supersymmetry algebras in four and five dimensions, for all signatures of the metric and any number of supersymmetries.
The new computational paradigm of conceptual computation has been introduced in the research program of Artificial Mathematical Intelligence. We provide the explicit artificial generation (or conceptual computation) for the fundamental…