相关论文: A constructive algorithm for the Cartan decomposit…
A constructive approach to get the reduced row echelon form of a given matrix $A$ is presented. It has been shown that after the $k$th step of the Gauss-Jordan procedure, each entry $a^k_{ij}(i<>j; j > k)$ in the new matrix $A^k$ can always…
Let $G$ be a linearly reductive group acting on a vector space $V$, and $f$ a (semi-)invariant polynomial on $V$. In this paper we study systematically decompositions of the Bernstein-Sato polynomial of $f$ in parallel with some…
We consider exact matrix decomposition by Gauss-Bareiss reduction. We investigate two aspects of the process: common row and column factors and the influence of pivoting strategies. We identify two types of common factors: systematic and…
The Lie algebra of the classical group SU(2) is constructed from two quon algebras for which the deformation parameter is a common root of unity. This construction leads to (i) a not very well-known polar decomposition of the ladder…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
Our main goal is to compute the decomposition of arbitrary Kronecker powers of the Harmonics of $S_n$. To do this, we give a new way of decomposing the character for the action of $S_n$ on polynomial rings with $k$ sets of $n$ variables.…
We develop the generalized Cartan Calculus for the groups $G=$SL$(2,\mathbb{R})\times\mathbb{R}^+$, SL$(5,\mathbb{R})$ and SO(5,5). They are the underlying algebraic structures of $d=9,7,6$ exceptional field theory, respectively. These…
We first present a filtration on the ring L of Laurent polynomials such that the direct sum decomposition of its associated graded ring gr L agrees with the direct sum decomposition of gr L, as a module over the complex general linear Lie…
Building on advanced results on permutations, we show that it is possible to construct, for each irreducible representation of SU(N), an orthonormal basis labelled by the set of {\it standard Young tableaux} in which the matrix of the…
An algebraic structure, Quotient Algebra Partition or QAP, is introduced in a serial of articles. The structure QAP is universal to Lie Algebras and enables algorithmic and exhaustive Cartan decompositions. The first episode draws the…
We consider LU and QR matrix decompositions using exact computations. We show that fraction-free Gauss--Bareiss reduction leads to triangular matrices having a non-trivial number of common row factors. We identify two types of common…
A new algorithm for the efficient numerical approximation of weakly singular integrals over convex polytopes is introduced. Such integrals appear in the Galerkin discretizations of integral equations and nonlocal partial differential…
We construct explicit Drinfel'd twists for the generalized Cartan type $H$ Lie algebras in characteristic $0$ and obtain the corresponding quantizations and their integral forms. Via making modular reductions including modulo $p$ reduction…
We derive a full Bern-Kosower-type rule for scalar QED starting from quantum field theory: we derive a set of rules for calculating $S$-matrix elements for any processes at any order of the coupling constant. Gauge-invariant set of diagrams…
We present quantum circuits with a brick wall structure using the optimal number of parameters and two-qubit gates to parametrize $SU(2^n)$, and provide evidence that these circuits are universal for $n\leq 5$. For this, we successfully…
Let $G_n$ denote either the group $SO(2n+1, F)$, $Sp(2n, F)$, or $GSpin(2n+1, F)$ over a non-archimedean local field of characteristic different than two. We determine all composition factors of degenerate principal series of $G_n$, using…
A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…
This paper presents a unified formulation for synthesizing the generalized scattering matrix (GS-matrix) of hybrid electromagnetic systems comprising arbitrary numbers of antennas and scatterers. The proposed method provides a modular…
We provide a computational framework for approximating a class of structured matrices; here, the term structure is very general, and may refer to a regular sparsity pattern (e.g., block-banded), or be more highly structured (e.g., symmetric…
The proposed article aims at offering a comprehensive tutorial for the computational aspects of structured matrix and tensor factorization. Unlike existing tutorials that mainly focus on {\it algorithmic procedures} for a small set of…