Related papers: A new algorithm for computing idempotents of R-tri…
Let $A_1,\ldots,A_s$ be unitary commutative rings which do not have non-trivial idempotents and let $A=A_1\oplus\cdots\oplus A_s$ be their direct sum. We describe all idempotents in the $2\times 2$ matrix ring $M_2(A[[X]])$ over the ring…
We present various new results on greedoids. We prove a theorem that generalizes an equivalent formulation of Edmonds' classic matroid polytope theorem to local forest greedoids -- a class of greedoids that contains matroids as well as…
We propose a novel Riemannian manifold preconditioning approach for the tensor completion problem with rank constraint. A novel Riemannian metric or inner product is proposed that exploits the least-squares structure of the cost function…
Let F be a finite field and R = M2(F) be 2x2 matrix ring over F. In this paper, we explicitly determine all the idempotents in R. Using these idempotents, we study the idempotent graph of R whose vertex set is the set of non-trivial…
We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…
The aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a…
We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…
Recent progress on robust clustering led to constant-factor approximations for Robust Matroid Center. After a first combinatorial $7$-approximation that is based on a matroid intersection approach, two tight LP-based $3$-approximations were…
We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equations. If the coordinates of the input systems and the initial…
An effective method to obtain exact analytical solutions of equations describing the coherent dynamics of multilevel systems is presented. The method is based on the usage of orthogonal polynomials, integral transforms and their discrete…
This paper exploits a basic connection between sequential quadratic programming and Riemannian gradient optimization to address the general question of selecting a metric in Riemannian optimization, in particular when the Riemannian…
Let $M$ be G-graded R-module. The idea of a graded weakly primal submodule of $M$, which is a generalization of a graded primal submodule, is introduced and discussed in this paper. Some characteristics and characterizations are assigned to…
The Ruijsenaars-Schneider systems are `discrete' version of the Calogero-Moser (C-M) systems in the sense that the momentum operator p appears in the Hamiltonians as a polynomial in e^{\pm\beta' p} (\beta' is a deformation parameter)…
We propose an algorithm for low rank matrix completion for matrices with binary entries which obtains explicit binary factors. Our algorithm, which we call TBMC (\emph{Tiling for Binary Matrix Completion}), gives interpretable output in the…
We give a construction of the projective indecomposable modules and a description of the quiver for a large class of monoid algebras including the algebra of any finite monoid whose principal right ideals have at most one idempotent…
We introduce a notion of $R$-quadratic maps between modules over a commutative ring $R$ which generalizes several classical notions arising in linear algebra and group theory. On a given module $M$ such maps are represented by $R$-linear…
Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…
As highlighted in a series of recent papers by Tringali and the author, fundamental aspects of the classical theory of factorization can be significantly generalized by blending the languages of monoids and preorders. Specifically, the…
Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…