相关论文: A new algorithm for computing idempotents of R-tri…

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

Given a finite commutative monoid $M$, we show that submonoids of $M\times [n]$ - where $[n] = \{0,1,\ldots,n\}$ is equipped with the max operation $\vee$ - may be enumerated via the transfer matrix method. When $M$ is also idempotent, we…

Let Q be an affine semigroup generating Z^d, and fix a finitely generated Z^d-graded module M over the semigroup algebra k[Q] for a field k. We provide an algorithm to compute a minimal Z^d-graded injective resolution of M up to any desired…

The minimum rank of a graph G is the minimum rank over all real symmetric matrices whose off-diagonal sparsity pattern is the same as that of the adjacency matrix of G. In this note we present the first exact algorithm for the minimum rank…

The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M. For string compression, straight-line programs, i.e., context-free grammars that…

We establish theoretical recovery guarantees of a family of Riemannian optimization algorithms for low rank matrix recovery, which is about recovering an $m\times n$ rank $r$ matrix from $p < mn$ number of linear measurements. The…

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

We propose an efficient algorithm for computing a common eigenvector of a finite set of square matrices. As an immediate consequence we obtain an algorithm for determining whether the matrices admit a simultaneous triangulation, and, if so,…

The Matrix Torsion Problem (MTP) is: given a square matrix M with rational entries, decide whether two distinct powers of M are equal. It has been shown by Cassaigne and the author that the MTP reduces to the Matrix Power Problem (MPP) in…

Inspired by the work [PA1], in this note, we prove that a complete set of pairwise orthogonal primitive idempotents of Yokonuma-Hecke algebras can be obtained by consecutive evaluations of a certain rational function.

We consider the inverse problem of finding a magnitude-symmetric matrix (matrix with opposing off-diagonal entries equal in magnitude) with a prescribed set of principal minors. This problem is closely related to the theory of recognizing…

A very brief introduction to tropical and idempotent mathematics is presented. Tropical mathematics can be treated as a result of a dequantization of the traditional mathematics as the Planck constant tends to zero taking imaginary values.…

This is a survey paper on applications of mathematics of semirings to numerical analysis and computing. Concepts of universal algorithm and generic program are discussed. Relations between these concepts and mathematics of semirings are…

Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilating polynomials for all the unit vectors, for a square matrix…

We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…

We show that all primitive idempotents for the Brauer algebra B_n(w) can be found by evaluating a rational function in several variables which has the form of a product of R-matrix type factors. This provides an analogue of the fusion…

We are interested in finding a solution to the tensor complementarity problem with a strong M-tensor, which we call the M-tensor complementarity problem. We propose a lower dimensional linear equation approach to solve that problem. At each…

Any multiplicity-free family of finite dimensional algebras has a canonical complete set of of pairwise orthogonal primitive idempotents in each level. We give various methods to compute these idempotents. In the case of symmetric group…

In these notes we develop some basic theory of idempotents in monoidal categories. We introduce and study the notion of a pair of complementary idempotents in a triangulated monoidal category, as well as more general idempotent…

In this paper, we introduce a novel algorithm for calculating arbitrary order cumulants of multidimensional data. Since the $d^\text{th}$ order cumulant can be presented in the form of an $d$-dimensional tensor, the algorithm is presented…