Related papers: Computing a minimal resolution over the Steenrod a…
Since the Connes--Kreimer Hopf algebra was proposed, revisiting present quantum field theory has become meaningful and important from algebraic points. In this paper, the Hopf algebra in the cutting rules is constructed. Its coproduct…
In this paper, we discuss the algorithm engineering aspects of an O(n^2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.
Certain problems in quadratic minimization can be reduced to finding the point $x$ of a polyhedron ${ P}$ that minimizes the distance $\|x-p\|$ for some $p\notin { P}$. This amounts to a search for the appropriate face $F$ of ${ P}$ for…
This is the first in a series of papers which deal with the development of novel methods for solving a system of linear algebraic equations with a time complexity lower than existing algorithms. The NxN system of linear equations, Ax = b,…
We construct a minimal projective bimodule resolution for every finite dimensional quantum complete intersection of codimension two. Then we use this resolution to compute both the Hochschild cohomology and homology for such an algebra. In…
A power series being given as the solution of a linear differential equation with appropriate initial conditions, minimization consists in finding a non-trivial linear differential equation of minimal order having this power series as a…
Submodular function minimization is a fundamental optimization problem that arises in several applications in machine learning and computer vision. The problem is known to be solvable in polynomial time, but general purpose algorithms have…
In the minimum cost submodular cover problem (MinSMC), we are given a monotone nondecreasing submodular function $f\colon 2^V \rightarrow \mathbb{Z}^+$, a linear cost function $c: V\rightarrow \mathbb R^{+}$, and an integer $k\leq f(V)$,…
We present a descent style, Bockstein spectral sequence computing Ext over the motivic Steenrod algebra over $\R$ and related sub-Hopf algebras. We demonstrate the workings of this spectral sequence in several examples, providing motivic…
In this paper we discuss several heuristic strategies which allow one to solve the Whitehead's minimization problem much faster (on most inputs) than the classical Whitehead algorithm. The mere fact that these strategies work in practice…
We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different…
An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain…
The notion of $P$-algebra due to Margolis, building on work of Moore and Peterson, was motivated by the case of the Steenrod algebra at a prime and its modules. We develop aspects of this theory further, focusing especially on coherent…
In this paper we construct an analog of Steenrod operations in motivic cohomology and prove their basic properties including the Cartan formula, the Adem relations and the realtions to characteristic classes.
Optimization over the Stiefel manifold is a fundamental computational problem in many scientific and engineering applications. Despite considerable research effort, high-dimensional optimization problems over the Stiefel manifold remain…
By adding entropic regularization, multi-marginal optimal transport problems can be transformed into tensor scaling problems, which can be solved numerically using the multi-marginal Sinkhorn algorithm. The main computational bottleneck of…
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve.…
We compute a minimal bigraded resolution of the Rees Algebra associated to a proper rational parametrization of a monomial plane curve. We describe explicitly both the bigraded Betti numbers and the maps of the resolution in terms of a…
We propose a method for calculating cohomology operations for finite simplicial complexes. Of course, there exist well--known methods for computing (co)homology groups, for example, the reduction algorithm consisting in reducing the…
We give a Clifford correspondence for an algebra A over an algebraically closed field, that is an algorithm for constructing some finite-dimensional simple A-modules from simple modules for a subalgebra and endomorphism algebras. This…