The main purpose of this post is to start a new research thread for Polymath 10 dealing with the Erdos-Rado Sunflower problem. (Here are links to post 2 and post 1.) Here is a very quick review of where we are.

Let [] be the maximum size of a family of -sets [balanced family] with no sunflower of size . Let and .

### Philip Gibbs: The balanced case vs. the general case.

Phillip gave a beautiful construction showing that if is finite than . This is very interesting and I found it surprising. (Earlier we only knew that .) Of course, if you can find another construction which starts with balanced families (even only those constructed by Philip) and end with exponentially larger general families (you can even enlarge k a little,) this will provide a counterexample to the Erdos-Rado conjecture.

### The homological approach:

In the previous post and some comments (like this comment and the following ones; and this comment) I continued to meditate about my homological approach. For we want to show that for balanced families, a (2m,m)-cycle will contain a sunflower with head of size smaller than m. (This will now give .) Juggeling between the homological notion of (b,c)-cycles and a combinatorial one can be useful.

### Proposals by Tim:

Tim observed that if all pairwise intersections between sets in a sunflower free family have the same size then this leads to exponential upper bounds. This can be a starting point for an argument where “same size” is replaced by a weaker condition, or to ideas about how to construct a counterexample.

### Random sunflower-free families

We also want to understand the expected number of sets in the sunflower-free process when we consider k-subsets fron [n]. (We would also like to understand the expected size of the union of sets in the resulting family.) This is interesting both for the general case and the balanced case. Simulations by Philip (e.g. here) and by Gonzalo (e.g. here) were presented. (I am still confused about the outcomes of the simulations, maybe we shoud run more simulations.)

### New examples

In the later comments to the previous thread (starting here) that I did not digest yet, Philip offered some ideas on new constructions of various types.

### Some more comments and questions

Avi Wigderson asked: Is it enough to prove the Erdos-Rado conjecture for ? ? etc? Dömötör asked the following Kneser-type coloring question:

How many colors to we need to color all k-tuples of an n element set avoiding monochromatic 3-sunflowers?

### The special case mentioned by Shachar:

Shachar mentioned in comments to post I (starting here) an exciting special case (related to matrix multiplication.)

### Looking at the classic papers:

It can be a good time to look at the classic papers by Abott, Hanson, and Sauer and , Spencer and Kostochka (for the general case; for sunflower of size three). Here is again the link for Kostochka’s survey. There are many other papers (even recent) about sunflowers and many aspect of the problem and related problems that we did not talk about.

Here are the six pages of Joel’s paper.

Reading your post made me think of a reformulation, though it doesn’t feel new and may have been mentioned in one of your posts or one of the comments on them.

Suppose we have a collection of -sets . Let us think of each as a characteristic function mod 3. Then a sunflower corresponds to three sets such that takes values 0 and 1. So we have a collection of sets and the statement that it is 3-sunflower free is an arithmetic condition about the sumset mod 3. If all the sets belong to , then we want a collection of elements of where every element of has support size and .

So it’s just conceivable that some kind of additive combinatorial techniques could be brought to bear. Unfortunately, the condition that the supports have size is not very nice.

That was what I observed too. I also thought that it can be reformulated as an analytic question. Similarly make characteristic vectors for each set, then the sunflower problem becomes finding three different vectors such that s (u,v,w)=u•v+v•w+w•u-3u•v•w=0, (here u•v•w represents sum of coordinate wise products.) This can be generalized to a collection of vectors with coordinates in interval [0,1], bounded size (number of element condition),and some distance condition(distinguishing condition), then the problem is finding vectors such that s (u,v,w)<1

There are two natural weakenings of the question. One is to drop the condition that the sets have size . So now one would be asking how large a subset of (regarded as a subset of ) is it possible to have with no solution to . This is strongly reminiscent of the cap-set problem, but there are two differences: we restrict and to , and instead of forbidding to equal 0 we forbid it to belong to .

Another thing we could do is drop the first of these conditions, and merely ask how big a subset of one can find such that .

Obviously these variants won’t directly solve the sunflower question, but they seem close enough to it to be worth thinking about.

the case dropping the size condition, I got a exponential lower bound (with respect to the background set) by a simple probabilistic argument. If I havent made mistake, for 3-sunflower case, we can get a constant times (1-2/(3 sqrt (3)))^(-n/3) lower bound. I guess the maximum is also exponential

Ah, it was just obviously exponential. 2^n. I was a fool

Get random subsets X_1,..,X_k of [n] by involving each element with a probability 0<p<1.

I'll directly calculate the probability of X_1,…,X_k forming a k-sunflower.

First, given S⊂[n] (|S|=s), T⊂[n]\S (|T|=t) calculate probability P_{S,T} of S to be the core of sunflower, and T=∪(X_i\S). (Thus, X_i\S are disjoint).

By an easy induction, it can be seen that there are k^t choice of multiple (X_i\S).(ordered partition of T into k sets). Given a multiple, let t_i=|X_i\S|. We have \sum t_i=t. Then

Then Since the events of P_{S,T} are disjoint, (desired probability)=

We want to minimize the value Differentiating, it follows that where gives minimum. at this case, the probability becomes . Let we have m random subsets of [n]. We have (m choose k) of above event we calculated. And the probability that considerable amount of the sets are equall is so small. Using lovasz local lemma, we can get a lower bound around a constant of

Let me mention that there are some connections between the sunflower conjecture and the cup set conjecture, and also that there is an important variant of the sunflower conjecture (The weak sunflower conjecture by Erdos and Szemeredi)that does not refer to

k. See this post Cap Sets, Sunflowers, and Matrix multiplication, describing briefly the paperOn sunflowers and matrix multiplicationby Noga Alon, Amir Spilka, and Christopher Umens, which rely on an earlier paperGroup-theoretic algorithms for matrix multiplication, by Henry Cohn, Robert Kleinberg, Balasz Szegedy, and Christopher Umans .The paper describes a subtle implication diagram of conjectures which make it very challenging to guess the truth.

When I was mentioning the above work of Cohn et al shacharlovett commented on it. As a a non-expert in this field, I am puzzled about the status of this paper. Is it peer reviewed and published?

Pingback: attack on/ of the sunflowers! | Turing Machine

Another approach. Think about this much much easier problem.

Let’s call {X_1,…,X_i} (i≥3) a circular sunflower if C=X_1∩X_2=X_2∩X_3=…=X_{i-1}∩X_i=X_i∩X_1,

and C the core of it.

Let |X_i|=k (i=1,..,n) and ∪X_i=[m] a family without any circular sunflower.

