Miklós Bóna

Miklós Bóna (born October 6, 1967, in Székesfehérvár) is an American mathematician of Hungarian origin.

Miklós Bóna in 2010.

Bóna completed his undergraduate studies in Budapest and Paris, then obtained his Ph.D. at MIT in 1997 as a student of Richard P. Stanley.[1] Since 1999, he has taught at the University of Florida, where in 2010 he was inducted to the Academy of Distinguished Teaching Scholars.[2]

Bóna's main fields of research include the combinatorics of permutations, as well as enumerative and analytic combinatorics. Since 2010, he has been one of the editors-in-chief of the Electronic Journal of Combinatorics.[3]

Books

  • Miklós Bóna (2016). A Walk Through Combinatorics. Singapore: World Scientific. ISBN 9814460001.
  • Miklós Bóna (2012). Combinatorics of Permutations. Boca Raton, Florida: CRC Press & Chapman Hall. ISBN 1439850518.
  • Miklós Bóna (2012). Introduction to Enumerative Combinatorics. Boston: McGraw-Hill. ISBN 007312561X.
  • Miklós Bóna and Sergei Shabanov (2012). Concepts in Calculus. Gainesville, FL: Orange Grove Texts Plus. ISBN 1616101709.
  • Miklós Bóna, ed. (2015). Handbook of Enumerative Combinatorics. Boca Raton, Florida: CRC Press & Chapman Hall. ISBN 9781482220858.
  • Miklós Bóna (2015). Introduction to Enumerative and Analytic Combinatorics. Boca Raton, Florida: CRC Press & Chapman Hall. ISBN 148224909X.
gollark: Implement checksumming in the bacteria or whatever you're using and make them self-destruct if they lose too many bases to be able to read out the data or if there's an invalid checksum.
gollark: And real life deals with it by dying or getting cancer half the time.
gollark: Error correcting codes are more flexible, though.
gollark: Or just use regular ECC stuff.
gollark: "yes, I have my computer backed up to a bunch of amoebas in this tank here, how about you?"

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.