Related papers: Computing a minimal resolution over the Steenrod a…

We construct a Hopf algebra structure on the space of specified Feynman graphs of a quantum field theory. We introduce a convolution product and a semigroup of characters of this Hopf algebra with values in some suitable commutative algebra…

Various aspects of the de Rham cohomology of Hopf algebras are discussed. In particular, it is shown that the de Rham cohomology of an algebra with the differentiable coaction of a cosemisimple Hopf algebra with trivial 0-th cohomology…

It is shown that the methods and algorithms, developed in (A. Capani et al., Computing minimal finite free resolutions, {\it Journal of Pure and Applied Algebra}, (117& 118)(1997), 105 -- 117; M. Kreuzer and L. Robbiano, {\it Computational…

A computation method of algebraic local cohomology with parameters, associated with zero-dimensional ideal with parameter, is introduced. This computation method gives us in particular a decomposition of the parameter space depending on the…

The minimum rank of a graph G is the minimum rank over all real symmetric matrices whose off-diagonal sparsity pattern is the same as that of the adjacency matrix of G. In this note we present the first exact algorithm for the minimum rank…

We give a practical, algorithmic method to calculate minimal projective resolutions of simple modules for a finite dimensional incidence $k$-algebra $\Lambda$, where $k$ is a field. We apply the method to the calculation of Ext groups…

We develop a new method for solving minimization problems on the Stiefel Manifold using damped dynamical systems. The constraints are satisfied in the limit by an additional damped dynamical system. The method is illustrated by numerical…

Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilating polynomials for all the unit vectors, for a square matrix…

We study criteria for freeness and for the existence of a vanishing line for modules over certain Hopf subalgebras of the motivic Steenrod algebra over $\mathrm{Spec}(\mathbb{C})$ at the prime 2. These turn out to be determined by the…

The subgradient method is a classical and foundational approach in non-smooth convex optimization; its simplicity, robustness, and role as a conceptual and algorithmic starting point have made it the backbone of many significant…

The goal of this paper is to give a new method of constructing finite-dimensional semisimple triangular Hopf algebras, including minimal ones which are non-trivial (i.e. not group algebras). The paper shows that such Hopf algebras are quite…

We develop an efficient stochastic variance reduced gradient descent algorithm to solve the affine rank minimization problem consists of finding a matrix of minimum rank from linear measurements. The proposed algorithm as a stochastic…

We describe the resolution of singularities of a threefold which has minimal Picard number. We describe the relation between this minimal resolution and an arbitrary resolution of singularities.

This article introduces a method, which starting from simple and quite general mathematical data, allows to construct linear algebras of operators which are, each of them, endowed with a bialgebra structure (coproduct and counity). Moreover…

The aim of this paper is to study sub-algebras of the $\mathbb{Z}/2$-equivariant Steenrod algebra (for cohomology with coefficients in the constant Mackey functor $\mathbb{F}_2$) which come from quotient Hopf algebroids of the…

We describe an essential improvement of our recent algorithm for computing cohomology of Lie (super)algebra based on partition of the whole cochain complex into minimal subcomplexes. We replace the arithmetic of rational numbers or integers…

We consider the problem of minimizing a function over the manifold of orthogonal matrices. The majority of algorithms for this problem compute a direction in the tangent space, and then use a retraction to move in that direction while…

Let $A$ be a cocommutative finite dimensional Hopf algebra over the field with two elements, satisfying some mild hypothesis. We set up a descent spectral sequence which computes the Picard group of the stable category of modules over $A$.…

We consider the Minimum Steiner Cut problem on undirected planar graphs with non-negative edge weights. This problem involves finding the minimum cut of the graph that separates a specified subset $X$ of vertices (terminals) into two parts.…

We present a novel algorithm which can overcome the drawbacks of the conventional linear scaling method with minimal computational overhead. This is achieved by introducing additional constraints, thus eliminating the redundancy of the…