For A⊂[m], |A|≤k, Let G_A be the graph whose vertex set is the set

of X_i containing A, and two vertices are connected iff their intersection is exactly A.

Let |V(G_A)|=n_A, |E(G_A)|=e_A.

By the cicular sunflower-free condition, all these graphs become forests,

so we get e_A≤n_A. From two double counting arguments, we get

n(n-1)/2=\sum e_A≤\sum n_A=n*2^k, n≤1+2^{k+1}.

But obviously, for sunflowers, this cannot be applied, since even complete

bipartite can be possible for G_A, there’re no limits on number of edges.

But we do have some restrictions.

The graphs G_A, can be seen as ‘disjointness’ of some sets.

For disjointness graphs, there is a theorem by Bollobas(Gowers’ supervisor, right?).

The theorem says,

|A_i|=a, |B_i|=b (i=1,…,n), A_i∩B_i are all disjoint, (A_i, B_j) intersects for all i≠j

implies n<(a+b-2 choose a-1).

I expect this is not the only restriction for disjointness graphs.

And I think it will be worth seeking for those.

But the fact is that only these relations for individual graphs are not enough.

(Worst case, all could be complete bipartite, give no useful inequality)

But hopefully, there seems to be some useful relation 'between' the G_A s.

For example, if A⊂B, V(G_B) becomes an edge indpendent subset of V(G_A).

Summing up these and possibly more relations, I hope we can do something

Does anybody know about some structural results on graphs with no k-cliques?

Perhaps this paper might be of interest?

Click to access dm090108.pdf

Yeah anything related to it can be helpful. Thank you.

If , , are all disjoint, intersects for all

then .

How did you get ?

count such that is a subset of in two different way.

Nice!

Going back to the homological approach. I think one challenge would be to understand well the situation for (2,2)-cycles. The claim is that for balanced families a (2,2) cycle contains two sets whose intersection is either empty or has exactly one element in common. Actually I claimed https://gilkalai.wordpress.com/2015/11/11/polymath10-post-2-homological-approach/#comment-22682 that an inductive argument applies (and even to the (b,b)-case). I dont see the argument now but it is late and I will come to it tomorrow. So the plan (mainly for myself, I suppose) would be

1) (2,2) by induction; then (b,b) by induction (for combinatorial cycles)

2) Alternative understanding (2,2) algebraically in terms of homologies of links.

3) combinatorial (4,2) cycles contain a sunflower of size 3 with head of size at most 1.

Indeed the (b,b) case is easy by induction. For combinatorial cycles: (b,b) cycle of b-sets is simply a collection of more than one set of size b. (b,b)-cycles of k-sets for is a collection so that every link of a vertex is a (b,b)-cycle. We need to show that a balanced collection of k sets which is a (b b) cycle has two sets with intersection smaller than b. This is obvious for b=k because there a (b,b) cycle has more than one set. We apply it by induction to a link of a vertex. We find in the links two sets with intersection smaller than b. There is nothing to do unless the intersection in the link has b-1 elements. Adding the linked vertex this gives us two sets A and B whose intersection T is of size b. Now C=A\B has k-b elements and its link being a (b,b)-cycle must contain another set T’. The elements of T and T’ are colored with the same colors so T’ is disjoint from B\A. If A’ = A \B union T’ then A’ is in the family and its intersection with B has less than b elements.

As I said an additional task even for the (2,2) case is to give another derivation which gives a (2,2) conclusion based on “(1,1) properties” for the family and links.

I suppose our next task is to show that a family of k-sets which is a combinatorial (4,2)-cycle must contain a sunflower of size 3 with head of size 0 and 1.

For k=2 a combinatorial (4,2) cycle is a collection with more than 6 pairs. For larger k we need to assume that the link of every set of size (k-2) has more than 6 pairs. (In other words, every set of size (k-2) is included in no k-set or in more than 6 k-sets from the family.)

Any volunteers to try to show it?

(I volunteered myself, but I don’t see an inductive argument.)

I wanted to propose a computer program to be written that searches for symmetric constructions for small values. What I mean by symmetric is that for r=3 and small k, all the best known families are such that they are on just a few elements and the sets of the family can be obtained from each other through applying a small permutation group to the elements. So for example, for k=4, one could try to search for an intersecting sunflower-free family on 10 elements by enumerating all permutation groups of size at most 30 or so, and check whether they yield a solution. Unfortunately, I really have no clue how many such groups there are and I don’t have enough confidence in my coding skills to attempt to write such a program, but maybe someone else is more talented.

I’d like to do more computer searches but am otherwise occupied right now.

One idea was to continue the random approach but as well as adding random sets until no more can be added you can then randomly delete some and try to replace with more.

Another idea more similar to the symmetry one is to do a search for linkwise complete families, i.e. where each link (defined earlier as subfamilies sharing a subset with that subset removed) is maximal/complete. Most of the biggest families take this form and it may be possible to build them up efficiently by joining together families with smaller k.

THE P VERSUS NP PROBLEM

We define an interesting problem called $MAS$. We show $MAS$ is actually a succinct version of the well known $\textit{NP–complete}$ problem $\textit{SUBSET–PRODUCT}$. When we accept or reject the succinct instances of $MAS$, then we are accepting or rejecting the equivalent and large instances of $\textit{SUBSET–PRODUCT}$. Moreover, we show $MAS \in \textit{NP–complete}$.

In our proof we start assuming that $P = NP$. But, if $P = NP$, then $MAS$ and $\textit{SUBSET–PRODUCT}$ would be in $\textit{P–complete}$, because all currently known $\textit{NP–complete}$ are $\textit{NP–complete}$ under logarithmic-space reduction including our new problem $MAS$. A succinct version of a problem that is complete for $P$ can be shown not to lie in $P$, because it will be complete for $EXP$. Indeed, in Papadimitriou’s book is proved the following statement: “$NEXP$ and $EXP$ are nothing else but $P$ and $NP$ on exponentially more succinct input”. Since $MAS$ is a succinct version of $\textit{SUBSET–PRODUCT}$ and $\textit{SUBSET–PRODUCT}$ would be in $\textit{P–complete}$, then we obtain that $MAS$ should be also in $\textit{EXP–complete}$.

Since the classes $P$ and $EXP$ are closed under reductions, and $MAS$ is complete for both $P$ and $EXP$, then we could state that $P = EXP$. However, as result of Hierarchy Theorem the class $P$ cannot be equal to $EXP$. To sum up, we obtain a contradiction under the assumption that $P = NP$, and thus, we can claim that $P \neq NP$ as a direct consequence of the Reductio ad absurdum rule.

