A Short Note on Disjointness Conditions for Triples of Group Subsets Satisfying the Triple Product Property

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, 3 figures

Scientific paper

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 property TPP for a triple of group subsets, called a TPP triple, allows the group to "realize" matrix multiplication of dimensions the sizes of the subsets, with the subsets acting as indexing sets for input matrices which are embedded into the regular algebra of the group. We derive nine different disjointness casetypes for an arbitrary TPP triple, and classify these into four different disjointness classes based on an integer measure of the degree of pairwise disjointness among the subsets. Finally, we derive lower and upper bounds for the sum of sizes of the subsets forming a TPP triple, which is the additive equivalent of the multiplicative bounds originally derived by Cohn and Umans for the product of sizes of subsets forming a TPP triple.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Short Note on Disjointness Conditions for Triples of Group Subsets Satisfying the Triple Product Property does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Short Note on Disjointness Conditions for Triples of Group Subsets Satisfying the Triple Product Property, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Short Note on Disjointness Conditions for Triples of Group Subsets Satisfying the Triple Product Property will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-233678

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.