Student: | Peter Korcsok |
---|---|

Office: | 444 |

School: | Charles University in Prague |

E-mail: | peter.korcsok guess_what_is_here rutgers.edu |

Projects: | Binary Kakeya Sets |

$L(p,q)$-labeling of Interval Graphs |

- J. Bourgain Harmonic analysis and combinatorics: How much may they contribute to each other? IMU/Amer. Math. Soc., pages 13–32, 2000.
- Zeev Dvir On the size of Kakeya sets in finite fields, arXiv:0803.2336 [math.CO].

- Introduction to the problem.
- Reading the article by Zeev Dvir.
- Few first observations.
- Computer program for finding all Kakeya sets for dimensions up to 5.

- Slightly better upper bound.
- Computer program for finding out size of Kakeya sets for dimension 6. (Program failed because of using too much memory.)
- Some computer experiments on sets from the first week.
- Some small observations.

- Computer program for finding out size of Kakeya sets for dimension 6 using external SAT solver. (Program killed because it would run too long.)
- Integer program for finding out size of Kakeya sets for dimension 6.
- Integer program for finding out size of Kakeya sets for dimension 7. (Program failed because of using too much memory.)
- More small observations.

- Nontrivial lower bound - roughly $2^{n/2}$.
- Observation about "surronded" point - point whose neighborhood is subset of Kakeya set.
- Observation that each Kakeya set can be "normalized" - transformed in such way that it contains all unit vectors.
- Computer program for finding all normalized Kakeya sets for dimensions up to 5.
- Preparations for Cultural Day.

- Computer program for finding all normalized Kakeya sets for dimension 6. (Program killed because it would run too long.)
- Some experiments on normalized sets from the previous week.
- Some improvements of the program for finding all normalized Kakeya sets for dimension 6. (Program is still slightly inefficient and still running at the end of the week.)
- Some partial results for finding all normalized Kakeya sets for dimension 6.

- $|f(u) - f(v)| \geq p$ whenever the vertices $u$ and $v$ are connected by an edge,
- $|f(u) - f(v)| \geq q$ whenever there exists some vertex $w$ such that both $u$ and $v$ are neighbors of $w$.

- Peter Che Bor Lam, Guohua Gu, Wai Chee Shiu, Tao-Ming Wang: On Distance Two Labelling of Unit Interval Graphs (see the paper).
- G.J. Chang; D. Kuo, The L(2,1)-labeling problem on graphs. SIAM J. Discrete Math. 9 (1996), 309--316.
- D. Sakai, Labelling chordal graphs: distance two condition. SIAM J. Disc. Math. 7 (1994), 133--140.
- J.R. Griggs; R.K. Yeh, Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992), 586--595.

- First Presentation (A brief introduction to intersection graphs)
- Culural Day Presentation (Slovakia)

http://www.mgvis.com/

http://www.mgvis.com/AbelloVitaResearchOct08.html