You could see more on (version 3)…

https://drive.google.com/file/d/0B3yzKiZO_NmWZ1M1MkNuYVBreXc/view?usp=sharing

Best Regards,

Frank.

Let me make a few more comments on the combinatorial version of the homological (balanced) approach. The first unknown case is this statement:

For k=2 a combinatorial (4,2) cycle is a collection with more than 6 pairs. For larger k we need to assume that the link of every set of size (k-2) has more than 6 pairs. (In other words, every set of size (k-2) is included in no k-set or in more than 6 k-sets from the family.) We want to prove that a combinatorial (4,2)-cycle has a sunflower with 3 petals and head of size 0 or 1.

Suppose we want to prove it by induction. If k>2, the link of a vertex of a (4,2)-cycle is a (4,2) cycle. So by induction the links have a sunflower with head of size 0 or 1.

If the head is empty we are done. Otherwise we have a sunflower {A,B,C} with head of size 2. Let a and b be the vertices in the head. Let A’ B’ and C’ be the petals minus the head. The link of A’ B’ and C’ are three bipartite graphs (with the same parts).

They have the properties that

1) They share an edge {a,b}

2) Each contains in addition 6 more edges.

We want to find a sunflower of three edges – one from each graph. Is this always possible?

Dömötör shot down a similar statement but not quite (yet) this one.The sequence of weaker and weaker working conjectures from last time could have been useful also for such an inductive statement (although I had a different intention for them) but Dömötör shot them down too.

I thought I did: https://gilkalai.wordpress.com/2015/11/11/polymath10-post-2-homological-approach/#comment-23058

Sorry, I missed that: Indeed the example is that we have the same edge {x,y} for all three graphs. The first and second graphs contain edges of the form {z,u} where z is fixed and u takes many distinct values and both are different than x and y. The third graph contains edges of the form {w,p} where w is fixed and p varies and both are distinct from {x,y,z} and all the {u’s}

So far, we mainly talked about the following sub-strategy for the homological idea (just for the balanced case): Recall that we want to conclude from not having a certain sunflower that certain (top) homology vanishes. In other words we want to show that every “cycle” contains a required sunflower. What we did next was to replace the homological cycle by combinatorial cycle. The claim that every combinatorial cycle must have a sunflower is a stronger statement, but hopefully it will admit a combinatorial argument.

The most optimistic view of the arguments we had was that it will allow by induction to move from the case of families of k-sets where we forbid a sunflower with head of size smaller than m to the case where k=m. This would be very nice (and we are stacked even for r=3 and m=1) but, without more ingredients, it will only reduce the more general problem (with m) to the original sunflower question (without m).

I want to devote two remarks to explain better the homological notion of cycles and homology, Why there are already useful to draw conclusions (in some very simple cases that we considered) and what we can hope for them when we forbid sunflowers.

So here is the first comment.

Let’s consider balanced families F of k-subsets from [n] and the following four statements

(1) F does not contain r pairwise disjoint sets (or in a more complicated way: no sunflower of size r with head of size smaller than 1.)

(2) F does not contain a combinatorial (r-1,1) cycle

(3) F does not contain a homological (r-1,1) cycle

(4) .

We recall the definitions

A combinatorial (b,1)-cycle of k-sets is a collection of k-sets such that every (k-1)-set which is included in one k-set from the family is included in at least b+1.

To define a homological (b,1) cycles we need to consider b generic boundary operators from (k-1)-chains [namely linear combinations of k-sets] to (k-2)-chains.

A homological (b,1)-cycle is a collection of k-sets so that you can assign to them nonnegative weights so that the resulting linear combination vanishes when we apply each one of these b boundary operators.

We have the following implications:

For every family of k-sets (here we do not need the family to be balanced) (2) implies (3) and (3) implies (4). The implication (2) implies (3) is easy linear algebra. (3) implies (4) is also not a difficult linear algebra argument. What is a little surprising is that the proof of the implication (2) implies (4) requires essentially moving through (3). (Essentially, the only known arguments are based on linear algebra and some sort of generic vectors, although the homology nature of it can be hided.)

For balanced families (1) implies (2) (and therefore also (3) and (4)) The implication from (1) to (2) was explained here: https://gilkalai.wordpress.com/2015/11/11/polymath10-post-2-homological-approach/#comment-22581

Before moving to the second comment let me mention that when r=2, Condition (2) asserts that the simplicial complex defined by the family, collapses to its codimension one skeleton. (The simplicial complex is (k-1)-dimensional so it collapses to the (k-2) skeleton.) Condition (3) asserts that the top ((k-1)-dimensional) homology of the simplicial complex vanishes.

Going back to general values of r, we comment that for general families, (4) is a sharp consequence from (2) and (3). For balanced families stronger inequalities are possible but I dont know what is the sharp upper bound. (This is an interesting extremal question.)

Let me move now to the second comment. Before a detailed comment here is a piece of motivation. We can think about a different path to go (again, for balanced families):

From

(i) Conditions on no sunflowers TO

(ii) global and local homological conditions TO

(iii) conclusion about no (b,c) homological cycles TO

(iv) Consequences on the size of the family.

The first place to try it would be for cases where we already know even stronger conclusion on (iii) regarding combinatorial cycles.

Now, lets consider the property of a balanced family F of k-sets of not having a sunflower of size r=2 with head of size smaller than m. And let’s take m=2. We already know that F does not contain a combinatorial and hence a homological (2,2) cycle (and (m,m) cycle in the more general case.) But we want to give a direct homological argument. We have two reasons for that:

First the inductive argument we have for that case does not extend to the case r=3, m=2. So we are stacked. It seems that in any case we need to assume the case k=m as a basis to an induction argument. Let use F to denote also the simplicial complex spanned by sets in the family.

Here is how the argument goes.

We know that an intersecting (balanced) family is acyclic,

To show that F does not contain a (2,2) cycle it is enough by the theorem mentioned in post 2 to show that

1) The top ((k-1)-dimensional) homology for F vanishes

2) The top ((k-2)-dimensional) homology of every link of a vertex of F vanishes.

3) The (k-2)-dimensional homology for F vanishes

Property 1) follows from the fact that F contains no pair of disjoint sets. Property 2) follows from the fact that the link of every vertex contains no pair of disjoint faces. We need to prove property 3). Namely we want to show that if F has a (k-2) cycle which is not a (k-2) boundary then it has a pair of disjoint sets.There may be various ways to go about it.

