ABAart Blokhuis
Aart Blokhuis
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Aart Blokhuis has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Andries E. Brouwer
Amsterdam, The Netherlands
8 shared publications - Francesco Mazzocca
Seconda Università degli Studi di Napoli
4 shared publications - Tamás Szőnyi
Department of Computer Science, Eötvös Loránd University, H-1117 Budapest, Pázmány Péter sétány 1/C, Hungary
4 shared publications Andries E. Brouwer
2 shared publications- Giuseppe Marino
Seconda Università di Napoli
2 shared publications Henny A. Wilbrink
2 shared publications
Latest Publications
- Open Access
Regular finite planar maps with equal edges
There doesn't exists a finite planar map with all edges having the same length, and each vertex on exactly 5 edges.
Open AccessRegular finite planar maps with equal edges
There doesn't exists a finite planar map with all edges having the same length, and each vertex on exactly 5 edges.
- Open Access
A finite version of the Kakeya problem
Let $L$ be a set of lines of an affine space over a field and let $S$ be a set of points with the property that every line of $L$ is incident with at least $N$ points of $S$. Let $D$ be the set of directions of the lines of $L$ considered as points of the projective space at infinity. We give a geometric construction of a set of lines $L$, where $D$ contains an $N^{n-1}$ grid and where $S$ has size $2((1/2)N)^n$, given a starting configuration in the plane. We provide examples of such starting configurations for the reals and for finite fields. Following Dvir's proof of the finite field Kakeya conjecture and the idea of using multiplicities of Dvir, Kopparty, Saraf and Sudan, we prove a lower bound on the size of $S$ dependent on the ideal generated by the homogeneous polynomials vanishing on $D$. This bound is maximised as $((1/2)N)^n$ plus smaller order terms, for $n\geqslant 4$, when $D$ contains the points of a $N^{n-1}$ grid.Open AccessA finite version of the Kakeya problem
Let $L$ be a set of lines of an affine space over a field and let $S$ be a set of points with the property that every line of $L$ is incident with at least $N$ points of $S$. Let $D$ be the set of directions of the lines of $L$ considered as points of the projective space at infinity. We give a geometric construction of a set of lines $L$, where $D$ contains an $N^{n-1}$ grid and where $S$ has size $2((1/2)N)^n$, given a starting configuration in the plane. We provide examples of such starting configurations for the reals and for finite fields. Following Dvir's proof of the finite field Kakeya conjecture and the idea of using multiplicities of Dvir, Kopparty, Saraf and Sudan, we prove a lower bound on the size of $S$ dependent on the ideal generated by the homogeneous polynomials vanishing on $D$. This bound is maximised as $((1/2)N)^n$ plus smaller order terms, for $n\geqslant 4$, when $D$ contains the points of a $N^{n-1}$ grid. - 30 January 2014
- Published by Springer Nature in Combinatorica
- Vol. 34 (1) , 1-10
Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
- 30 January 2014
- Published by Springer Nature in Combinatorica
- Vol. 34 (1) , 1-10
Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
- 11 September 2013
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 22 (12) , 506-513
Generalized Hyperfocused Arcs in PG(2,p)
- 11 September 2013
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 22 (12) , 506-513
Generalized Hyperfocused Arcs in PG(2,p)
- Open AccessGeneralized Hyperfocused Arcs in $PG(2,p)$A {\em generalized hyperfocused arc} $\mathcal H $ in $PG(2,q)$ is an arc of size $k$ with the property that the $k(k-1)/2$ secants can be blocked by a set of $k-1$ points not belonging to the arc. We show that if $q$ is a prime and $\mathcal H$ is a generalized hyperfocused arc of size $k$, then $k=1,2$ or 4. Interestingly, this problem is also related to the (strong) cylinder conjecture [Ball S.: The polynomial method in Galois geometries, in Current research topics in Galois geometry, Chapter 5, Nova Sci. Publ., New York, (2012) 105-130], as we point out in the last section.Open AccessGeneralized Hyperfocused Arcs in $PG(2,p)$A {\em generalized hyperfocused arc} $\mathcal H $ in $PG(2,q)$ is an arc of size $k$ with the property that the $k(k-1)/2$ secants can be blocked by a set of $k-1$ points not belonging to the arc. We show that if $q$ is a prime and $\mathcal H$ is a generalized hyperfocused arc of size $k$, then $k=1,2$ or 4. Interestingly, this problem is also related to the (strong) cylinder conjecture [Ball S.: The polynomial method in Galois geometries, in Current research topics in Galois geometry, Chapter 5, Nova Sci. Publ., New York, (2012) 105-130], as we point out in the last section.
- 9 January 2013
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 72 (1) , 21-31
The Kakeya problem: a gap in the spectrum and classification of the smallest examples
- 9 January 2013
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 72 (1) , 21-31
The Kakeya problem: a gap in the spectrum and classification of the smallest examples
- 16 June 2012
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 71 (1) , 1-4
Note on the size of binary Armstrong codes
- 16 June 2012
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 71 (1) , 1-4
Note on the size of binary Armstrong codes
- Open Access
- 1 August 2011
- Published by Springer Nature in Journal of Geometry
- Vol. 101 (1-2) , 31-50
On q-analogues and stability theorems
- 1 August 2011
- Published by Springer Nature in Journal of Geometry
- Vol. 101 (1-2) , 31-50
Open AccessOn q-analogues and stability theorems
- Open Access
- 14 June 2011
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 65 (1-2) , 71-75
The graph with spectrum 141 240 (−4)10 (−6)9
- 14 June 2011
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 65 (1-2) , 71-75
Open AccessThe graph with spectrum 141 240 (−4)10 (−6)9
- Open Access
- 10 May 2011
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 65 (3) , 187-197
On the chromatic number of q-Kneser graphs
- 10 May 2011
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 65 (3) , 187-197
Open AccessOn the chromatic number of q-Kneser graphs