Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Paper:

TR11-067 | 25th April 2011 23:15

On Sunflowers and Matrix Multiplication

TR11-067
Authors: Noga Alon, Amir Shpilka, Chris Umans
Publication: 25th April 2011 23:15
Keywords:

Abstract:

We present several variants of the sunflower conjecture of Erd\H{o}s and Rado and discuss the relations among them.

We then show that two of these conjectures (if true) imply negative answers to questions of Coppersmith and Winograd and Cohn et al. regarding possible approaches for obtaining fast matrix multiplication algorithms. Specifically, we show that the Erd\H{o}s-Rado sunflower conjecture (if true) implies a negative answer to the no three disjoint equivoluminous subsets'' question of Coppersmith and Winograd; we also formulate a multicolored'' sunflower conjecture in $\mathbb{Z}_3^n$ and show that (if true) it implies a negative answer to the strong USP'' conjecture of Cohn et al. (although it does not seem to impact a second conjecture in that paper or the viability of the general group theoretic approach). A surprising consequence of our results is that the Coppersmith-Winograd conjecture actually implies the Cohn et al. conjecture.

The multicolored sunflower conjecture in $\mathbb{Z}_3^n$ is a strengthening of the well-known (ordinary) sunflower conjecture in $\mathbb{Z}_3^n$, and we show via our connection that a construction of Cohn et al. yields a lower bound of $(2.51\ldots)^n$ on the size of the largest {\em multicolored} 3-sunflower-free set, which beats the current best known lower bound of $(2.21\ldots)^n$ on the size of the largest 3-sunflower-free set in $\mathbb{Z}_3^n$.

Comment(s):

Comment #1 to TR11-067 | 31st July 2011 11:26

possible typo

Authors: Dennis Farr
Accepted on: 31st July 2011 11:26
Keywords:

Comment:

I think the definition of a k-sunflower in Def 2.1 has a bound variable i on the right hand side which actually needs to be free, which can be done by renaming it something other than i, j, or k, say p.

ISSN 1433-8092 | Imprint