First one remark. Note that although family of (k-2) sets which are included in sets of our original family does not contain a pair of disjoint sets this does not imply that there are no (k-2) cycles supported by F altogether because by going to sets of size (k-2) we are no longer balanced. (This may give some advantage to the alternative homological approach without the balance condition.)

OK, so we want to show that if our family support a (k-2) cycle which is not a (k-2) boundary then it contains two sets with intersection at most 1. We can try to prove it by induction. We start with such a (k-2)-cycle supported on a minimum number of vertices. The link of every vertex v involved in this boundary does not support a (k-3) cycle which is not a (k-3) boundary – otherwise we can eliminate this vertex from the (k-2)-cycle we started with. So by induction we have two sets A and B in the link with intersection size smaller than 2. We can assume the intersection has one vertex w. In the (k-2)-cycle A\w must be included in another set C whose additional element cannot be w or v (because of the coloring). So this looks ok.

I would like to make a long comment on possible computer assisted ways to find good constructions for small values. We seem to have several computer programs and I was wondering if it made any sense to unify them, maybe we could have a common file on SageMath Online. Then it’s easier to improve the algorithm. Of course we would need an expert programmer to start…

Possible improvements include to better understand the structure of maximal examples; Philip Gibbs made some conjectures about the links of vertices (https://gilkalai.wordpress.com/2015/11/11/polymath10-post-2-homological-approach/#comment-23058) and Ferdinand Ihringer about some special configurations that must appear (https://gilkalai.wordpress.com/2015/11/03/polymath10-the-erdos-rado-delta-system-conjecture/#comment-23070).

I proposed to look for examples that are generated by some transitive permutation group (https://gilkalai.wordpress.com/2015/12/08/polymath-10-post-3-how-are-we-doing/#comment-23032); indeed, there are not that many of these (see https://oeis.org/A002106 and https://oeis.org/A000637/a000637_1.pdf), so a computer program could easily check all.

A further possible simplification could be to try constructions for intersecting families. If we denote the size of the largest k-uniform intersecting family without an r-sunflower by , then we have . In fact, if I understood well, it is even possible (though unlikely) that equality holds for all values of k and r. This is the case for all best constructions for r=3, but not for r=4, k=3 (see our wiki and Abbott-Exoo). Certainly intersecting families are easier to search for by a computer.

I will also try to get some experimentation going in a few weeks. Also using sage math http://www.sagemath.org/ might be a good idea.

Looking at the next step in the homological/balanced plan what we want to prove is:

If F is a (4,2)-cycle then F contains a 3-sunflower with head of size 0 or 1. Or, in other words, if F does not contain a 3-sunflower with head of size 0 or 1 then it is (4,2) acyclic.

Let’s recall the definitions. We consider generic weighted boundary operators . A (k-1)-dimensional chain is a linear combination with real coefficients of sets of size k. A (2,1)-cycle is a chain that vanishes when we apply and . A (4,2) cycle is a chain that vanishes when we apply one after the other any two from the four boundary operators .

Lets define the space of cycles as k-dimensional chains that vanishes when we apply successively each c boundary operators out of b generic boundary operators .

We also want to define homology . In the top dimension the homology is the space of cycles, but in lower dimensions we need to mod up by some “boundaries”. for c=b=1 we are left with the usual homology.

The theorem mentioned the comment above (and referred to in Post 2) asserts that if

Kis(k-1)-dimensional, and(1)

(2)

(3) for every vertex v

Then .

We need to prove and apply a theorem of the following kind:

If

Kis(k-1)-dimensional, and(1)

(2)

(3) for every vertex v

Then .

We note that to apply such a theorem for a balanced family with no sunflower of size 3 with head of size 0 and 1 we already have parts (1) and (3) (from what we know about balanced families with no three pairwise disjoint sets). But we will have to worry about (2).

Let me give the definition of . where and .

Actually the definition of the space of boundaries should be:

We can use both definitions. (I am not sure yet which is better.) When we use the first Conjecture A is harder and Conjecture B is easier. However, the example showing that Conjecture B is false applies to this version as well.

Let me also outline what is needed for the balanced/homological approach to work for the full sunflower conjecture for

r=3. We need two conjectures:Conjecture A:LetFbe a balanced family ofk-sets without a sunflower of size 3. LetKdenotes the simplicial complex spanned by the family. Then for every setRand everyj, .Conjecture B:LetKbe a(k-1)-dimensional simplicial complex such that for every setRand everyj, . ThenJust to sum up the situation. Right now I don’t have an avenue for proving Conjecture A whenever . (We know, from the previous post, that it holds when $j=\dim(lk(R,K))$. As far as I know conjecture A can hold even in the unbalanced case. As for conjecture B. I forgot that you do need to assume that K is balanced. The graph with two connected components each is a triangle does not satisfies . (It may be true for arbitrary complexes if we weakened somewhat the conclusion, for for a slight variation of the definition of weighted homology.)

I have some hopes that Conjecture A can be reduced to the case of graphs (OK even before that I probably need to be able to extend the (2,2) case in this comment to general (b,b) case), and I also expect it to be correct for graphs. So if this works this will be very nice.

Consider the property of a balanced family F of k-sets such that

(*) the intersection of every two sets in the family is at least of size m.

(In other words the family does not contain a sunflower of size r=2 with head of size smaller than m.) Let K be the simplicial complex spanned by F. We want to show that

(**) .

When . For m=1 this was Nevo’s basic observation mentioned in post 1.

Three remarks:

1) (**) implies (but this is a difficult result) that

(***)

which implies that .

2) Given (*), we have a different proof of (***) via a simple argument for a stronger statement:

(****) F does not contain a combinatorial (m,m)-cycle.

3) In post 2 we thought about local homological conditions more general than (**) sufficient to derive (***), but apparently this is not needed for our purposes.

We described the argument for (**) from (*) for m=2 in this comment. I’d like to devote the next comment for proving (**) from (*) for every m.

Given a family

Fofk-sets and denoting byKthe simplicial complex spanned byF, let me try to show that(*) the intersection of every two sets in the family is at least of size

m.implies

(**) .

When , and when

K’isKitself or the link of some face inK. (We can regard K itself as the link of the empty face.)Note that we made (**) a little more general, but the older (**) applies to links implies the new, more general, (**). (We always talk about reduced homology, so if is connected.)

We know it for

m=1, and once we know it for smaller values ofmandkwhat is left to be proved for that .As a first step suppose that there is a set of size

k-mwhich is included in a single setRinF.DeleteRfromFand repeat. This operation does not effect any of the homology groupsof dimension

(k-m)and above inKand in every linkK’of a face ofK.Given a

