Bóna, Miklós
Overview
Works:  20 works in 143 publications in 2 languages and 2,556 library holdings 

Genres:  Textbooks 
Roles:  Author, Editor 
Publication Timeline
.
Most widely held works by
Miklós Bóna
A walk through combinatorics : an introduction to enumeration and graph theory by
Miklós Bóna(
Book
)
52 editions published between 2002 and 2017 in English and held by 844 WorldCat member libraries worldwide
Textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course. Just as with the first edition, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible for the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings and Eulerian and Hamiltonian cycles. The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, and algorithms and complexity. every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading
52 editions published between 2002 and 2017 in English and held by 844 WorldCat member libraries worldwide
Textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course. Just as with the first edition, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible for the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings and Eulerian and Hamiltonian cycles. The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, and algorithms and complexity. every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading
Combinatorics of permutations by
Miklós Bóna(
Book
)
27 editions published between 2004 and 2013 in English and held by 773 WorldCat member libraries worldwide
"Combinatorics of Permutations offers the first comprehensive, uptodate treatment of both enumerative and extremal combinatorics and looks at permutation as both linear orders and as elements of the symmetric group. Filled with applications from a variety of fields and exercises that draw upon recent research results, this book serves equally well as a graduatelevel text and a reference for combinatorics researchers."Jacket
27 editions published between 2004 and 2013 in English and held by 773 WorldCat member libraries worldwide
"Combinatorics of Permutations offers the first comprehensive, uptodate treatment of both enumerative and extremal combinatorics and looks at permutation as both linear orders and as elements of the symmetric group. Filled with applications from a variety of fields and exercises that draw upon recent research results, this book serves equally well as a graduatelevel text and a reference for combinatorics researchers."Jacket
Combinatorics of permutations by
Miklós Bóna(
)
8 editions published in 2012 in English and held by 262 WorldCat member libraries worldwide
"A 2006 CHOICE Outstanding Academic Title, this text provides comprehensive coverage of permutations. The second edition features a new chapter on modeling genomes by using permutations. Along with new applications such as genome sorting, this edition includes a set of warmup exercises to ease readers into a problem solving mode as well as new sections addressing the growth rate of permutation classes, permutation tableaux, superpatterns, and alternating subsequences. The text also discusses pattern avoidance, inversions, and linear orders"
8 editions published in 2012 in English and held by 262 WorldCat member libraries worldwide
"A 2006 CHOICE Outstanding Academic Title, this text provides comprehensive coverage of permutations. The second edition features a new chapter on modeling genomes by using permutations. Along with new applications such as genome sorting, this edition includes a set of warmup exercises to ease readers into a problem solving mode as well as new sections addressing the growth rate of permutation classes, permutation tableaux, superpatterns, and alternating subsequences. The text also discusses pattern avoidance, inversions, and linear orders"
Handbook of enumerative combinatorics by
Miklós Bóna(
)
15 editions published in 2015 in English and held by 238 WorldCat member libraries worldwide
Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today's most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these methods. This important new work is edited by Miklós Bóna of the University of Florida where he is a member of the Academy of Distinguished Teaching Scholars. He received his Ph. D. in mathematics at Massachusetts Institute of Technology in 1997. Miklós is the author of four books and more than 65 research articles, including the awardwinning C
15 editions published in 2015 in English and held by 238 WorldCat member libraries worldwide
Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today's most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these methods. This important new work is edited by Miklós Bóna of the University of Florida where he is a member of the Academy of Distinguished Teaching Scholars. He received his Ph. D. in mathematics at Massachusetts Institute of Technology in 1997. Miklós is the author of four books and more than 65 research articles, including the awardwinning C
Introduction to enumerative and analytic combinatorics by
Miklós Bóna(
Book
)
8 editions published between 2015 and 2016 in English and held by 205 WorldCat member libraries worldwide
An overview of all enumerative combinatorics within reach of undergraduates; the two fundamental themes of bijective proofs and generating functions, together with their intimate connections, recur constantly. A wide selection of topics, including several never appearing before in a textbook, is included that gives an idea of the vast range of enumerative combinatorics
8 editions published between 2015 and 2016 in English and held by 205 WorldCat member libraries worldwide
An overview of all enumerative combinatorics within reach of undergraduates; the two fundamental themes of bijective proofs and generating functions, together with their intimate connections, recur constantly. A wide selection of topics, including several never appearing before in a textbook, is included that gives an idea of the vast range of enumerative combinatorics
Introduction to enumerative combinatorics by
Miklós Bóna(
Book
)
16 editions published between 2006 and 2016 in English and held by 194 WorldCat member libraries worldwide
16 editions published between 2006 and 2016 in English and held by 194 WorldCat member libraries worldwide
Introduction to Enumerative and Analytic Combinatorics, Second Edition by
Miklós Bóna(
)
1 edition published in 2015 in English and held by 14 WorldCat member libraries worldwide
1 edition published in 2015 in English and held by 14 WorldCat member libraries worldwide
Walk Through Combinatorics, A by
Miklós Bóna(
)
3 editions published between 2006 and 2016 in English and held by 12 WorldCat member libraries worldwide
3 editions published between 2006 and 2016 in English and held by 12 WorldCat member libraries worldwide
Walk through combinatorics, a (fourth edition) by
Miklós Bóna(
Book
)
1 edition published in 2016 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 2016 in English and held by 3 WorldCat member libraries worldwide
Combinatorics of Permutations, Second Edition by
Miklós Bóna(
Book
)
1 edition published in 2016 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2016 in English and held by 2 WorldCat member libraries worldwide
Concepts in calculus by
Miklós Bóna(
Book
)
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
Concepts in calculus iii (non beta) by
Miklós Bóna(
Book
)
1 edition published in 2012 in English and held by 1 WorldCat member library worldwide
1 edition published in 2012 in English and held by 1 WorldCat member library worldwide
Combinatorics of permutations by
Miklós Bóna(
)
2 editions published in 2004 in English and held by 1 WorldCat member library worldwide
2 editions published in 2004 in English and held by 1 WorldCat member library worldwide
Exact and asymptotic enumeration of permutations with subsequence conditions by
Miklós Bóna(
)
1 edition published in 1997 in English and held by 1 WorldCat member library worldwide
1 edition published in 1997 in English and held by 1 WorldCat member library worldwide
2stack sortable permutations with a given number of runs by
Miklós Bóna(
Book
)
1 edition published in 1997 in English and held by 1 WorldCat member library worldwide
1 edition published in 1997 in English and held by 1 WorldCat member library worldwide
On a random search tree: asymptotic enumeration of vertices by distance from leaves(
)
1 edition published in 2017 in English and held by 1 WorldCat member library worldwide
Abstract: A random binary search tree grown from the uniformly random permutation of [n] is studied. We analyze the exact and asymptotic counts of vertices by rank, the distance from the set of leaves. The asymptotic fraction c k of vertices of a fixed rank k e"0 is shown to decay exponentially with k . We prove that the ranks of the uniformly random, fixed size sample of vertices are asymptotically independent, each having the distribution { c k }. Notoriously hard to compute, the exact fractions c k have been determined for k d"3 only. We present a shortcut enabling us to compute c 4 and c 5 as well; both are ratios of enormous integers, the denominator of c 5 being 274 digits long. Prompted by the data, we prove that, in sharp contrast, the largest prime divisor of the denominator of c k is at most 2 k +1 + 1. We conjecture that, in fact, the prime divisors of every denominator for k> 1 form a single interval, from 2 to the largest prime not exceeding 2 k +1 + 1
1 edition published in 2017 in English and held by 1 WorldCat member library worldwide
Abstract: A random binary search tree grown from the uniformly random permutation of [n] is studied. We analyze the exact and asymptotic counts of vertices by rank, the distance from the set of leaves. The asymptotic fraction c k of vertices of a fixed rank k e"0 is shown to decay exponentially with k . We prove that the ranks of the uniformly random, fixed size sample of vertices are asymptotically independent, each having the distribution { c k }. Notoriously hard to compute, the exact fractions c k have been determined for k d"3 only. We present a shortcut enabling us to compute c 4 and c 5 as well; both are ratios of enormous integers, the denominator of c 5 being 274 digits long. Prompted by the data, we prove that, in sharp contrast, the largest prime divisor of the denominator of c k is at most 2 k +1 + 1. We conjecture that, in fact, the prime divisors of every denominator for k> 1 form a single interval, from 2 to the largest prime not exceeding 2 k +1 + 1
Concepts in calculus ii beta version by
Miklós Bóna(
Book
)
1 edition published in 2011 in English and held by 1 WorldCat member library worldwide
1 edition published in 2011 in English and held by 1 WorldCat member library worldwide
A combinatorial proof of a result of Hetyei and Reiner on FoataStrehl type permutation trees by
Miklós Bóna(
Book
)
1 edition published in 1997 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1997 in English and held by 0 WorldCat member libraries worldwide
Exact enumeration of 1342avoiding permutations : a close link with labeled trees and planar maps by
Miklós Bóna(
Book
)
1 edition published in 1997 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1997 in English and held by 0 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Stanley, Richard P. 1944 Author of introduction
 CRC Press Publisher
 Shabanov, Sergei V.
 Pittel, Boris
 Taylor & Francis Publisher
Useful Links