Related papers: Computing a minimal resolution over the Steenrod a…
A minimal resolution of the mod 2 Steenrod algebra in the range $0 \leq s \leq 128$, $0 \leq t \leq 200$, together with chain maps for each cocycle in that range and for the squaring operation $Sq^0$ in the cohomology of the Steenrod…
In this note, we give an algorithm that starting with a Sullivan algebra gives us its minimal model. This algorithm is a kind of modified AT-model algorithm used to compute in the past other kinds of topology information such as…
This paper is concerned with a minimal resolution of the PROP for bialgebras. We prove a theorem about the form of this resolution (Theorem 15) and give, in Section 5, a lot of explicit formulas for the differential. Our minimal model…
Submodular functions describe a variety of discrete problems in machine learning, signal processing, and computer vision. However, minimizing submodular functions poses a number of algorithmic challenges. Recent work introduced an…
This two-page note gives a non-computational derivation of the dual Steenrod algebra as the automorphisms of the formal additive group. Instead of relying on computational tools like spectral sequences and Steenrod operations, the argument…
We derive a numerical algorithm for evaluating the Riemannian logarithm on the Stiefel manifold with respect to the canonical metric. In contrast to the existing optimization-based approach, we work from a purely matrix-algebraic…
We introduce a randomized algorithm for computing the minimal-norm solution to an underdetermined system of linear equations. Given an arbitrary full-rank m x n matrix A with m<n, any m x 1 vector b, and any positive real number epsilon…
The purpose of this article is to compute the cohomology of the motivic Steenrod algebra over Spec C through the geometric 70-stem. The main computational tool is the motivic May spectral sequence. Everywhere in this article, we are working…
Homological algebra techniques can be found in almost all modern areas of mathematics. Many interesting problems in mathematics can be formulated, computed, or can find their equivalence in terms of Ext-groups. For instance, important…
We provide an algorithmic method for constructing projective resolutions of modules over quotients of path algebras. This algorithm is modified to construct minimal projective resolutions of linear modules over Koszul algebras.
We establish a motivic version of Adams' vanishing line of slope 1/2 in the cohomology of the motivic Steenrod algebra over the complex numbers.
The purpose of these notes is to provide an introduction to the Steenrod algebra in an algebraic manner avoiding any use of cohomology operations. The Steenrod algebra is presented as a subalgebra of the algebra of endomorphisms of a…
We propose a new algorithm for minimal unsatisfiable core extraction, based on a deeper exploration of resolution-refutation properties. We provide experimental results on formal verification benchmarks confirming that our algorithm finds…
We construct an algorithm for the minimal model program in dimension three over the field of algebraic numbers. As auxiliary results, we also construct algorithms for computing bigraded global Hom modules and for computing Stein…
This paper offers an algorithmic solution to the problem of obtaining "economical" formulae for some maps in Simplicial Topology, having, in principle, a high computational cost in their evaluation. In particular, maps of this kind are used…
Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on…
A new algorithm is presented for computing a direct solution to a system of consistent linear equations. It produces a minimum norm particular solution, a generalized inverse (of type {124}), and a null space projection operator. In…
Building up on work of Epstein, May and Drury, we define and investigate the mod $p$ Steenrod operations on the de Rham cohomology of smooth algebraic stacks over a field of characteristic $p>0$. We then compute the action of the operations…
The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…
Using the standard filtration associated with a generalized lifting method, we determine all finite-dimensional Hopf algebras over an algebraically closed field of characteristic zero whose coradical generates a Hopf subalgebra isomorphic…