(k-m)-dimensional cyclexwhich is not a boundary we want to find two setsS,Tin the family with intersection of size smaller thanm. We can assume that the number of vertices on whichxis supported is minimum. Letvbe a vertex on whichxis supported.xinduces a(k-m-1)-dimensional cyclex’onlk(v). ifx’is a boundary ofy’inlk(v)then by taking the cone overy’, xminus the boundary of this cone will be a new(k-m)-dimensional cycle which is not a boundary not involving the vertexv. By an induction hypothesis we can find two setsS’, T’inlk(v)whose intersection has less thanmelements. If the size of the intersection is smaller thanm-1we can addvto bothS’andT’and we are done. We are left with the case that the size of the intersection ofS’andT’ism-1.But know we can look atA=S’\T’andB=T’\S’. Both these sets have in their link the set of size m But because of our preliminary stepAhas in the link yet another setZof the same sizemand because of the coloring this new set cannot have vertices fromB. and are two setsin the family with intersection smaller than

m.We also have to start the induction somewhere. But we note that when

Kis not connected, i.e., when the 0th (reduced) homology does not vanish then we must have two disjoint sets in the family.What we want to do next is to consider the case

r=3. Perhaps first the caser=3, m=2.Well, there is a subtle issue with the deletion procedure at the beginning of the proof. What we actually proved is: Given a family

Fofk-sets which is a (m,m) -cycle and denoting byKthe simplicial complex spanned byF, if(*) the intersection of every two sets in the family is at least of size

m.implies

(**) .

I dont know if we can eliminate the condition of F being a (m,m) cycle.

So it is possible that we will need to modify conjecture A above to:

Conjecture A (modified):LetFbe a balanced family ofk-sets which is a (2k,k)-cycle without a sunflower of size 3. LetKdenotes the simplicial complex spanned by the family. Then for every setRand everyj, .This will be enough with the same Conjecture B to give us what we want.

Conjecture B:LetKbe a(k-1)-dimensional simplicial complex such that for every setRand everyj, . ThenFor j=0 we have that as long as K has at most two connected components. So in this case this is implied by not having three pairwise disjoint sets. (And thus from not having a sunflower of size three.)

In view of the comment above, we can ask if, more generally, for a family F of k-sets, and the simplicial complex K spanned by F, when F does not have two sets with intersection of size smaller than m Then for . Similarly, when F does not have a sunflower of size 3 with head of size smaller than m, perhaps for .

Added later:Unfortunately this does not continue to hold for j=1.Indeed (*) does not imply (**), here is an example:

let c be the boundary complex of the (k-1)-simplex T.

For any vertex v of T consider the k-set formed by T\v and a new vertex v’.

This gives a balanced family F of k-sets (v and v’ are colored with the same color, |F|=k) where any A,B in F intersect in k-2 elements, and c is a nontrivial (k-2)-cycle. So for k>2 this is a counterexample.

[Gil’s proof seems to give that if balanced F has no 3-sunflower of head size < k-1 then (**) holds, but that's too weak. The point is that a vertex minimal cycle c may be of the form c=v*lk(v)+b where all vertices in the chain b are in the link of v, so lk(v) may be trivial. But if this happens for all v in c then c is just a simplex boundary; like in the example above.]

Conjectures (B) and (modified A) imply that the condition in (modified A) is never satisfied, so it may be useful to think about (modified A) also as:

Let F be a balanced family of k-sets without a sunflower of size 3. Let K denote the simplicial complex spanned by the family. Assume that for some set R and some j, H_j[2,1](lk(R,K)) is NOT zero.

Then F has a (2k,k)-cycle.

Dear Eran, Yes, this is correct. The original Conjecture A is not correct (and the argument for r=2 requires an additional condition) and, as you mentioned, the modified conjecture A is a sort of counterfactual, afoer the modification Conjectures A and B do not divide the problem to two pieces but rather can be seen as a strategy for dividing the proof into two parts. It is possible that some stronger form of Conjecture B (we mentioned some ideas in post 2 when we discussed Theorems 1/2) will allow a version of Conjecture A which is not “counterfactual.”

In any case, the status of Conjecture B is also quite interesting. It is a bold extension of the theorems for r=2 meant specifically towards the sunflower conjecture. It is quite elegant but for now I don’t have any evidence for believing that it is true.

In somewhat greater generality Conjecture B asserts the following (I mainly care about s=1,2. r=s+1.)

Conjecture B:LetKbe a(k-1)-dimensional simplicial complex such that for every setR, and everyj, . ThenHere, where

For s=1 this is true and follows from results in commutative algebra. It would be great if the there is some reduction from s=2 to s=1, namely you can move from a complex where the groups vanish to another complex where the ordinary homology vanish.

For s=1 and m=2 I think there is a simple derivation and it would be very interesting to understand the case s=2 and m=2.

So the simplest cases for the conjecture are:

Case 1 (known; but i’d be happy to see a simple as possible proof): If K is (k-1) dimensional and , and for every vertex v, then .

Case 1 (unknown;): If K is (k-1) dimensional and , and for every vertex v, then .

(Added later: we need to assume for the unknown case that K is balanced.)

I am interested in whether a topological approach can be useful for the special case relevant to matrix multiplication. In particular, I wonder whether the topological Tverberg theorem can be useful.

(by the way, I am not sure if it was mentioned previously or not, but a great book on applications of tological methods in combinatorics is “Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry” by Jiri Matousek).

Let , where ideally we want . The goal is to find 3 disjoint subsets with the same sum. Define a dimensional simplex with vertices . My question is: can we define a continuous map such that

(1) (but ).

(2) .

(3) Intersections between disjoint faces correspond to equal sumsets (this is the tricky part)

If so, the topological Tverberg theorem would automatically give us the required result. Maybe an easier case to consider first is a more geometrical problem, where the domain is replaced with .

This is a very nice idea, but can you make it work when the parameters will just give a new derivation of the known bounds?

We can try to use, either for the original problem or the variation, Tverberg’s original theorem (rather than the Topological version). The conclusion is usually not pairwise disjoint sets with equal sumsets but pairwise disjoint sets and positive weights with equal weighted sumsets. Maybe there is a way to move from weighted sumsets to weight-1 sumsets.

A third thought about it is this. suppose you want to prove that for any m vectors in there are three pairwise disjoint nonempty subsets A B and C with the same sum. Hoping for m = Cn. This is stronger than requiring a single nonempty subset X whose sum is 0. (Because we can take X as the union as A B and C.) To guarantee such an X we need only 2n+1 vectors and this can be proved easily by the polynomial method. (The first step is to ask the question as finding a non trivial solution to the equation .) So one idea might be to combine the polynomial method with the algebraic idea from Sarakaria’s proof of Tverberg theorem. You want to find a solution to the equation , where is in {0,1,2}, and is a third root of unity. (And to guarantee that the partition according to p(i) is not trivial.)

regarding the third thought: since any points in contain a subset summing to zero, any points contain 3 disjoint sets, each summing to zero.

Hmm, it is hard to argue with that. I wonder by how much 6n+3 can be reduced. Perhaps even to 2n+1?

Not for n=1…

Yap :). One related thing I am curious about is for graphs. The 2n+1 results gives that every 4-regular graph plus an edge contains a 3-regular subgraph and also every 5-regular grapg contains a 3-regular subgraph. Taskinov prove that every 4-regular simple graph contains a 3-regular subgraph. I dont know if in these results “3-regular subgraph” can be replaced by “3-regular 3-edge colorable subgraph”.

