English
Related papers

Related papers: A note on the Triple Product Property subgroup cap…

200 papers

In 2003 COHN and UMANS introduced a group-theoretic approach to fast matrix multiplication. This involves finding large subsets S, T and U of a group G satisfying the Triple Product Property (TPP) as a means to bound the exponent $\omega$…

Group Theory · Mathematics 2011-05-12 Ivo Hedtke

In 2003 COHN and UMANS introduced a group-theoretic approach to fast matrix multiplication. This involves finding large subsets of a group $G$ satisfying the Triple Product Property (TPP) as a means to bound the exponent $\omega$ of matrix…

Group Theory · Mathematics 2015-03-25 Ivo Hedtke

A number of upper bounds are proved relating to the triple product property (TPP) for subgroups of finite nilpotent groups of class $2$. The TPP is the property defined for three non-empty subsets $S, T, U$ of a group $G$ that the group…

Group Theory · Mathematics 2026-02-18 Sandeep R. Murthy

We describe certain special consequences of certain elementary methods from group theory for studying the algebraic complexity of matrix multiplication, as developed by H. Cohn, C. Umans et. al. in 2003 and 2005. The measure of complexity…

Data Structures and Algorithms · Computer Science 2026-01-01 Sandeep Murthy

Three non-empty subsets $S,T,U$ of a group $G$ are said to satisfy the triple product property (TPP) if, for elements $s,s' \in S$, and $t,t' \in T$, and $u,u' \in U$, the equation $s's^{-1}t't^{-1}u'u^{-1}=1$ holds if and only if $s = s'$,…

Group Theory · Mathematics 2026-01-12 Sandeep R. Murthy

We deduce some elementary pairwise disjointness and semi-disjointness conditions on triples of subsets in arbitrary groups satisfying the so-called triple product property (TPP) as originally defined by H. Cohn and C. Umans in 2003. This…

Group Theory · Mathematics 2025-12-30 Sandeep Murthy

A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…

Computational Complexity · Computer Science 2009-02-17 Richard Strong Bowen , Bo Chen , Hendrik Orem , Martijn van Schaardenburg

We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…

Combinatorics · Mathematics 2021-01-26 Ilya D. Shkredov

The Cohn-Umans (FOCS '03) group-theoretic framework for matrix multiplication produces fast matrix multiplication algorithms from three subsets of a finite group $G$ satisfying a simple combinatorial condition (the Triple Product Property).…

Group Theory · Mathematics 2025-08-20 Jonah Blasiak , Henry Cohn , Joshua A. Grochow , Kevin Pratt , Chris Umans

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Combinatorics · Mathematics 2008-06-23 Jozsef Solymosi

In this short note, we compute higher extension groups for all irreducible representations and deduce the multiplicity formula for finite length representations in triple product case.

Number Theory · Mathematics 2023-03-13 Li Cai , Yangyu Fan

This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…

Data Structures and Algorithms · Computer Science 2021-10-05 François Le Gall

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…

Combinatorics · Mathematics 2020-05-12 Brendan Murphy , James Wheeler

The semi-tensor product (STP) of matrices is extended to the STP of hypermatrices. Some basic properties of the STP of matrices are extended to the STP of hypermatrices. The hyperdeterminant of hypersquares is introduced. Some algebraic and…

Systems and Control · Electrical Eng. & Systems 2023-03-14 Daizhan Cheng , Xiao Zhang , Zhengping Ji

In recent years some near-optimal estimates have been established for certain sum-product type estimates. This paper gives some first extremal results which provide information about when these bounds may or may not be tight. The main tool…

Combinatorics · Mathematics 2014-10-07 Oliver Roche-Newton , Dmitry Zhelezov

We give a new bound on colinear triples in subgroups of prime finite fields and use it to give some new bounds on exponential sums with trinomials.

Number Theory · Mathematics 2017-10-19 Simon Macourt , Ilya D. Shkredov , Igor E. Shparlinski

We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.

Group Theory · Mathematics 2015-02-10 Joachim König

We consider the capability of $p$-groups of class two and odd prime exponent. The question of capability is shown to be equivalent to a statement about vector spaces and linear transformations, and using the equivalence we give proofs of…

Group Theory · Mathematics 2009-01-19 Arturo Magidin

We present a new method to bound the cardinality of triple product sets in groups and give three applications. A new and unexpectedly short proof of the Plunnecke-Ruzsa sumset inequalities for Abelian groups. A new proof of a theorem of Tao…

Combinatorics · Mathematics 2013-09-10 Giorgis Petridis

The coexponent of a finite p-group is introduced and we consider how the nilpotency class is bounded in terms of this invariant.

Group Theory · Mathematics 2007-05-23 Paul J. Sanders , Tom S. Wilde
‹ Prev 1 2 3 10 Next ›