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

Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

We present a fast algorithm for modular exponentiation when the factorization of the modulus is known. Let $a,n,m$ be positive integers and suppose $m$ factors canonically as $\prod_{i=1}^k p_i^{e_i}$. Choose integer parameters $t_i\in [1,…

Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting…

Let $\Gamma$ be a non-commutative free group on finitely many generators. In a previous work two of the authors have constructed the class of multiplicative representations of $\Gamma$ and proved them irreducible as representation of…

The orthogonal group acts on the space of several $n\times n$ matrices by simultaneous conjugation. For an infinite field of characteristic different from two, relations between generators for the algebra of invariants are described. As an…

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

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

Algebraic matrix multiplication algorithms are designed by bounding the rank of matrix multiplication tensors, and then using a recursive method. However, designing algorithms in this way quickly leads to large constant factors: if one…

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

In this paper, we present novel deterministic algorithms for multiplying two $n \times n$ matrices approximately. Given two matrices $A,B$ we return a matrix $C'$ which is an \emph{approximation} to $C = AB$. We consider the notion of…

The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…

For an arbitrary countable group G = <A|R> given by its generators A and defining relations R we discuss a specific method for embedding of G into a certain 2-generator group T. Our embedding explicitly lists the images of generators from A…

Branching of symplectic groups is not multiplicity-free. We describe a new approach to resolving these multiplicities that is based on studying the associated branching algebra $B$. The algebra $B$ is a graded algebra whose components…

We give a method to construct new self-adjoint representations of the braid group. In particular, we give a family of irreducible self-adjoint representations of dimension arbitrarily large. Moreover we give sufficient conditions for a…

We obtain an explicit characterization of the stable points of the action of G=SL(2,C) on the cartesian product G^n by simultaneous conjugation on each factor, in terms of the corresponding invariant functions, and derive from it a simple…

This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…

We consider the capability of $p$ groups of class two and odd prime exponent. We use linear algebra and counting arguments to establish a number of new results. In particular, we settle the 4-generator case, and prove a sufficient condition…

We study the trace set of the commutator subgroup of $\Gamma(2),$ a type of Local-Global problem about thin groups. We determine the local obstructions and then use the correspondence between binary quadratic forms and hyperbolic matrices…

We prove that, for every integer $n \ge 2$, a finite or infinite countable group $G$ can be embedded into a 2-generated group $H$ in such a way that the solvability of quadratic equations of length at most $n$ is preserved, i.e., every…