Related papers: Computing a minimal resolution over the Steenrod a…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
We present a computer algorithm to explicitly compute the BGG resolution and its cohomology. We give several applications, in particular computation of various sheaf cohomology groups on flag varieties. An implementation of the algorithm is…
This paper proposes an efficient algorithm (HOLRR) to handle regression tasks where the outputs have a tensor structure. We formulate the regression problem as the minimization of a least square criterion under a multilinear rank…
This Note presents a computational algorithm for determining a basis of the cohomology of the mod 2 Steenrod algebra, $\mathrm{Ext}_{\mathcal A}^{k, k+*}(\mathbb{Z}/2, \mathbb{Z}/2)$ for $k \leq 5$, based on the well-known generators and…
We present the first near-linear work and poly-logarithmic depth algorithm for computing a minimum cut in a graph, while previous parallel algorithms with poly-logarithmic depth required at least quadratic work in the number of vertices. In…
In the paper "The Steenrod algebra and its dual", J.Milnor determined the structure of the dual Steenrod algebra which is a graded commutative Hopf algebra of finite type. We consider the affine group scheme $G_p$ represented by the dual…
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…
We propose a new method for simplifying semidefinite programs (SDP) inspired by symmetry reduction. Specifically, we show if an orthogonal projection map satisfies certain invariance conditions, restricting to its range yields an equivalent…
The minimum distance of a code is an important concept in information theory. Hence, computing the minimum distance of a code with a minimum computational cost is a crucial process to many problems in this area. In this paper, we present…
A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…
In this note, we study some properties of the filtration of the Steenrod algebra defined from the excess of admissible monomials. We give several conditions on a cocommutative graded Hopf algebra A^* which enable us to develop the theory of…
This paper introduces and studies the convergence properties of a new class of explicit $\epsilon$-subgradient methods for the task of minimizing a convex function over the set of minimizers of another convex minimization problem. The…
A recent breakthrough in Edmonds' problem showed that the noncommutative rank can be computed in deterministic polynomial time, and various algorithms for it were devised. However, only quite complicated algorithms are known for finding a…
In the minimum planarization problem, given some $n$-vertex graph, the goal is to find a set of vertices of minimum cardinality whose removal leaves a planar graph. This is a fundamental problem in topological graph theory. We present a…
The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the crossing resolution is, the easier it is to read and…
We describe the action of the mod $2$ Steenrod algebra on the cohomology of various polyhedral products and related spaces. We carry this out for Davis-Januszkiewicz spaces and their generalizations, for moment-angle complexes as well as…
We consider a theory of noncommutative Gr\"obner bases on decreasingly filtered algebras whose associated graded algebras are commutative. We transfer many algorithms that use commutative Gr\"obner bases to this context. As an important…
We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences…
In this paper we investigate pointed Hopf algebras via quiver methods. We classify all possible Hopf structures arising from minimal Hopf quivers, namely basic cycles and the linear chain. This provides full local structure information for…
We describe an algorithm for determining a minimal Weierstrass equation for hyperelliptic curves over principal ideal domains. When the curve has a rational Weierstrass point $w_0$, we also give a similar algorithm for determining the…