相关论文: A constructive algorithm for the Cartan decomposit…
Motivated by connections between algebraic complexity lower bounds and tensor decompositions, we investigate Koszul-Young flattenings, which are the main ingredient in recent lower bounds for matrix multiplication. Based on this tool we…
This work examines the problem to describe an efficient algorithm for obtaining $n^2 \times n^2$ Sudoku matrices. For this purpose, we define the concepts of $n\times n$ $\Pi_n$-matrix and disjoint $\Pi_n$-matrices. The article, using the…
In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are…
A summary of the properties of the Wigner Clebsch-Gordan coefficients and isoscalar factors for the group SU3 in the SU2$\otimes$U1 decomposition is presented. The outer degeneracy problem is discussed in detail with a proof of a conjecture…
We show that the elements of the Kazhdan--Lusztig basis of the spherical Hecke algebra of type $G_2$ have an atomic decomposition. As a by-product, we obtain a new algorithm to compute generalized Kostka--Foulkes polynomials in type $G_2$.
For every simple Hermitian Lie group $G$, we consider a certain maximal parabolic subgroup whose unipotent radical $N$ is either abelian (if $G$ is of tube type) or two-step nilpotent (if $G$ is of non-tube type). By the generalized…
A $1$-factorization of the complete multigraph $\lambda K_{2n}$ is said to be indecomposable if it cannot be represented as the union of $1$-factorizations of $\lambda_0 K_{2n}$ and $(\lambda-\lambda_0) K_{2n}$, where $\lambda_0<\lambda$.…
We consider the problem of developing interpretable and computationally efficient matrix decomposition methods for matrices whose entries have bounded support. Such matrices are found in large-scale DNA methylation studies and many other…
Take a sequence of couples $(G_n,K_n)_n$, where $G_n$ is a group and $K_n$ is a sub-group of $G_n.$ Under some conditions, we are able to give a formula that shows the form of the structure coefficients that appear in the product of…
We study the Grassmann manifold $G_k$ of all $k$-dimensional subspaces of ${\mathbb R}^n$. The Cartan embedding $G_k\subset O(n)$ realizes $G_k$ as a subspace of $Sl_n({\mathbb R})$ and we study the decomposition $G_k=\coprod_w (BwB\cap…
We present a family of solvable multi-matrix models associated with an arbitrary embedded graph $\Gamma$ with a single vertex. The graph with $n$ edges is equipped with $2n$ corner matrices. The partition function of each member of the…
Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for…
This paper is a brief review of recent results on the concept of ``generalized $\tau$-function'', defined as a generating function of all the matrix elements in a given highest-weight representation of a universal enveloping algebra ${\cal…
The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition can handle the challenges of collinearity of factors and different magnitudes of factors; nevertheless, for factorization of an $N$-D tensor of size $I_1\times…
Let H be a reductive subgroup of a reductive group G over an algebraically closed field k. We consider the action of H on G^n, the n-fold Cartesian product of G with itself, by simultaneous conjugation. We give a purely algebraic…
Feynman's diagrammatic series is a common language for a formally exact theoretical description of systems of infinitely-many interacting quantum particles, as well as a foundation for precision computational techniques. Here we introduce a…
Given a semisimple compact Lie group $G$ and a nonzero dominant integral weight $\lambda$, the highest weight $G_q$-modules $V_{n\lambda}$ form a subproduct system of finite dimensional Hilbert spaces. Using a conjectural asymptotic…
The canonical polyadic decomposition (CPD) is a fundamental tensor decomposition which expresses a tensor as a sum of rank one tensors. In stark contrast to the matrix case, with light assumptions, the CPD of a low rank tensor is…
We present an algorithm which given a presentation of a group $G$ without 2-torsion, a solution to the word problem with respect to this presentation, and an acylindricity constant ${\kappa}$, outputs a collection of tracks in an…
A general method is described for finding algebraic expressions for matrix elements of any one- and two-particle operator for an arbitrary number of subshells in an atomic configuration, requiring neither coefficients of fractional…