Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Ha Henny Wilbrink is active.

Publication


Featured researches published by Ha Henny Wilbrink.


Geometriae Dedicata | 1994

Near polygons and Fischer spaces

Ae Andries Brouwer; Am Arjeh Cohen; Ha Henny Wilbrink; J. J. Hall

In this paper we exploit the relations between near polygons with lines of size 3 and Fischer spaces to classify near hexagons with quads and with lines of size three. We also construct some infinite families of near polygons.


Journal of Combinatorial Theory | 1985

A note on planar difference sets

Ha Henny Wilbrink

It is proven that if G is an abelian regular automorphism group of a projective plane of order n and if p is a prime dividing n exactly once, then a certain identity holds in the group algebra Fp|G|. As a corollary we obtain that n = p if p = 2 or 3.


Discrete Mathematics | 1991

Hermitian unitals are code words

A Aart Blokhuis; Ae Andries Brouwer; Ha Henny Wilbrink

We show that a unital PG(2, q2) is Hermitian if and only if it is in the code generated by the lines of PG(2, q2). This implies the truth of a conjecture made by Assmus and Key.


Discrete and Computational Geometry | 1992

Alternative proof of Sine's theorem on the size of a regular polygon in R n with the e ∞ -metric

A Aart Blokhuis; Ha Henny Wilbrink

It is shown that a regular polygon inRn with the (2n)n-metric has at most (2n)n vertices.


Discrete Mathematics | 1992

Some 2–ranks

Ae Andries Brouwer; Ha Henny Wilbrink; Willem H. Haemers

Abstract We compute the dimension of some of the binary codes associated with the unitial U (3, q ), the generalized quadrangle U (4, q ) and its dual O 6 − ( q ) for odd q .


European Journal of Combinatorics | 1986

A class of graphs containing the polar spaces

A Aart Blokhuis; Ton Kloks; Ha Henny Wilbrink

We consider finite graphs with the property that there exists a constant e such that for every maximal clique M and vertex x not in M, x is adjacent to exactly e vertices in M. It is shown that these graphs have a highly geometric structure which in many ways resembles that of the polar spaces.


Combinatorica | 1992

Characterization of complete exterior sets of conics

A Aart Blokhuis; Ákos Seress; Ha Henny Wilbrink

AbstractLet ε be a set ofn


Handbook of Incidence Geometry#R##N#Buildings and Foundations | 1995

Chapter 8 – Block Designs

Ae Andries Brouwer; Ha Henny Wilbrink


Journal of Geometry | 1982

Blocking sets in translation planes

Ae Andries Brouwer; Ha Henny Wilbrink

frac{{q + 1}}{2}


Theoretical Computer Science | 1983

Near polygons with lines of size three and Fischer spaces

Ae Andries Brouwer; Am Arjeh Cohen; Ha Henny Wilbrink

Collaboration


Dive into the Ha Henny Wilbrink's collaboration.

Top Co-Authors

Avatar

Ae Andries Brouwer

Eindhoven University of Technology

View shared research outputs
Top Co-Authors

Avatar

A Aart Blokhuis

Eindhoven University of Technology

View shared research outputs
Top Co-Authors

Avatar

Am Arjeh Cohen

Eindhoven University of Technology

View shared research outputs
Top Co-Authors

Avatar

Ákos Seress

University of Western Australia

View shared research outputs
Top Co-Authors

Avatar

J.J. Seidel

Eindhoven University of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Ton Kloks

University of Lethbridge

View shared research outputs
Top Co-Authors

Avatar

J. J. Hall

Michigan State University

View shared research outputs
Researchain Logo
Decentralizing Knowledge