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

According to De Bruijn himself ^{[4]}, 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^{[5]} and himself.

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 (1975). Acknowledgement 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

Home * People * Nicolaas de BruijnNicolaas Govert de Bruijn, (July 9, 1918 – February 17, 2012^{[1]})was a Dutch mathematician, covering many areas of mathematics. Eponym of the De Bruijn sequences

^{[2]}- as used for instance in computer chess programming to scan bits of set-wise representations such as Bitboards^{[3]}.According to De Bruijn himself

^{[4]}, the existence of De Bruijn sequences for each order were first proved, for the case of alphabets with two elements, byCamille Flye Sainte-Mariein 1894, whereas the generalization to larger alphabets is originally due to Tanja van Ardenne-Ehrenfest^{[5]}and himself.^{[6]}## Table of Contents

## Selected Publications

1946).A Combinatorial Problem. Koninklijke Nederlandse Akademie v. Wetenschappen 49: 758–764.1951).Circuits and trees in oriented linear graphs. pdf1975).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, pdf1985).In Memoriam T. van Ardenne-Ehrenfest. pdf## See also

## External Links

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

## References

1998).Using de Bruijn Sequences to Index a 1 in a Computer Word. pdf1975).Acknowledgement 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, pdf1985).In Memoriam T. van Ardenne-Ehrenfest. pdf## What links here?

Up one level