25,161
edits
Changes
Created page with "'''Home * People * Nicolaas de Bruijn''' FILE:De_Bruijn.jpg|border|right|thumb|172px|link=http://turnbull.mcs.st-and.ac.uk/%7Ehistory/Biographies/De_Bruij..."
'''[[Main Page|Home]] * [[People]] * Nicolaas de Bruijn'''
[[FILE:De_Bruijn.jpg|border|right|thumb|172px|link=http://turnbull.mcs.st-and.ac.uk/%7Ehistory/Biographies/De_Bruijn.html| Nicolaas Govert de Bruijn <ref>[http://turnbull.mcs.st-and.ac.uk/%7Ehistory/Biographies/De_Bruijn.html Nicolaas Govert de Bruijn - biography] © July 2008 by [http://www-maths.mcs.st-andrews.ac.uk/pictdisplay/JOC.html J J O'Connor] and [http://www-history.mcs.st-and.ac.uk/%7Eedmund/ E F Robertson] School of Mathematics and Statistics, [https://en.wikipedia.org/wiki/University_of_St_Andrews University of St Andrews], Scotland</ref> ]]
'''Nicolaas Govert de Bruijn''', (July 9, 1918 – February 17, 2012 <ref>[http://processalgebra.blogspot.de/2012/02/nicolaas-govert-de-bruijn-1918-2012.html Process Algebra Diary: Nicolaas Govert de Bruijn (1918-2012)]</ref>)<br/>
was a Dutch mathematician, covering many areas of mathematics. Eponym of the [[De Bruijn Sequence|De Bruijn Sequences]] <ref>[https://en.wikipedia.org/wiki/De_Bruijn_sequence De Bruijn sequence from Wikipedia]</ref> - as used for instance in computer chess programming to [[BitScan#DeBruijnMultiplation|scan bits]] of set-wise representations such as [[Bitboards]] <ref>[[Charles Leiserson|Charles E. Leiserson]], [[Harald Prokop]] and [[Keith H. Randall]] ('''1998'''). ''Using de Bruijn Sequences to Index a 1 in a Computer Word''. [http://supertech.csail.mit.edu/papers/debruijn.pdf pdf]</ref>.
According to De Bruijn himself <ref>[[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, [http://alexandria.tue.nl/repository/books/252901.pdf pdf]</ref>, 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 [[Mathematician#Ehrenfest|Tanja van Ardenne-Ehrenfest]] <ref>[[Nicolaas de Bruijn]] ('''1985'''). ''In Memoriam T. van Ardenne-Ehrenfest''. [http://alexandria.tue.nl/repository/freearticles/597575.pdf pdf]</ref> and himself.
=Selected Publications=
* [[Nicolaas de Bruijn]] ('''1946'''). ''A Combinatorial Problem''. Koninklijke Nederlandse Akademie v. Wetenschappen 49: 758–764.
* [[Mathematician#Ehrenfest|Tanja van Ardenne-Ehrenfest]] and [[Nicolaas de Bruijn]] ('''1951'''). ''Circuits and trees in oriented linear graphs''. [http://alexandria.tue.nl/repository/freearticles/597493.pdf 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, [http://alexandria.tue.nl/repository/books/252901.pdf pdf]
* [[Nicolaas de Bruijn]] ('''1985'''). ''In Memoriam T. van Ardenne-Ehrenfest''. [http://alexandria.tue.nl/repository/freearticles/597575.pdf pdf]
=See also=
* [[De Bruijn Sequence]]
* [[BitScan#DeBruijnMultiplation|BitScan - De Bruijn Multiplication]]
* [[De Bruijn Sequence Generator]]
=External Links=
* [https://en.wikipedia.org/wiki/Nicolaas_Govert_de_Bruijn Nicolaas de Bruijn from Wikipedia]
* [http://www.genealogy.math.ndsu.nodak.edu/id.php?id=49968 The Mathematics Genealogy Project - Nicolaas de Bruijn]
* [http://owpdb.mfo.de/person_detail?id=539 Details for Nicolaas Govert de Bruijn - Oberwolfach Photo Collection]
* [https://en.wikipedia.org/wiki/De_Bruijn De Bruijn (disambiguation) from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn%E2%80%93Erd%C5%91s_theorem De Bruijn–Erdős theorem from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn_graph De Bruijn graph from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn_index De Bruijn index from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn%E2%80%93Newman_constant De Bruijn–Newman constant from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn_notation De Bruijn notation from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn_sequence De Bruijn sequence from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn%27s_theorem De Bruijn's theorem from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn_torus De Bruijn torus from Wikipedia]
* [https://en.wikipedia.org/wiki/Automath Automath from Wikipedia]
* [http://processalgebra.blogspot.de/2012/02/nicolaas-govert-de-bruijn-1918-2012.html Process Algebra Diary: Nicolaas Govert de Bruijn (1918-2012)]
* [http://headinside.blogspot.de/2012/02/de-bruijns-magic.html Grey Matters: Blog: de Bruijn's Magic]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:De_Bruijn.jpg|border|right|thumb|172px|link=http://turnbull.mcs.st-and.ac.uk/%7Ehistory/Biographies/De_Bruijn.html| Nicolaas Govert de Bruijn <ref>[http://turnbull.mcs.st-and.ac.uk/%7Ehistory/Biographies/De_Bruijn.html Nicolaas Govert de Bruijn - biography] © July 2008 by [http://www-maths.mcs.st-andrews.ac.uk/pictdisplay/JOC.html J J O'Connor] and [http://www-history.mcs.st-and.ac.uk/%7Eedmund/ E F Robertson] School of Mathematics and Statistics, [https://en.wikipedia.org/wiki/University_of_St_Andrews University of St Andrews], Scotland</ref> ]]
'''Nicolaas Govert de Bruijn''', (July 9, 1918 – February 17, 2012 <ref>[http://processalgebra.blogspot.de/2012/02/nicolaas-govert-de-bruijn-1918-2012.html Process Algebra Diary: Nicolaas Govert de Bruijn (1918-2012)]</ref>)<br/>
was a Dutch mathematician, covering many areas of mathematics. Eponym of the [[De Bruijn Sequence|De Bruijn Sequences]] <ref>[https://en.wikipedia.org/wiki/De_Bruijn_sequence De Bruijn sequence from Wikipedia]</ref> - as used for instance in computer chess programming to [[BitScan#DeBruijnMultiplation|scan bits]] of set-wise representations such as [[Bitboards]] <ref>[[Charles Leiserson|Charles E. Leiserson]], [[Harald Prokop]] and [[Keith H. Randall]] ('''1998'''). ''Using de Bruijn Sequences to Index a 1 in a Computer Word''. [http://supertech.csail.mit.edu/papers/debruijn.pdf pdf]</ref>.
According to De Bruijn himself <ref>[[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, [http://alexandria.tue.nl/repository/books/252901.pdf pdf]</ref>, 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 [[Mathematician#Ehrenfest|Tanja van Ardenne-Ehrenfest]] <ref>[[Nicolaas de Bruijn]] ('''1985'''). ''In Memoriam T. van Ardenne-Ehrenfest''. [http://alexandria.tue.nl/repository/freearticles/597575.pdf pdf]</ref> and himself.
=Selected Publications=
* [[Nicolaas de Bruijn]] ('''1946'''). ''A Combinatorial Problem''. Koninklijke Nederlandse Akademie v. Wetenschappen 49: 758–764.
* [[Mathematician#Ehrenfest|Tanja van Ardenne-Ehrenfest]] and [[Nicolaas de Bruijn]] ('''1951'''). ''Circuits and trees in oriented linear graphs''. [http://alexandria.tue.nl/repository/freearticles/597493.pdf 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, [http://alexandria.tue.nl/repository/books/252901.pdf pdf]
* [[Nicolaas de Bruijn]] ('''1985'''). ''In Memoriam T. van Ardenne-Ehrenfest''. [http://alexandria.tue.nl/repository/freearticles/597575.pdf pdf]
=See also=
* [[De Bruijn Sequence]]
* [[BitScan#DeBruijnMultiplation|BitScan - De Bruijn Multiplication]]
* [[De Bruijn Sequence Generator]]
=External Links=
* [https://en.wikipedia.org/wiki/Nicolaas_Govert_de_Bruijn Nicolaas de Bruijn from Wikipedia]
* [http://www.genealogy.math.ndsu.nodak.edu/id.php?id=49968 The Mathematics Genealogy Project - Nicolaas de Bruijn]
* [http://owpdb.mfo.de/person_detail?id=539 Details for Nicolaas Govert de Bruijn - Oberwolfach Photo Collection]
* [https://en.wikipedia.org/wiki/De_Bruijn De Bruijn (disambiguation) from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn%E2%80%93Erd%C5%91s_theorem De Bruijn–Erdős theorem from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn_graph De Bruijn graph from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn_index De Bruijn index from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn%E2%80%93Newman_constant De Bruijn–Newman constant from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn_notation De Bruijn notation from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn_sequence De Bruijn sequence from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn%27s_theorem De Bruijn's theorem from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Bruijn_torus De Bruijn torus from Wikipedia]
* [https://en.wikipedia.org/wiki/Automath Automath from Wikipedia]
* [http://processalgebra.blogspot.de/2012/02/nicolaas-govert-de-bruijn-1918-2012.html Process Algebra Diary: Nicolaas Govert de Bruijn (1918-2012)]
* [http://headinside.blogspot.de/2012/02/de-bruijns-magic.html Grey Matters: Blog: de Bruijn's Magic]
=References=
<references />
'''[[People|Up one level]]'''
