Related papers: Near Quadratic Matrix Multiplication Modulo Compos…
In this paper, we have proposed a novel VLSI-oriented approach to computing the rotation matrix entries from the quaternion coefficients. The advantage of this approach is the complete elimination of multiplications and replacing them by…
To a finite quadratic module, that is, a finite abelian group D together with a non-singular quadratic form Q:D --> Q/Z, it is possible to associate a representation of either the modular group, SL(2,Z), or its metaplectic cover, Mp(2,Z),…
Suppose $ m,n\geq 2 $ are co prime integers. We prove certain new symmetries of the base $ n $ representation of $ 1/m $, and in particular characterize the subgroup generated by $ n $ inside $ (\mathbb{Z}/m\mathbb{Z})^\times $. As an…
There are 6 types of 2-dimensional representations in general. For any groups and any monoids, we can construct the moduli of 2-dimensional representations for each type: the moduli of absolutely irreducible representations, representations…
The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization.…
We characterize the generating function of the number of representations described in the title in terms of the theory of modular forms. Appealing to this characterization we obtain explicit formulas for the representation numbers as…
We show that the generating function $\sum_{n\ge0}M_n\,z^n$ for Motzkin numbers $M_n$, when coefficients are reduced modulo a given power of $2$, can be expressed as a polynomial in the basic series $\sum _{e\ge0} ^{} {z^{4^e}}/(…
We determine the representation-finiteness of $A\otimes B$, where both $A$ and $B$ are simply connected algebras with at least three simple modules.
A novel combinatorial formula is developed for for tensor product multiplicities in representation theory. We introduce a difference formula linking these multiplicities to restricted occupancy coefficients via a shifted operator. This…
Let p1, p2,..., pn be distinct prime numbers, and let Nn be their product. We prove that, for any positive integer L that is divisible by the least common multiple of p1 minus one, p2 minus one, and so on, and for integers a1, a2,..., an…
A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, over an arbitrary field. When the degrees of these polynomials are bounded by $n$, the algorithm uses $O(n^{1.43})$ field operations, breaking…
Factorization of an $n\times n$ unitary matrix as a product of $n$ diagonal matrices containing only phases interlaced with $n-1$ orthogonal matrices each one generated by a real vector as well as an explicit form for the Weyl factorization…
We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…
We analyze effective approximation of unitary matrices. In our formulation, a unitary matrix is represented as a product of rotations in two-dimensional subspaces, so-called Givens rotations. Instead of the quadratic dimension dependence…
We consider typical finite dimensional complex irreducible representations of a basic classical simple Lie superalgebra, and give a sufficient condition on when unique factorization of finite tensor products of such representations hold. We…
We analyze the representation of $A^{n}$ as a linear combination of $A^{j},\ 0\leq j\leq k-1,$ where $A$ is a $k\times k$ matrix. We obtain a first order asymptotic approximation of $A^{n}$ as $n\to\infty,$ without imposing any special…
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…
Consider a pair of elements $f$ and $g$ in a commutative ring $Q$. Given a matrix factorization of $f$ and another of $g$, the tensor product of matrix factorizations, which was first introduced by Kn\"orrer and later generalized by…
We construct product formulas for exponentials of commutators and explore their applications. First, we directly construct a third-order product formula with six exponentials by solving polynomial equations obtained using the operator…
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…