Nicolaas de Bruijn

Home * People * Nicolaas de Bruijn

Nicolaas Govert de Bruijn, (July 9, 1918 – February 17, 2012 ) was a Dutch mathematician, covering many areas of mathematics. Eponym of the De Bruijn Sequences - as used for instance in computer chess programming to scan bits of set-wise representations such as Bitboards.

According to De Bruijn himself, the existence of De Bruijn sequences for each order were first proved, for the case of alphabets with two elements, by Camille Flye Sainte-Marie in 1894, whereas the generalization to larger alphabets is originally due to Tanja van Ardenne-Ehrenfest and himself.

=Selected Publications=
 * Nicolaas de Bruijn (1946). A Combinatorial Problem. Koninklijke Nederlandse Akademie v. Wetenschappen 49: 758–764.
 * Tanja van Ardenne-Ehrenfest, Nicolaas de Bruijn (1951). Circuits and trees in oriented linear graphs. pdf
 * Nicolaas de Bruijn (1975). Acknowledgment of priority to C. Flye Sainte-Marie on the counting of circular arrangements of 2n zeros and ones that show each n-letter word exactly once. Technical Report, Technische Hogeschool Eindhoven, pdf
 * Nicolaas de Bruijn (1985). In Memoriam T. van Ardenne-Ehrenfest. pdf

=See also=
 * BitScan - De Bruijn Multiplication
 * De Bruijn Sequence
 * De Bruijn Sequence Generator

=External Links=
 * Nicolaas de Bruijn from Wikipedia
 * The Mathematics Genealogy Project - Nicolaas de Bruijn
 * Details for Nicolaas Govert de Bruijn - Oberwolfach Photo Collection
 * De Bruijn (disambiguation) from Wikipedia
 * De Bruijn–Erdős theorem from Wikipedia
 * De Bruijn graph from Wikipedia
 * De Bruijn index from Wikipedia
 * De Bruijn–Newman constant from Wikipedia
 * De Bruijn notation from Wikipedia
 * De Bruijn sequence from Wikipedia
 * De Bruijn's theorem from Wikipedia
 * De Bruijn torus from Wikipedia


 * Automath from Wikipedia
 * Process Algebra Diary: Nicolaas Govert de Bruijn (1918-2012)
 * Grey Matters: Blog: de Bruijn's Magic

=References=

Up one level