Difference between revisions of "Nicolaas de Bruijn"
GerdIsenberg (talk | contribs) (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...") |
GerdIsenberg (talk | contribs) |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
'''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/> | '''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]] | + | 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]], [[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. | 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. | ||
| Line 10: | Line 10: | ||
=Selected Publications= | =Selected Publications= | ||
* [[Nicolaas de Bruijn]] ('''1946'''). ''A Combinatorial Problem''. Koninklijke Nederlandse Akademie v. Wetenschappen 49: 758–764. | * [[Nicolaas de Bruijn]] ('''1946'''). ''A Combinatorial Problem''. Koninklijke Nederlandse Akademie v. Wetenschappen 49: 758–764. | ||
| − | * [[Mathematician#Ehrenfest|Tanja van Ardenne-Ehrenfest]] | + | * [[Mathematician#Ehrenfest|Tanja van Ardenne-Ehrenfest]], [[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]] ('''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] | * [[Nicolaas de Bruijn]] ('''1985'''). ''In Memoriam T. van Ardenne-Ehrenfest''. [http://alexandria.tue.nl/repository/freearticles/597575.pdf pdf] | ||
=See also= | =See also= | ||
| + | * [[BitScan#DeBruijnMultiplation|BitScan - De Bruijn Multiplication]] | ||
* [[De Bruijn Sequence]] | * [[De Bruijn Sequence]] | ||
| − | |||
* [[De Bruijn Sequence Generator]] | * [[De Bruijn Sequence Generator]] | ||
| Line 40: | Line 40: | ||
'''[[People|Up one level]]''' | '''[[People|Up one level]]''' | ||
| + | [[Category:Mathematician|Bruijn]] | ||
Latest revision as of 17:57, 4 September 2018
Home * People * Nicolaas de Bruijn
Nicolaas Govert de Bruijn [1]
Nicolaas Govert de Bruijn, (July 9, 1918 – February 17, 2012 [2])
was a Dutch mathematician, covering many areas of mathematics. Eponym of the De Bruijn Sequences [3] - as used for instance in computer chess programming to scan bits of set-wise representations such as Bitboards [4].
According to De Bruijn himself [5], 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 [6] 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
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
- ↑ Nicolaas Govert de Bruijn - biography © July 2008 by J J O'Connor and E F Robertson School of Mathematics and Statistics, University of St Andrews, Scotland
- ↑ Process Algebra Diary: Nicolaas Govert de Bruijn (1918-2012)
- ↑ De Bruijn sequence from Wikipedia
- ↑ Charles E. Leiserson, Harald Prokop, Keith H. Randall (1998). Using de Bruijn Sequences to Index a 1 in a Computer Word. 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
- ↑ Nicolaas de Bruijn (1985). In Memoriam T. van Ardenne-Ehrenfest. pdf
