A Factorization Algorithm for G-Algebras and Applications

It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to find all distinct factorizations of a given element $f \in \mathcal{G}$, where $\mathcal{G}$ is any $G$-algebra, with minor assumptions on the underlying field. Moreover, the property of being an FFD, in combination with the factorization algorithm, enables us to propose an analogous description of the factorized Gr\"obner basis algorithm for $G$-algebras. This algorithm is useful for various applications, e.g. in analysis of solution spaces of systems of linear partial functional equations with polynomial coefficients, coming from $\mathcal{G}$. Additionally, it is possible to include inequality constraints for ideals in the input

Basic Module Theory over Non-Commutative Rings with Computational Aspects of Operator Algebras

The present text surveys some relevant situations and results where basic Module Theory interacts with computational aspects of operator algebras. We tried to keep a balance between constructive and algebraic aspects.Comment: To appear in the Proceedings of the AADIOS 2012 conference, to be published in Lecture Notes in Computer Scienc

Factorization of Z-homogeneous polynomials in the First (q)-Weyl Algebra

We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be almost completely reduced to commutative univariate factorization over the same base field with some additional uncomplicated combinatorial steps. This allows to deduce the complexity of our algorithms in detail. Furthermore, we will show for homogeneous polynomials that irreducibility in the polynomial first Weyl algebra also implies irreducibility in the rational one, which is of interest for practical reasons. We report on our implementation in the computer algebra system \textsc{Singular}. It outperforms for homogeneous polynomials currently available implementations dealing with factorization in the first Weyl algebra both in speed and elegancy of the results.Comment: 26 pages, Singular implementation, 2 algorithms, 1 figure, 2 table

Factorizations of Elements in Noncommutative Rings: A Survey

We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include unique factorization up to order and similarity, 2-firs, and modular LCM domains, as well as UFRs and UFDs in the sense of Chatters and Jordan and generalizations thereof. We recall arithmetical invariants for the study of non-unique factorizations, and give transfer results for arithmetical invariants in matrix rings, rings of triangular matrices, and classical maximal orders as well as classical hereditary orders in central simple algebras over global fields.Comment: 50 pages, comments welcom

Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Polynomial Transforms Based on Induction

A polynomial transform is the multiplication of an input vector x\in\C^n by a matrix \PT_{b,\alpha}\in\C^{n\times n}, whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials p_\ell(x)\in\C[x] from a list $b=\{p_0(x),\dots,p_{n-1}(x)\}$ and sample points \alpha_k\in\C from a list $\alpha=\{\alpha_0,\dots,\alpha_{n-1}\}$. Such transforms find applications in the areas of signal processing, data compression, and function interpolation. Important examples include the discrete Fourier and cosine transforms. In this paper we introduce a novel technique to derive fast algorithms for polynomial transforms. The technique uses the relationship between polynomial transforms and the representation theory of polynomial algebras. Specifically, we derive algorithms by decomposing the regular modules of these algebras as a stepwise induction. As an application, we derive novel $O(n\log{n})$ general-radix algorithms for the discrete Fourier transform and the discrete cosine transform of type 4.Comment: 19 pages. Submitted to SIAM Journal on Matrix Analysis and Application

On the Exponentials of Some Structured Matrices

In this note explicit algorithms for calculating the exponentials of important structured 4 x 4 matrices are provided. These lead to closed form formulae for these exponentials. The techniques rely on one particular Clifford Algebra isomorphism and basic Lie theory. When used in conjunction with structure preserving similarities, such as Givens rotations, these techniques extend to dimensions bigger than four.Comment: 19 page