相关论文: Factorization of Unitary Matrices
The construction of a generic representation of $g\ell(n+1)$ or of the trigonomentric deformation of its enveloping algebra known as algebraic induction is conveniently formulated in term of Lax matrices. The Lax matrix of the constructed…
In this article we study decreasing and increasing factorisations of the cycle, which are decompositions of the cycle $(1~2\dots n)$ into a product of $n-1$ transpositions satisfying monotonicity conditions. We explicit a bijection between…
We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…
We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.
We propose a generalization of the factorization method to the case when $\mathcal{G}$ is a finite dimensional Lie algebra such that $\mathcal{G}=\mathcal{G}_0\oplus M \oplus N$ (direct sum of vector spaces), where $\mathcal{G}_0$ is a…
We determine when a generalized down-up algebra is a Noetherian unique factorisation domain or a Noetherian unique factorisation ring.
We establish correspondances between factorisations of finite abelian groups (direct factors, unitary factors, non isomorphic subgroup classes) and factorisations of integer matrices. We then study counting functions associated to these…
A unified approach to parametrization of the mixing matrix for $N$ generations is developed. This approach not only has a clear geometrical underpinning but also has the advantage of being economical and recursive and leads in a natural way…
A new effective method for factorization of a class of nonrational $n\times n$ matrix-functions with \emph{stable partial indices} is proposed. The method is a generalization of the one recently proposed by the authors which was valid for…
We investigate tensor products of matrix factorisations. This is most naturally done by formulating matrix factorisations in terms of bimodules instead of modules. If the underlying ring is C[x_1,...,x_N] we show that bimodule matrix…
The paper introduces the butterfly factorization as a data-sparse approximation for the matrices that satisfy a complementary low-rank property. The factorization can be constructed efficiently if either fast algorithms for applying the…
We study the matrix factorizations defined by the generic plane projections of a curve singularity of $\mathbb{C}^3$. On the other hand, given a plane curve singularity $Y\subset \mathbb{C}^2$ we study the family of matrix factorizations…
A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.
In this article we obtain a result about the uniqueness of factorization in terms of conjugates of the matrix $U=(\xymatrix{1 & 1 0 & 1})$, of some matrices representing the conjugacy classes of those elements of $SL(2,Z)$ arising as the…
An analytic proof is proposed of Wiener's theorem on factorization of positive definite matrix-functions.
An $F$-algebra $A$ with unit $1$ is said to be a locally matrix algebra if an arbitrary finite collection of elements $a_1,$ $\ldots,$ $a_s $ from $ A$ lies in a subalgebra $B$ with $1$ of the algebra $A$, that is isomorphic to a matrix…
We prove that every holomorphic symplectic matrix can be factorized as a product of holomorphic unitriangular matrices with respect to the symplectic form $ \left[\begin{array}{ccc} 0 & L_n \\ -L_n & 0\end{array}\right]$ where $L$ is the $n…
We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending work of Biane. We deduce from our result a…
Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors…
This paper presents an adaptive randomized algorithm for computing the butterfly factorization of a $m\times n$ matrix with $m\approx n$ provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The…