相关论文: A group-theoretic approach to fast matrix multipli…
The article considers arrowhead and diagonal-plus-rank-one matrices in F^(nxn) where F in R,C or H. H is a non-commutative field of quaternions. We give unified formulas for fast matrix-vector multiplications, determinants, and inverses for…
We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…
Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by the matrix multiplication exponent $\omega$, is a central problem in algebraic complexity theory. The best upper bounds on $\omega$, leading…
Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…
An equivalence relation in the symmetric group, where is a positive integer has been considered. An algorithm for calculation of the number of the equivalence classes by this relation for arbitrary integer has been described.
Over an algebraically closed base field $k$ of characteristic 2, the ring $R^G$ of invariants is studied, $G$ being the orthogonal group O(n) or the special orthogonal group SO(n) and acting naturally on the coordinate ring $R$ of the…
Let S be a principally embedded sl_2 subalgebra in sl_n for n > 2. A special case of results of the third author and Gregg Zuckerman implies that there exists a positive integer b(n) such that for any finite-dimensional irreducible sl_n…
We provide a new tableau model from which one can easily deduce the characters of finite-dimensional irreducible polynomial representations of the special orthogonal group $SO_n(\mathbb{C})$. This model originates from the representation…
This is an exercise based approach to matrix groups. The idea is to collect a bunch of exercises at one place which anyone with basic knowledge of linear algebra can attempt to solve and learn matrix groups and algebraic groups.
Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…
Duan, Wu and Zhou (FOCS 2023) recently obtained the improved upper bound on the exponent of square matrix multiplication $\omega<2.3719$ by introducing a new approach to quantify and compensate the ``combination loss" in prior analyses of…
An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…
Let K be a field of positive characteristic p, let R be either a group algebra K[G] or a restricted enveloping algebra u(L), and let I be the augmentation ideal of R. We first characterize those R for which I satisfies a polynomial identity…
It is widely known that the lower bound for the algorithmic complexity of square matrix multiplication resorts to at least $n^2$ arithmetic operations. The justification builds upon the following reasoning: given that there are $2 n^2$…
It is known that the multiplication of an $N \times M$ matrix with an $M \times P$ matrix can be performed using fewer multiplications than what the naive $NMP$ approach suggests. The most famous instance of this is Strassen's algorithm for…
We show how one can use non-prime-power, composite moduli for computing representations of the product of two $n\times n$ matrices using only $n^{2+o(1)}$ multiplications.
In this paper, we give a method to construct "good" exponential families systematically by representation theory. More precisely, we consider a homogeneous space $G/H$ as a sample space and construct an exponential family invariant under…
The mapping class group of a surface with one boundary component admits numerous interesting representations including as a group of automorphisms of a free group and as a group of symplectic transformations. Insofar as the mapping class…
When the boundary of a familiar object is shown by a series of isolated dots, humans can often recognize the object with ease. This ability can be sustained with addition of distracting dots around the object. However, such capability has…
Given a group G and positive integers k,n, we let B_n=B_n(G) denote the set of all elements x in G such that |x^G|\leq n, and we say that G satisfies the (k,n)-covering condition for commutators if there is a subset S in G such that |S|\leq…