info yang sangat menarik, sepertinya harus dicoba , Aerilyn

Just to repeat/summarize how things stand regarding the homological approach. For the sunflower conjecture for

r=3we need the following two conjectures:Conjecture A:LetFbe a balanced family ofk-sets without a sunflower of size 3. LetKdenotes the simplicial complex spanned by the family. Then for every setRand everyj,(*) .

Conjecture B:LetKbe a(k-1)-dimensional balanced simplicial complex such that for every setRand everyj, . Then(**)

Remarks:

(k-1)-dimensional chains ofKwhich vanishes when we apply successively anykout of2k(generic) boundary operators.We can mention what we get from some results we know for the following questions.

1) What is the maximum size of an intersecting balanced family F of k-subsets of [n]?

2) What is the maximum size of a balanced family F of k-subsets of [n] such that every two sets in the family have intersection of size at least m?

3) What is the maximum size of a balanced family F of k-subsets of [n] without r pairwise disjoint sets?

4) What is the maximum size of an acyclic balanced family F of k-subsets of [n]? (Namely, a family with when K is the simplicial complex spanned by F.)

5) What is the maximum size of a balanced family F of k-subsets of [n] such that ?

6) What is the maximum size of a balanced family F of k-subsets of [n] such that ?

Our results allow to give upper bounds for questions 1,2,3 based on upper bounds for questions 4,5,6 respectively. Using the known (sharp) upper bounds for questions 4,5,6 for general families (not necessary balanced) we get the upper bounds , and , respectively. It will be very interesting to find sharp upper bounds for questions 4,5, and 6, as well as sharp upper bound for 1,2,3. (The bounds for the last three questions apply for the first three but they would not be sharp, in general.)

I attempted to generalize the easy EKR one-line proofs for to . Here is a (hopefully correct!) short argument for if . So if the Erdos-Rado Conjecture is true, then also Gil Kalai’s Question 2 from his first post on Polymath 10 is true.

Click to access erdosrado_kalaissecondquestion.pdf

(224 KB, 3 pages)

I tried to keep the argument simple. I guess that one can easily improve the to or the to something close to . Similarly, some more effort should improve the condition on .

Dear Ferdinand, This is very nice! I will try to read the details soon.

I would like to add the observation that we . I do not know if this was mentioned before, but I did not look for it very carefully.

To see this, take a set with property and size . Let be the set of of -sets, which meet the union of in exactly one element of . Obviously, has size . If is a sunflower with head size less than , then is a sunflower with head size less than . So as does not contain a sunflower with head size less than , does not.

If large compared to we have approximately (unless I made some mistake)

So as long as we can answer Question 2 of the first post for any and large compared to , then everything should be fine. So showing Question 2 for something silly such as and is enough to answer Question 2 completely for .

I was thinking a bit about refining my bounds. I would assume that for there are constants such that

.

Basically, this would imply that the conjecture should be and that the problems are roughly the same. Which would be nice to to know.

How to prove it? I think that for the suggested upper bound it might be enough to pay more attention in my proof, but maybe someone else wants to think about it as well: In my proof you get all these intersections of size (the ). I would like to know if the family of these -sets satisfies property . Maybe not, but I would guess that if not, then something strange happens, which will give a good bound as well.

Let me relate to a few comments by Karim Adiprasito from the first post (mainly: comment 1, comment2). Karim asked about the case that the simplicial complex

Kspanned by the familyFhas the Cohen-Macaulay property (or is closed to be Cohen-Macaulay).A pure

d-dimensional simplicial complexKis Cohen-Macaulay if for every link of a face K’ (including the empty face whereK’=K)(1) for

I.e.,

K’looks homologically like a “bouquet of spheres” of the top dimension.Question:What is the maximum number of sets in a balanced familyFofk-sets without a sunflower of size 3 (or, more generally,r) such that the simplicial complexKspanned byFhas the Cohen-Macaulay property.We note that (for

r=3, and the balanced case) the assertion of Conjecture A is satisfied. For a pure simplicial complexKof dimensiond(2) implies .

(Later change: the implication arrow fixed.)This is because always (4) and (5) . (4) is immediate and for (5) note that if then and which vanishes by definition if .

Two remarks

Kand is related to algebraic shifting based on the symmetric algebra. There are “symmetric algebra” analogs to these homology groups which could be more convenient to study (especially for the Cohen-Macaulay case.) Those are based as Karim mentioned on several linear differential forms in the face ring. (Here is the link to my paper on algebraic shifting (and itterated homology groups), and to Duval and Rose’s paper.)Conjecture B is incorrect and the local homological conditions (*) do not suffice to imply that K is bounded (so certainly not condition (**)). To see this consider a balanced triangulation of a

(k-1)dimensional sphere. For all links K’ and everyiif and if which implies (I think) that for every i and K' .I was thinking of some kind of linear algebra approach to the problem using the following observation. Denote the base set by and let be the indicator for being in , the -th member of our family. Observe that form a 3-sunflower if and only if (mod 3). Thus having a sunflower-free family is the same as for each triple .

We can use this, for example, to construct a graph whose vertices are the sets, and there is an edge between and if . Using , we can show that there is a unique extreme sunflower-free family for (which is anyhow not that hard to prove).

If we have six sets, then we have a triangle in or its complement. But for , an edge means that the two sets are disjoint, so a triangle would mean 3 disjoint sets. An empty triangle in a sunflower-free family for can only mean 3 sets that look like . No other set can be adjacent to or , so our 3 sets are connected in to everyone else. That means that in the rest of the graph there are no edges (or we would have a triangle), so again we have an empty triangle.

