Timeline for Forming Subsets
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2017 at 9:59 | history | edited | მამუკა ჯიბლაძე | CC BY-SA 3.0 |
deleted 4 characters in body
|
| May 29, 2017 at 9:06 | history | edited | მამუკა ჯიბლაძე | CC BY-SA 3.0 |
added 22 characters in body
|
| May 29, 2017 at 8:59 | history | edited | მამუკა ჯიბლაძე | CC BY-SA 3.0 |
replaced B by a slightly prettier one
|
| May 29, 2017 at 8:50 | history | edited | მამუკა ჯიბლაძე | CC BY-SA 3.0 |
edited body
|
| May 29, 2017 at 8:37 | history | edited | მამუკა ჯიბლაძე | CC BY-SA 3.0 |
added a proof
|
| May 29, 2017 at 8:31 | history | edited | მამუკა ჯიბლაძე | CC BY-SA 3.0 |
added a proof
|
| May 28, 2017 at 6:32 | history | edited | მამუკა ჯიბლაძე | CC BY-SA 3.0 |
Added the general construction
|
| May 25, 2017 at 20:03 | comment | added | მამუკა ჯიბლაძე | Actually for tournaments, all conditions boil down to that for any $i\to j$ there is a $i\to k\to j$, and I think this implies that these intersections cannot all be too small. | |
| May 25, 2017 at 19:58 | comment | added | მამუკა ჯიბლაძე | @GerhardPaseman With my random ones, sizes of $B(1)$, ..., $B(31)$ range somewhere between $10$ and $20$, and their pairwise intersections roughly between $3$ and $15$ | |
| May 25, 2017 at 19:40 | comment | added | Gerhard Paseman | For the projective plane parameter n=5, there should be 31 points and 31 lines each with 6 points. Does a labelling show up for that? Gerhard "Hope To Catch This One" Paseman, 2017.05.25. | |
| May 25, 2017 at 19:30 | comment | added | მამუკა ჯიბლაძე | @GerhardPaseman The ones I found have the $B(i)$ of size about half of $n$ on average, and $B(i)\cap B(j)$ of size about $1/4$ of $n$, so these look more like half-dimensional subspaces rather than lines... | |
| May 25, 2017 at 19:23 | comment | added | Gerhard Paseman | Thanks for the acknowledgement. I am thinking about such a bijection for other finite projective planes. If you take the (Hasse diagram of the) inclusion lattice, you may be able to find an arrangement and labelling that reflects the poster's property 1). Gerhard "Feel Free To Solve It" Paseman, 2017.05.25. | |
| May 25, 2017 at 19:02 | history | edited | მამუკა ჯიბლაძე | CC BY-SA 3.0 |
added 153 characters in body
|
| May 25, 2017 at 18:53 | comment | added | Gerhard Paseman | This looks familiar. Gerhard "Can You Say Fano Plane?" Paseman, 2017.05.25. | |
| May 25, 2017 at 18:48 | history | edited | მამუკა ჯიბლაძე | CC BY-SA 3.0 |
update
|
| May 25, 2017 at 18:38 | history | answered | მამუკა ჯიბლაძე | CC BY-SA 3.0 |