Related papers: A new algorithm for computing idempotents of R-tri…
We construct a recursive formula for a complete system of primitive orthogonal idempotents for any $R$-trivial monoid. This uses the newly proved equivalence between the notions of $R$-trivial monoid and weakly ordered monoid.
We present a method to explicitly compute a complete set of orthogonal primitive idempotents in a simple component with Schur index 1 of a rational group algebra $\mathbb{Q}G$ for $G$ a finite generalized strongly monomial group. For the…
Let $R$ be a commutative local finite ring. In this paper, we construct the complete set of pairwise orthogonal primitive idempotents of $R[X]/<g>$ where $g$ is a regular polynomial in $R[X]$. We use this set to decompose the ring…
The speed of convergence of the R-linear GMRES is bounded in terms of a polynomial approximation problem on a finite subset of the spectrum. This result resembles the classical GMRES convergence estimate except that the matrix involved is…
We consider the algorithmic problem of computing a primitive idempotent of a central simple algebra over the field of rational functions over a finite field. The algebra is given by a set of structure constants. The problem is reduced to…
We provide algorithms to compute a complete irredundant set of extremely strong Shoda pairs of a finite group $G$ and the set of the primitive central idempotents of the rational group algebra $\mathbb{Q}[G]$ realized by them. These…
For the rational group algebra $\mathbb{Q}G$ of a finite group $G$, we provide an effective method to compute a complete set of matrix units and, in particular, primitive orthogonal idempotents in a simple component of $\mathbb{Q}G$, which…
We explicitly find a complete set of ${1\over4}(n+2)^2$ (resp. ${1\over4}(n+1)(n+3)$) primitive orthogonal idempotents in ${\rm Sym}^n\mathbb{H}\otimes_\mathbb{R}\mathbb{C}$ if $n$ is even (resp. odd), where ${\rm Sym}^n\mathbb{H}$ is the…
In this paper, we introduce a method computing the primitive decomposition of idempotents of any semisimple finite group algebra based on its matrix representations and Wedderburn decomposition. Particularly, we use this method to calculate…
We study a ring containing a complete set of orthogonal idempotents as a generalized matrix ring via its Peirce decomposition. We focus on the case where some of the underlying bimodule homomorphisms are zero. Upper and lower triangular…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
A complete system of pairwise orthogonal minimal idempotents for Birman-Murakami-Wenzl algebras is obtained by a consecutive evaluation of a rational function in several variables on sequences of quantum contents of up-down tableaux. A…
We describe the primitive central idempotents of the group algebra over a number field of finite monomial groups. We give also a description of the Wedderburn decomposition of the group algebra over a number field for finite strongly…
This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…
In this paper we introduce the notion of an idempotent system. This linear algebraic object is motivated by the structure of an association scheme. We focus on a family of idempotent systems, said to be symmetric. A symmetric idempotent…
We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of matrix units in each simple epimorphic image of a finite group…
We describe an algorithm that, given any full-rank matrix A having fewer rows than columns, can rapidly compute the orthogonal projection of any vector onto the null space of A, as well as the orthogonal projection onto the row space of A,…
The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…
We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the idempotents in the finite partition, Brauer and partial Brauer monoids, giving several formulae and recursions for the number of…
We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…