Miklós Bóna | Academic Influence

Miklós Bóna's AcademicInfluence.com Rankings

Miklós Bóna

Mathematics

#3087

World Rank

#4625

Historical Rank

#1167

USA Rank

Combinatorics

#32

World Rank

#36

Historical Rank

#9

USA Rank

Measure Theory

#1393

World Rank

#1746

Historical Rank

#482

USA Rank

mathematics Degrees

Download Badge

Mathematics

Miklós Bóna's Degrees

PhD Mathematics University of California, San Diego
Masters Mathematics University of California, San Diego
Bachelors Mathematics Eötvös Loránd University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Miklós Bóna Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Miklós Bóna is an American mathematician of Hungarian origin. 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. Since 1999, he has taught at the University of Florida, where in 2010 he was inducted to the Academy of Distinguished Teaching Scholars.

(See a Problem?)

Miklós Bóna's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Combinatorics of permutations (2022) (630)
Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps (1997) (153)
A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory (2006) (124)
A Survey of Stack-Sorting Disciplines (2003) (119)
Charged jet evolution and the underlying event in proton-antiproton collisions at 1.8 TeV (2002) (107)
Introduction to Enumerative Combinatorics (2005) (84)
Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley (2007) (72)
Permutations avoiding certain patterns: The case of length 4 and some generalizations (1997) (71)
Combinatorics of Permutations, Second Edition (2012) (63)
The Permutation Classes Equinumerous to the Smooth Class (1998) (61)
Permutations with one or two 132-subsequences (1998) (58)
The Solution of a Conjecture of Stanley and Wilf for All Layered Patterns (1999) (56)
An Infinite Antichain of Permutations (1998) (52)
Measurement of the differential cross section for isolated prompt photon production in pp collisions at 7 TeV (2011) (45)
Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs (1999) (43)
Isomorphism and Symmetries in Random Phylogenetic Trees (2009) (43)
Enumeration of m-Ary Cacti (1998) (43)
The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns (2004) (38)
Surprising Symmetries in Objects Counted by Catalan Numbers (2012) (38)
Search for a W ' boson decaying to a muon and a neutrino in pp collisions at √s =7 TeV (2011) (37)
Symmetry and Unimodality in t-Stack Sortable Permutations (2002) (37)
The average number of block interchanges needed to sort a permutation and a recent result of Stanley (2008) (34)
The Number of Permutations with Exactlyr132-Subsequences IsP-Recursive in the Size! (1997) (33)
The absence of a pattern and the occurrences of another (2010) (33)
New records in Stanley-Wilf limits (2007) (28)
Permutation Patterns: On three different notions of monotone subsequences (2007) (26)
A New Upper Bound for 1324-Avoiding Permutations (2012) (25)
Handbook of Enumerative Combinatorics (2015) (25)
Real zeros and partitions without singleton blocks (2007) (25)
A new record for 1324-avoiding permutations (2014) (24)
k-Protected vertices in binary search trees (2013) (23)
The copies of any permutation pattern are asymptotically normal (2007) (21)
On the Probability that Certain Compositions Have the Same Number Of Parts (2010) (19)
On divisibility of Narayana numbers by primes (2005) (17)
Permutations with roots (2000) (17)
Pattern-avoiding involutions: exact and asymptotic enumeration (2013) (16)
Exact and asymptotic enumeration of permutations with subsequence conditions (1997) (16)
A Combinatorial Proof of the Log-Concavity of a Famous Sequence Counting Permutations (2005) (16)
Introduction to Enumerative and Analytic Combinatorics (2015) (15)
A simple proof for the exponential upper bound for some tenacious patterns (2004) (15)
A simplicial complex of 2-stack sortable permutations (2002) (14)
On a random search tree: asymptotic enumeration of vertices by distance from leaves (2014) (13)
Enumeration of Viral Capsid Assembly Pathways: Tree Orbits Under Permutation Group Action (2011) (13)
A self-dual poset on objects counted by the Catalan numbers and a type-B analogue (1999) (12)
Generalized Descents and Normality (2007) (12)
Pattern Frequency Sequences and Internal Zeros (2001) (11)
Non-overlapping permutation patterns (2012) (10)
On a Family of Conjectures of Joel Lewis on Alternating Permutations (2012) (10)
Partitions with k Crossings (1999) (9)
Cyclic permutations avoiding pairs of patterns of length three (2018) (9)
On a Balanced Property of Derangements (2006) (8)
Where the monotone pattern (mostly) rules (2007) (8)
Stack words and a bound for 3-stack sortable permutations (2019) (8)
Supercritical sequences, and the nonrationality of most principal permutation classes (2020) (7)
On the enumeration of certain weighted graphs (2006) (7)
The Number of Ways to Assemble a Graph (2012) (6)
A Survey of Stack Sortable Permutations (2019) (6)
On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length (2012) (6)
A New Proof of the Formula for the Number of 3 × 3 Magic Squares (1997) (6)
A combinatorial approach to matrix theory and Its applications by Richard Brualdi and Dragos Cvetkovic, Published by Cambridge Press, 2009 824 pages, hardcover (2010) (5)
Pattern avoidance in permutations and their squares (2018) (5)
A Ramsey-type problem on right-angled triangles in space (1996) (5)
On the cycle structure of the product of random maximal cycles (2016) (5)
Enumerating Solutions of a System of Linear Inequalities Related to Magic Squares (2006) (5)
Symmetry in Sphere-Based Assembly Configuration Spaces (2016) (5)
Review of probability: theory and examples, 4th edition by Rick Durrett (2011) (5)
The influence of symmetry on the probability of assembly pathways for icosahedral viral shells (2008) (4)
On the number of vertices of each rank in phylogenetic trees and their generalizations (2015) (4)
A Euclidean Ramsey theorem (1993) (4)
2-stack sortable permutations with a given number of runs (1997) (4)
Longest Increasing Subsequences and Log Concavity (2015) (4)
Sorting a Permutation by block moves (2008) (3)
Review of Combinatorics and graph theory: (second edition) by John M. Harris, Jeffry L. Hirst and Michael J. Mossinghoff (2009) (3)
Review of extremal combinatorics with applications to computer science (2nd edition) by Stasys Jukna (2013) (3)
Limiting Probabilities for Vertices of a Given Rank in 1-2 Trees (2019) (3)
A combinatorial proof of a result of hetyei and reiner on Foata-Strehl-type permutation trees (1997) (3)
Permutations and the Rest. Algebraic Combinatorics of Permutations. (2012) (2)
On the number of vertices of each rank in k-phylogenetic trees (2016) (2)
Introduction to Enumerative and Analytic Combinatorics, Second Edition (2016) (2)
The limit of a Stanley-Wilf sequence is not always an integer , and layered patterns beat monotone patterns (2004) (2)
On a Balanced Property of Compositions (2006) (2)
Review of proofs from THE BOOK (4th edition) by Martin Aigner and Günter M. Ziegler (2011) (2)
Measurement of B(B)over-bar angular correlations based on secondary vertex reconstruction at root s=7 TeV RID G-1804-2011 RID D-8853-2011 RID E-8846-2011 RID D-6623-2011 (2011) (2)
Do Not Cross: Planar Graphs (2006) (2)
There Are a Lot of Magic Squares (1995) (2)
Sharper estimates for the number of permutations avoiding a layered or decomposable pattern (2004) (2)
On the Endomorphism Conjecture for Posets with 0 (1997) (1)
Pattern Avoiding Permutations with a Unique Longest Increasing Subsequence (2020) (1)
Pattern Avoidance and Genome Sorting (Dagstuhl Seminar 16071) (2016) (1)
Enumeration of m-ary cacti according to their color and degree distributions (1998) (1)
A Bijective Proof of and Identity Extending a Classic Result of Hajos (2012) (1)
Limiting probabilities for vertices of a given rank in rooted trees (2018) (1)
Who Knows What It Looks Like, But It Exists: The Probabilistic Method (2006) (1)
An Involution on Involutions and a Generalization of Layered Permutations (2016) (1)
Trees in Many Contexts (2022) (1)
In One Line And Anywhere. Permutations as Linear Orders. Inversions. (2004) (1)
Counting and Enumeration of Self-assembly pathways for Symmetric macromolecular Structures (2005) (1)
On two related questions of Wilf concerning Standard Young Tableaux (2008) (1)
Tree Orbits under Permutation Group Action: Algorithm, Enumeration and Application to Viral Assembly (2009) (1)
Two injective proofs of a conjecture of Simion (2002) (1)
Balanced vertices in labeled rooted trees (2017) (1)
Editor's Preface (2006) (0)
Review of Algorithmic combinatorics on partial words by Francine Blanchet-Sadri (2009) (0)
On a Family of Conjectures of Joel Lewis on Alternating Permutations (2013) (0)
Do Not Look Just Yet. Solutions to Odd-numbered Exercises. (2004) (0)
Search for radiative b-hadron decays in p(p)over-bar collisions at root s=1.8 TeV RID C-1693-2008 RID A-5169-2010 RID E-4473-2011 RID C-2406-2008 (2002) (0)
Does It Clique? Ramsey Theory (2006) (0)
Workshop in Analytic and Probabilistic Combinatorics BIRS-16w5048 (2016) (0)
Review of applied combinatorics by Fred S. Roberts and Barry Tesman (2011) (0)
There Are A Lot Of Them: Elementary Counting Problems (2006) (0)
You Shall Not Overcount: The Sieve (2006) (0)
Se p 20 07 Generalized Descents and Normality (2022) (0)
A Method to Prove the Nonrationality of Some Combinatorial Generating Functions (2020) (0)
Longest Increasing Subsequences and Log Concavity (2017) (0)
A Function Is Worth Many Numbers: Generating Functions (2006) (0)
How Did We Get Here? Permutations as Genome Rearrangements. (2012) (0)
In This Way, but Nicely. Pattern Avoidance. Follow-Up. (2004) (0)
Review of the life and times of the central limit theorem by William J. Adams (2012) (0)
The Sooner The Better: Combinatorial Algorithms (2006) (0)
Review of analytic combinatorics in several variables by Robin Pemantle and Mark Wilson (2014) (0)
No Matter How You Slice It: The Binomial Theorem and Related Identities (2006) (0)
The absence of a pattern and the number of occurrences of another (2009) (0)
Walk Through Combinatorics, a (Fourth Edition) (2016) (0)
Not So Vicious Cycles: Cycles in Permutations (2006) (0)
Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451) (2018) (0)
Forbidden and Acceptable Line Trees (2002) (0)
Nonrationality and Principal permutation classes: the remaining case (2022) (0)
Analytic combinatorics by Philippe Flajolet and Robert Sedgewick, published by Cambridge Press, 2009 824 pages, hardcover (2010) (0)
Are They Really Different? Counting Unlabeled Structures (2011) (0)
Review of Bijective Combinatorics by Nicholas Loehr (2013) (0)
On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM (2022) (0)
Divide and Conquer: Partitions (2006) (0)
As Evenly As Possible. Block Designs and Error Correcting Codes (2011) (0)
Study of B-0 -> J/psi K-(*)0 pi(+)pi(-) decays with the Collider detector at Fermilab RID C-1693-2008 RID A-5169-2010 RID E-4473-2011 RID C-2406-2008 (2002) (0)
In Any Way But This. Pattern Avoidance. The Basics. (2004) (0)
Review of: Combinatorics of Permutations by (2005) (0)
Seven Is More Than Six: The Pigeon-Hole Principle (2006) (0)
Model-independent Analysis of ΔF = 2 Transitions (2008) (0)
No Way Around It. Introduction. (2004) (0)
Search for new heavy particles in the WZ(0) final state in p(p)over-bar collisions at root s=1.8 TeV RID C-1693-2008 RID A-5169-2010 RID E-4473-2011 RID C-2406-2008 (2002) (0)
Limits on extra dimensions and new particle production in the exclusive photon and missing energy signature in p(p)over-bar collisions at root s=1.8 TeV RID C-1693-2008 RID A-5169-2010 RID E-4473-2011 RID C-2406-2008 (2002) (0)
Most principal permutation classes, and t-stack sortable permutations, have nonrational generating functions (2019) (0)
Pattern avoiding permutations and involutions with a unique longest increasing subsequence (2020) (0)
Does Many Mean More Than One? Computational Complexity (2006) (0)
Review of: Combinatorics of Permutations by MiklÃ3s BÃ3na (2015) (0)
Mean and Insensitive. Random Permutations. (2004) (0)
Packing Ferrers Shapes (1998) (0)
List of Frequently Used Notations (2004) (0)
First measurement of the ratio B(t -> Wb)/B(t -> Wq) and associated limit on the Cabibbo-Kobayashi-Maskawa element vertical bar V-tb vertical bar RID C-1693-2008 RID A-5169-2010 (2001) (0)
Get Them All. Algorithms and Permutations. (2004) (0)
So Hard To Avoid: Subsequence Conditions on Permutations (2006) (0)
At Least Some Order: Partial Orders and Lattices (2006) (0)
] 4 J un 2 01 9 P ATTERN AVOIDANCE IN PERMUTATIONS AND THEIR SQUARES (2019) (0)
Diffractive dijet production at root s=630 and 1800 GeV at the Fermilab tevatron RID C-1693-2008 RID A-5169-2010 RID E-4473-2011 RID C-2406-2008 (2002) (0)
Dots and Lines: The Origins of Graph Theory (2006) (0)
Review of Random graphs: (second edition) by Béla Bollobás (2009) (0)
In One Line And Close. Permutations as Linear Orders. Runs. (2004) (0)
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves (2022) (0)
In Many Circles. Permutations as Products of Cycles. (2004) (0)
2 9 Se p 20 06 On a Balanced Property of Compositions (2008) (0)
Staying Connected: Trees (2006) (0)
Elementary Problems: E3373-E3378 (1990) (0)
A sefl-dual poset on objects counted by the Catalan numbers (1998) (0)
One Step at a Time: The Method of Mathematical Induction (2006) (0)
Permutations with Exactly One Copy of a Monotone Pattern of Length k, and a Generalization (2022) (0)
Surprising symmetries in 132-avoiding permutations (2012) (0)
A new record for 1324-avoiding permutations (2014) (0)
Permutations vs. Everything Else. Algebraic Combinatorics of Permutations. (2004) (0)
Finding A Good Match: Coloring and Matching (2006) (0)
The Unitarity Triangle Analysis in the Standard Model (2008) (0)

This paper list is powered by the following services:

Other Resources About Miklós Bóna

en.wikipedia.org

What Schools Are Affiliated With Miklós Bóna?

Miklós Bóna is affiliated with the following schools:

Image Attributions

Image Source for Miklós Bóna