Related papers: A new algorithm for computing idempotents of R-tri…
We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are…
Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific…
This paper presents a powerfull method to integrate general monomials on the classical groups with respect to their invariant (Haar) measure. The method has first been applied to the orthogonal group in [J. Math. Phys. 43, 3342 (2002)], and…
For any orbifold M, we explicitly construct a simplicial complex S(M) from a given triangulation of the `coarse' underlying space together with the local isotropy groups of M. We prove that, for any local system on M, this complex S(M) has…
Let R be a commutative ring with identity and S be a multiplicatively closed subset of R. The aim of this paper is to introduce the notion of fully S-idempotent modules as a generalization of fully idempotent modules and investigate some…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
We compute the integral cohomology of the minimal non-trivial nilpotent orbit in a complex simple (or quasi-simple) Lie algebra. We find by a uniform approach that the middle cohomology group is isomorphic to the fundamental group of the…
We present an algorithm for computing circuit polynomials in the algebraic rigidity matroid $\mathcal{A}(\text{CM}_n)$ associated to the Cayley-Menger ideal CM$_n$ for $n$ points in 2D. It relies on combinatorial resultants, a new operation…
Let $G$ be a group and let $R$ be a $G$-graded ring. We show that a nonzero central idempotent in $R$ has finite support group in two broad settings: when $G$ is abelian, and when $G$ is arbitrary but the grading satisfies a certain…
Let $G$ be a finite solvable group. Then $G$ always has a useful presentation, which we call a "long presentation". Using a "long presentation" of $G$, we present an inductive method of constructing the irreducible representations of $G$…
Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…
We consider orthogonal polynomials with respect to a linear differential operator $$\mathcal{L}^{(M)}=\sum_{k=0}^{M}\rho_{k}(z)\frac{d^k}{dz^k}, $$ where $\{\rho_k\}_{k=0}^{M}$ are complex polynomials such that $deg[\rho_k]\leq k, 0\leq k…
A multidimensional extremal problem in the idempotent algebra setting is considered which consists in minimizing a nonlinear functional defined on a finite-dimensional semimodule over an idempotent semifield. The problem integrates two…
Consider two non-degenerate algebras B and C over the complex numbers. We study a certain class of idempotent elements E in the multiplier algebra of the tensor product of B with C, called separability idempotents. The conditions include…
Formulas for the primitive idempotents of the trivial source algebra, in characteristic zero, have been given by Boltje and Bouc--Th\'{e}venaz. We shall give another formula for those idempotents, expressing them as linear combinations of…
We define pullback and separated presentations of modules over pullback rings, and, if the ring is a pullback of epimorphisms over a semisimple ring, an algorithm reducing such a presentation of a module to an $R$-diagram. The latter is the…
In the first part of this paper we present explicit formulas for primitive idempotents in arbitrary Frobenius algebras using the entries of representing matrices coming from projective indecomposable modules with respect to a certain choice…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
The ring of Witt vectors associated to a ring R is a classical tool in algebra. We introduce a ring C(R) which is more easily constructed and which is isomorphic to the ring of Witt vectors W(R) for a perfect F_p-algebra R. It is obtained…
Orthogonal signal-division multiplexing (OSDM) is an attractive alternative to conventional orthogonal frequency-division multiplexing (OFDM) due to its enhanced ability in peak-to-average power ratio (PAPR) reduction. Combining OSDM with…