I wonder if this mod 3 function is useful to prove deeper results, either using the above defined graph, or the polynomial method, or some incidence matrix approach. By incidence matrix, I mean a matrix whose rows are indexed by the sets, the columns by the elements, and thus in the values appear (thus the diagonal will be all ).

(1) I do not see anything that would make the eigenvalue spectrum of this incidence matrix interesting. Limiting the size of this matrix should be interesting, but then I come to (2).

(2) Can you somehow make the “almost” more precise? In general it looks more restrictive than the original equality. At least when I tried to write down example for incidence matrices.

A 3-sunflower implies that but not the other way around, as shown by . However, at least we know something about the intersections among the 3 sets in question that might allow us to go on. I didn’t have a deeper insight behind the .

I still have to thank for that reply. Maybe generating large symmetric matrices with entries from in with the properties

(1) ,

(2) iff ,

would be helpful? If the incidence matrices of the largest examples have any interesting properties (ranks, eigenvalues, something else?), then looking at small examples should be, as in the regular case, helpful.

Dear Domotor, very interesting suggestion. I will be happy to see it developed further and think about it myself.

After thinking more and more, I think that introducing that mod 3 was a bad idea. A much better condition is that form a sunflower iff for all we have . This implies . So if you look at it from a graph point of view, we color the edges with the intersection sizes. So if the incidence matrix is , then for this would mean that . Anyhow, this formulation becomes equivalent to looking for 3 sets that have pairwise the same intersection. What do we know about this?

So we want to color with colors such that we have no monochromatic subgraph (replace with for the general case)? So Ramsey numbers minus 1 are the largest examples?

So for , we have for the numbers are . Interestingly, the best construction for for these colorings is (with 161) better than the best known construction for our sets (160) according to the Wiki page for this project. Maybe we can use that 161-vertices example to improve the known lower bound by 1? (Yes, very ambitious!)

In general we seem to have . This looks very similar to the bounds on the sunflower conjecture. Also the general lower bound looks better.

See here, page 36, for the numbers:

http://www.combinatorics.org/ojs/index.php/eljc/article/view/DS1

I am sure that some reader of this blog will know more about this than me. Maybe this overview paper is outdated.

The bound in my previous post should read . Furthermore, “ is the size of the largest example” would be correct statement, while “So Ramsey numbers minus 1” is not.

Thx for the bounds. It seems mysterious that these two parameters go so close to each other and have such similar bounds, though none of them dominates the other (at least we don’t know). Converting the 161 vertex graph sounds a little too ambitious for me. I tried and the 5 vertex graph is trivial to convert to 5 sunflower-free 2-sets, but a simple case analysis shows that the 17 vertex graph cannot give a family of 17 sunflower-free 3-sets. So I wonder if we can prove any relation between these two parameters.

You mean the 16 vertex graph? Ok, converting colorings to sunflowers will not work in general in an obvious way if even the 3-set case fails.

The easiest upper bound, , comes from an easy inductive argument (as for ), which explains the . The polynomial lower bound is obtained by putting together smaller examples, which is again as in the sunflower conjecture case. So the upper and lower bound proofs feel the same for both problems.

Converting between and seems to be nontrivial. Going from to the problem seems to be that you cannot avoid triples that have colorings such as . Is this still a problem if we want to go from to ? Or some other ? For some sufficiently large we will get enough freedom to say , I suppose.

Yeah, sorry, I meant 16. Well, if , that’s certainly enough, but we would need to prove something interesting, and I see little hope for a direct reduction. The other direction looks more promising to me, i.e., converting a 3-sunflower-free family of -sets to a -free edge 3-colored graph on vertices.

We can have many, many triples with , which are a problem for the coloring. Deleting some sets seems to be a bad option as then our size will go down by factors such as very often unless we figure out some good way of doing. Adding colors will not be interesting, because we will need too many.

Maybe we would like to find a problem that either dominates both problems or that is dominated by both problems?

Well, being dominated by both is easy – require a family of -sets without 3 sets whose pairwise intersections’ sizes equal. I think it might be a good start to prove an exponential upper bound for this problem.

Pingback: News (mainly polymath related) | Combinatorics and more

Pingback: Frankl’s union-closed conjecture — a possible Polymath project? | Gowers's Weblog

While Conjecture B failed, I have some further ideas regarding the homological approach which in a usual (little obsessive) working-on-a-project activity, I would probably pursue. I am not sure what the policy should be in a polymath projects. Opinions are welcome, (This is sort of a Meta question.) I tend to pursue it anyway, and write about it next post.

Ok, let me say briefly what the additional idea is. Let F be a family of subsets from a ground set [n]. Let G be the complement family, namely those k-subsets of [n] not in F. Let L be the simplicial complex spanned by F and L be the simplicial complex spanned by G.

Now, our staring point was the analogy between “intersecting” and “acyclic” (namely having vanishing ) that we extended and tried to further extend in various directions. Let me point out a stronger homological property which might be relevant to being “intersecting.” This is the property, let’s call it “strongly acyclic” that . (I’d like to explore if balanced intersecting families are strongly acyclic; or perhaps in the other extreme K is strongly acyclic if all its set have an element in common. )

What we do know is that for intersecting families and for families with no three pairwise disjoint families . This follows from the fact that algebraic shifting preserves the property : “does not have r pairwise disjoint set”. The counterexample to our conjecture B shows that vanishing of such homologies does not suffice.

However, algebraic shifting provides a much stronger property: If F is intersecting then and if F does not have 3 pairwise disjoint families then . This is because also algebraic shifting with respect to the

reverse lexicographic orderpreserves the property : “does not have r pairwise disjoint set”.My current proposal is to deduce from the property that , and the analogous properties for links the required global homological property for K.

So let us denote the size of the largest -uniform family without (different) sets whose pairwise intersection has the same size by . As we have seen in the earlier discussion, trivially and (where in the last Ramsey notation we forbid in a -coloring of the complete graph). Mysteriously, for all three functions we have similar lower and upper bounds. In this comment I propose to try proving for some .

