Английская Википедия:David Bevan (mathematician)

Материал из Онлайн справочника
Перейти к навигацииПерейти к поиску

Шаблон:EngvarB Шаблон:Use dmy dates Шаблон:Short description Шаблон:Other people Шаблон:Infobox scientist David Bevan is an English mathematician, computer scientist and software developer. He is known for Bevan's theorem, which gives the asymptotic enumeration of grid classes of permutations[1][2] and for his work on enumerating the class of permutations avoiding the pattern 1324.[2][3] He is also known for devising weighted reference counting, an approach to computer memory management that is suitable for use in distributed systems.[4][5]

Work and research

Bevan is a lecturer in combinatorics in the department of Mathematics and Statistics at the University of Strathclyde.[6][7][8] He has degrees in mathematics and computer science from the University of Oxford and a degree in theology from the London School of Theology.[9] He received his PhD in mathematics from The Open University in 2015; his thesis, On the growth of permutation classes, was supervised by Robert Brignall.[10]

In 1987, as a research scientist at GEC's Hirst Research Centre in Wembley, he developed an approach to computer memory management, called weighted reference counting, that is suitable for use in distributed systems.[4][5] During the 1990s, while working for the Summer Institute of Linguistics in Papua New Guinea, he developed a computer program, called FindPhone, that was widely used by field linguists to analyse phonetic data in order to understand the phonology of minority languages.[11][12][13] While employed by Pitney Bowes, he was a major contributor to the development of the FreeType text rendering library.[14]

Bevan's mathematical research has concerned areas of enumerative combinatorics, particularly in relation to permutation classes.[2] He established that the growth rate of a monotone grid class of permutations is equal to the square of the spectral radius of a related bipartite graph.[1][2] He has also determined bounds on the growth rate of the class of permutations avoiding the pattern 1324.[2][3] In the Acknowledgements sections of his journal articles, he often includes the Latin phrase Soli Deo gloria.[15][16][17]

Selected publications

External links

References

Шаблон:Reflist

Шаблон:Authority control

Партнерские ресурсы
Криптовалюты
Магазины
Хостинг
Разное

  1. ↑ 1,0 1,1 Шаблон:Cite journal
  2. ↑ 2,0 2,1 2,2 2,3 2,4 Шаблон:Cite book
  3. ↑ 3,0 3,1 Шаблон:Cite book
  4. ↑ 4,0 4,1 Шаблон:Cite conference
  5. ↑ 5,0 5,1 Шаблон:Cite book
  6. ↑ Staff | University of Strathclyde
  7. ↑ Dr David Bevan | University of Strathclyde
  8. ↑ The Strathclyde Combinatorics Group
  9. ↑ Curriculum vitae from Dr David Bevan's Open University webpage
  10. ↑ Ошибка цитирования Неверный тег <ref>; для сносок mgen не указан текст
  11. ↑ Шаблон:Cite journal
  12. ↑ Шаблон:Cite book
  13. ↑ Шаблон:Cite journal
  14. ↑ FreeType Authors & Developers
  15. ↑ Шаблон:Cite journal
  16. ↑ Шаблон:Cite journal
  17. ↑ Шаблон:Cite journal
Источник — http://wikihandbk.com/ruwiki/index.php?title=Английская_Википедия:David_Bevan_(mathematician)&oldid=14208411