相关论文: A group-theoretic approach to fast matrix multipli…

We present a non-commutative algorithm for the multiplication of a 2 x 2 block-matrix by its adjoint, defined by a matrix ring anti-homomorphism. This algorithm uses 5 block products (3 recursive calls and 2 general products)over C or in…

Using a ``3 by 3 matrix trick'' we previously showed that multiplication in a C*-algebra A, an algebraic structure, is determined by the geometry of the C*-algebra of the 3 by 3 matrices with entries from A. As an application of this…

For $n>3$, every $n\times n$ partial Cayley matrix with at most $n-1$ holes can be reconstructed by quadrangle criterion. Moreover, the holes can be filled in given order. Without additional assumptions, this is the best possible result.…

We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…

We describe two algorithms for multiplying n x n matrices using time and energy n^2 polylog(n) under basic models of classical physics. The first algorithm is for multiplying integer-valued matrices, and the second, quite different…

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the…

We study the growth of product sets in some finite three-dimensional matrix groups. In particular, we prove two results about the group of $2\times 2$ upper triangular matrices over arbitrary finite fields: a product set estimate using…

In a previous article, an `invariant method' to calculate monomial integrals over the U(n) group was introduced. In this paper, we study the more traditional group-theoretical method, and compare its strengths and weaknesses with those of…

We give a simple combinatorial criterion, in terms of an action on a hyperbolic simplicial complex, for a group to be hierarchically hyperbolic. We apply this to show that quotients of mapping class groups by large powers of Dehn twists are…

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

We show how to represent a class of expressions involving discrete sums over partitions as matrix models. We apply this technique to the partition functions of 2* theories, i.e. Seiberg-Witten theories with the massive hypermultiplet in the…

This thesis is devoted to algorithmic aspects of the implementation of Cartan's moving frame method to the problem of the equivalence of submanifolds under a Lie group action. We adopt a general definition of a moving frame as an…

A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…

We have used the SmallGroups library of groups, together with the computer algebra systems GAP and Mathematica, to search for groups with a three-dimensional irreducible representation in which one of the group generators has a…

For a countable group G = <A | R> presented by its generators A and defining relations R we discuss a simple method to embed G into such a 2-generator group T that the images of generators from A are explicitly given in T, and the defining…

Let $\Lambda = \mathrm{SL}_2(\Bbb Z)$ be the modular group and let $c_n(\Lambda)$ be the number of congruence subgroups of $\Lambda$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log c_n(\Lambda)}{(\log n)^2/\log\log…

This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some of the output variables are also input variables, linked by a linear dependency. Fundamental examples…

Matrix multiplication is a fundamental task in almost all computational fields, including machine learning and optimization, computer graphics, signal processing, and graph algorithms (static and dynamic). Twin-width is a natural complexity…

The article presents results on the well-known problem concerning the structure of integer polynomials $p_n(z; x, y)$, which define multiplication laws in $n$-valued groups $\mathbb{G}_n$ over the field of complex numbers $\mathbb{C}$. We…