Related papers: A new algorithm for computing idempotents of R-tri…

We introduce several classes of monoids satisfying up to five axioms and establish basic theories on their arithmetics. The one satisfying all the axioms is named natural monoid. Two typical examples are 1) the monoid $\mathbb{N}$ of…

The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…

We investigate the power of randomized algorithms for the maximum cardinality matching (MCM) and the maximum weight matching (MWM) problems in the online preemptive model. In this model, the edges of a graph are revealed one by one and the…

We consider the problem of computing univariate polynomial matrices over a field that represent minimal solution bases for a general interpolation problem, some forms of which are the vector M-Pad\'e approximation problem in [Van Barel and…

This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of…

The goal of tensor completion is to fill in missing entries of a partially known tensor under a low-rank constraint. In this paper, we mainly study low rank third-order tensor completion problems by using Riemannian optimization methods on…

We give an algorithm to compute the $\omega$-primality of finitely generated atomic monoids. Asymptotic $\w$-primality is also studied and a formula to obtain it in finitely generated quasi-Archimedean monoids is proven. The formulation is…

Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[S_r] of a symmetric group S_r. If for a class of tensors T such a W is known, the elements of the orthogonal subspace…

We investigate a canonical extension of a conventional combinatorial notion of reduced divisors to a notion of tropical projections, which can be defined as the unique minimizers of the so-called $B$-pseudonorms with respect to compact…

For a regular ring R and an affine monoid M the homotheties of M act nilpotently on the Milnor unstable groups of R[M]. This strengthens the K_2 part of the main result of [G5] in two ways: the coefficient field of characteristic 0 is…

A classification of idempotents in Clifford algebras C(p,q) is presented. It is shown that using isomorphisms between Clifford algebras C(p,q) and appropriate matrix rings, it is possible to classify idempotents in any Clifford algebra into…

In this paper we study the lower triangular matrix $\mathbb{K}$-algebra $\Lambda:=\left[\begin{smallmatrix} T & 0 \\ M & U \end{smallmatrix}\right],$ where $U$ and $T$ are basic $\mathbb{K}$-algebras with enough idempotents and $M$ is an…

Given a non-associative unital ring $R$, a monoid $G$ and a set $\pi$ of additive maps $R \rightarrow R$, we introduce the Ore monoid ring $R[\pi ; G]$, and, in a special case, the differential monoid ring. We show that these structures…

In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of…

We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitrary order admit a unique decomposition as a linear combination of rank-1 tensors. A practical algorithm is proposed for verifying this…

This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally alluded to by Bland and Jensen in their seminal paper on weak…

The problem of solving tropical linear systems, a natural problem of tropical mathematics, has already proven to be very interesting from the algorithmic point of view: it is known to be in $NP\cap coNP$ but no polynomial time algorithm is…

Let $A = \mathbb{F}_q[T]$, $\mathfrak{p} \subset A$ prime, $f(x) \in A[x]$ irreducible and set $R = A[x]/f(x)$. Denote its completion by $R_\mathfrak{p}$. The ideal class monoid $\text{ICM}(R_\mathfrak{p})$ is the set of fractional…

Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and computer science. Yet, many of their important properties are…