Related papers: About Gordan's algorithm for binary forms

This paper presents a generalised symbolic algorithm for solving systems of linear algebraic equations with multi-diagonal coefficient matrices. The algorithm is given in a pseudocode. A theorem which gives the condition for correctness of…

In this paper, we develop a new framework for constructing infeasible-start primal-dual methods for Conic Optimization. Our approach can be seen as a straightforward consequence of Gordan Theorem of Alternative. Given by the target upper…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

This manuscript proposes a probabilistic framework for algorithms that iteratively solve unconstrained linear problems $Bx = b$ with positive definite $B$ for $x$. The goal is to replace the point estimates returned by existing methods with…

We obtain a complete and minimal set of 170 generators for the algebra of $SL(2,\C)^{\times 4}$-covariants of a binary quadrilinear form. Interpreted in terms of a four qubit system, this describes in particular the algebraic varieties…

We treat two quite different problems related to changes of complex structures on K\"ahler manifolds by using global geometric method. First, by using operators from Hodge theory on compact K\"ahler manifold, we present a closed explicit…

The nonlinearity of a Boolean function is a key property in deciding its suitability for cryptographic purposes, e.g. as a combining function in stream ciphers, and so the nonlinearity computation is an important problem for applications.…

In this paper we construct a combinatorial algorithm of resolution of singularities for binomial ideals, over a field of arbitrary characteristic. This algorithm is applied to any binomial ideal. This means ideals generated by binomial…

The author has introduced in a recent paper a new class of operators, called co-Toeplitz operators, with symbols in a co-algebra. This is the categorical dual to Toeplitz operators which have symbols in an algebra. The mapping from a symbol…

Decidability of definitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of definitional equality are based on a confluent,…

The aim of this article is to give a concise algebraic treatment of the modular symbols formalism, generalised from modular curves to Hecke triangle surfaces. A sketch is included of how the modular symbols formalism gives rise to the…

This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…

We describe a standard form for the elements in the universal field of fractions of free associative algebras (over a commutative field). It is a special version of the normal form provided by Cohn and Reutenauer and enables the use of…

An implementation of a nonparametric Bayesian approach to solving binary classification problems on graphs is described. A hierarchical Bayesian approach with a randomly scaled Gaussian prior is considered. The prior uses the graph…

The main goal of this paper is to present a way to compute Quillen homology of operads. The key idea is to use the notion of a shuffle operad we introduced earlier; this allows to compute, for a symmetric operad, the homology classes and…

The aim of the present paper is to propose an algorithm for a new ODE--solver which should improve the abilities of current solvers to handle second order differential equations. The paper provides also a theoretical result revealing the…

The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…

We prove a variant of the so-called bilinear embedding theorem for operators in divergence form with complex coefficients and with nonnegative locally integrable potentials, subject to mixed boundary conditions, and acting on arbitrary open…

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…

We investigate a U(1) gauge invariant quantum mechanical system on a 2D noncommutative space with coordinates generating a generalized deformed oscillator algebra. The Hamiltonian is taken as a quadratic form in gauge covariant derivatives…