Related papers: Algorithms for the Polar Decomposition in Certain …
We compute the l-modular decomposition matrices of the simple Ree groups 2F4(q^2), where q^2=2^{2n+1} and n is a positive integer, for all primes l > 3 up to some entries in the unipotent characters. Using these matrices we determine the…
In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.
Under the name prime decomposition (pd), a unique decomposition of an arbitrary $N$-dimensional density matrix $\rho$ into a sum of seperable density matrices with dimensions given by the coprime factors of $N$ is introduced. For a class of…
The second-order differential equation describes harmonic oscillators, as well as currents in LCR circuits. This allows us to study oscillator systems by constructing electronic circuits. Likewise, one set of closed commutation relations…
We study the Potts model (defined geometrically in the cluster picture) on finite two-dimensional lattices of size L x N, with boundary conditions that are free in the L-direction and periodic in the N-direction. The decomposition of the…
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.…
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…
Sparse matrix factorization is a popular tool to obtain interpretable data decompositions, which are also effective to perform data completion or denoising. Its applicability to large datasets has been addressed with online and randomized…
We provide a decomposition that is sufficient in showing when a symmetric tridiagonal matrix $A$ is completely positive. Our decomposition can be applied to a wide range of matrices. We give alternate proofs for a number of related results…
In this work, we present a deterministic algorithm for computing the entire weight distribution of polar codes. As the first step, we derive an efficient recursive procedure to compute the weight distribution that arises in successive…
We show how to compute conformal blocks of operators in arbitrary Lorentz representations using the formalism described in arXiv:1905.00036 and arXiv:1905.00434, and present several explicit examples of blocks derived via this method. The…
Given an explicit presentation of a reflection group of rank two (or any rank two group for that matter), we give a simple procedure for calculating all its systems of imprimitivity, when viewed as a matrix group over the quaternions. This…
Operators acting on the discrete random chaos yield signed multiplicative systems, extending the notion of spin matrices and quaternions. We investigate signed groups through the associated sign matrices, focusing on generators and their…
An explicit lattice point realization is provided for the primary components of an arbitrary binomial ideal in characteristic zero. This decomposition is derived from a characteristic-free combinatorial description of certain primary…
In this article we construct and discuss several aspects of the two-component spinorial formalism for six-dimensional spacetimes, in which chiral spinors are represented by objects with two quaternionic components and the spin group is…
Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and $\mathbb{K}[x,y]$ the polynomial ring. The group $\text{SL}_{2}\left(\mathbb{K}[x,y]\right)$ of all matrices with determinant equal to $1$ over $\mathbb{K}[x,y]$…
We propose an algorithm for low rank matrix completion for matrices with binary entries which obtains explicit binary factors. Our algorithm, which we call TBMC (\emph{Tiling for Binary Matrix Completion}), gives interpretable output in the…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…