For this, it is enough to show that if we have a sunflower-free -uniform family, then we can convert it into a “pairwise same intersection size-free” -uniform family. So our goal is to ruin intersections that are accidentally the same, like is done in the Isolation lemma (https://en.wikipedia.org/wiki/Isolation_lemma). However, in our case, we only care about local coincidences, so our problem might be more similar to the 1-2-3 conjecture (http://www.math.illinois.edu/~dwest/regs/123conj.html). The exact formulation is as follows.

Suppose that we have a -sunflower-free -uniform family. Can we assign weights to its vertices such that no sets have pairwise the same weighted intersection size?

ps. Note that we needn’t require that the new family is uniform, we can achieve that by adding at most more weighted vertices to each set.

An optimistic approach would be to show that to family we can assign weights that kills all triples with pairwise the same intersection size, unless they form a sunflower. Unfortunately, this isn’t true; already for the family whose sets are the edges of is a counterexample.

This, and the reference to the isolation lemma, looks like a great idea.

I’ve just realized that we had no lower bound for – a simple example showing is the root-to-leaf paths of a complete binary tree. But I don’t know whether holds or not. I also wonder if the homological approach can prove anything about …

Do you mean ?

Since (pentagon), can we at least prove that ?

As Anurag Bishnoi pointed out, the largest example for is a pentagon. So in this case . As the construction for implies , it is natural to limit the first attempt to 4-sets of . I did an incomplete search with my stupid generic program and it only came up with an example of size 11.

Now a complete argument for should be more feasible. The following is, I think, a nice example for , which just merges two pentagons. It uses the elements of . I write 012 for .

012

234

456

678

890

134

356

578

790

912

Maybe this construction (if it is correct, please double check) could be generalized to get at least some recursive bound. My incomplete computer search suggests that 10 is the maximum here.

Yes, I meant (where I dropped the to keep things simple), thx. To get some recursion, I can prove . For this, take two disjoint copies of the family for and add two more elements, one contained in all members of one family, the other in all members of the other family. This also gives .

I find it quite funny that we came back to almost the same problem what gowers proposed at the beginning (https://gilkalai.wordpress.com/2015/11/03/polymath10-the-erdos-rado-delta-system-conjecture/#comment-22240), except that there everyone thought that there should be a trick to keep a large fraction of the family such that any two have the same intersection size, while here we realized that to get even such sets is hard…

This is very interesting! I suppose looking back and Tim’s comments from this new perspective can be useful. As for the homological and homological/combinatorial ideas, we want to find in cycles of various sorts sunflowers. I dont see how this getting easier when you relax it to sets with pairwise intersection having the same size but e can try to explore it. Also the Erdos-Ko-Rado related questions are of interest. For example we can ask what will guarantee having three sets with 1) empty intersection; 2) all pairwise intersections have the same size. Is the answer ? Is a (2,1)-cycle guarantees such a structure (in the non balanced case)? Also the connection to and are very interesting. (Those are known to be closely related with Shannon capacity but I dont recall seeing the connection with the sunflower question; should have another look in the papers I linked by Alon Shpilka Umens Cohn and others…

I’ve also just thought of Shannon entropy, more specifically, of the following question. What is the largest number of vectors such that the set of their pairwise angles has size (so any two vectors have one of the angles ), but no three vectors have pairwise the same angle?

About the EKR-type question – I think that it is better to simply select an intersecting system of size , as . Or did I misunderstand your question?

Selecting all sets which contains ‘1’ or ‘2’ still avoid a triple satisfying (1) and (2) and the (off hand) question is this best possible.

As for Shannon capacity it is known that the question if is bounded from above is equivalent to the question if the Shannon capacity of graphs with independent number 2 is bounded from above. (And you can replace 3 and 2 by r and r-1.)

EKR: Oh, I see, I made a silly calculation mistake.

The Shannon capacity connection sounds very interesting.

I want to mention that there is a simple, direct proof for .

For this, introduce to be the size of the biggest -uniform family without sets with pairwise same intersection (should we abbreviate this as ?), such that the intersection size of any two sets is in . Thus, for example, if is a singleton and is also easy to prove. In general, we have , as we can consider the intersection sizes of the whole family with one fixed set, and put them in groups with respect to their intersection sizes.

Actually, it is my mistake since the example of sets containing ‘1’ or ‘2’ does have a triple of sets so that there is no element common to all and every pair has the same intersecting size.

Pingback: Polymath10-post 4: Back to the drawing board? | Combinatorics and more

This might be a very stupid question, but all the sets have ‘1’ and ‘2’ in common, don’t they? If we ignore ‘1’ and ‘2’, then I understand the statement.

If all sets in have pairwise the same intersection size, then . An easy proof is somewhere in the Babai-Frankl-book. We want to do the opposite thing, but I wanted to mention this classical result anyway.

Maybe thinking about families of k-sets such that for all we find many with might be helpful. Each non-trivial example for should give some bound on . Trivial examples are the empty set and the set of all k-sets. If k divides n, then taking a partition of k-sets shows an upper bound of . This gives, by the way, an easy proof for the most basic EKR theorem for the case . I tried this some time for our original function (with the condition ) and there this approach did not seem helpful, but in this new setting … Who knows? Maybe the same problem occur, which I had for the original problem, but at least the conditions on are now weaker.

This is a reply to

https://gilkalai.wordpress.com/2015/12/08/polymath-10-post-3-how-are-we-doing/#comment-23764

I pressed the wrong reply button.

I should mention that r sets with equal pairwise intersecting size are called weak delta system. See e.g. http://www.math.ucsd.edu/~erdosproblems/erdos/newproblems/WeakDeltaSystems.html . Somehow a topological method looks less applicable. I am not sure what happen when you exclude three sets with empty intersection and equal pairwise intersection. If you exclude three sets with empty intersection and non empty pairwise intersection then this is a known extension of EKR going back to Chvatal.

Wow, so this has also been studied before! Not sure how I forgot about it, probably because Deza’s result seemed so irrelevant for us. At least I guessed the notation 🙂 And now we also know .

That is interesting. So Deza’s result tells us (with a very nice argument) that for . Now is it relevant for us? Can we modify that argument in some way such that we can use it more generally? Something like implies ? I am not too hopeful, because examples for already look bad. For the best example is . The best example with this “trivial code” property is . If we look at -sunflower free families with (this Deza uses), what is their maximal size? This might have been asked or even answered before, but I have no time and I cannot properly think about this for a few days. A lower bound on these families is still Dömötör’s -argument.

Following these links, an excellent read is the intro of http://www.sciencedirect.com/science/article/pii/0012365X9400185L, which, I think, contains everything we realized. Also note that , see thm 4 here for a simple proof: http://www.sciencedirect.com/science/article/pii/0012365X7790139X

This looks great. Thanks a lot. These should probably be added to the polymath wiki: http://www.michaelnielsen.org/polymath1/index.php?title=The_Erdos-Rado_sunflower_lemma. Can anyone go ahead and do that?

I added most of the new stuff, please check and change as you find best.

Pingback: Polymath10 conclusion | Combinatorics and more