DIMACS
DIMACS REU 2014

General Information

me
Student: Karel Král
Office: 444
School: Charles University in Prague
E-mail: kralka guess_what_is_here kam.mff.cuni.cz
Project: Binary Kakeya Sets
Previous Project: DIMACS REU 2013

Project Description

For $x,y \in \{0,1\}^n$ we define the line $L_{x,y} = \{x^i \oplus y \mid i = 0, ..., n-1\}$ of direction $x$ where $x^i$ denotes the $i$-th rotation of $x$. We say that a set $S \subseteq \{0,1\}^n$ is a Kakeya set if for every $x \in \{0,1\}^n$ there exists $y \in \{0,1\}^n$ such that $L_{x,y} \subseteq S$. Michal Koucký asks for the smallest Kakeya set for a given $n$.

Previous Work


Weekly Log

First Week

Second Week

Third Week

Fourth Week

Fifth Week

Sixth Week

Seventh Week


Coworkers

Presentations


Additional Information

My Mentor
  • Professor James Abello
        http://www.mgvis.com/
        http://www.mgvis.com/AbelloVitaResearchOct08.html