{"id":22,"date":"2012-09-05T11:22:33","date_gmt":"2012-09-05T15:22:33","guid":{"rendered":"https:\/\/people.clas.ufl.edu\/template\/?page_id=22"},"modified":"2026-03-19T08:16:14","modified_gmt":"2026-03-19T12:16:14","slug":"research","status":"publish","type":"page","link":"https:\/\/people.clas.ufl.edu\/bona\/research\/","title":{"rendered":"Research with papers to download"},"content":{"rendered":"\r\n<section class=\"fullwidth-text-block\">\r\n\t<div class=\"container px-0 pt-5\">\r\n\t\t<div class=\"row align-items-start\">\r\n\t\t\t<div class=\"col-12\">\r\n\t\t\t\t\n<h1 class=\"wp-block-heading\">Research with papers to download<\/h1>\n\n\n\n<p>I do a lot of it, especially on all sorts of enumeration problems, and<br>\nthings related to permutations. <\/p>\n\n\n\n\n\n<p>Ok, so after a lot of procrastinating, it is time to upload all my papers here. This will take a while.<br>\nI had them all on my old website, but of course, the university changed the system on us. I still have to put most of my oldest papers here.<\/p>\n\n\n\n<ul class=\"wp-block-list\"><li>2023\n<ul>\n<li> <a href=\"https:\/\/arxiv.org\/abs\/2103.06918\"> (with Jay Pantone) Permutations avoiding sets of patterns with long monotone subsequences. <\/a> J. Symbolic Comput. 116 (2023), 130\u2013138.\n<\/li><li> <a href=\"https:\/\/arxiv.org\/abs\/2108.04989\"> (with Boris Pittel) Random plane increasing trees: asymptotic enumeration of vertices by distance from leaves. <\/a><br>\nRandom Structures Algorithms 63 (2023), no. 1, 102\u2013129.\n<\/li><\/ul>\n<\/li><li>2022\n<ul>\n<li> <a href=\"https:\/\/arxiv.org\/abs\/2101.00332\"> (with Alexander Burstein) Permutations with exactly one copy of a decreasing pattern of length k. <\/a> Ann. Comb. 26 (2022), no. 2, 393\u2013404.\n<\/li><\/ul>\n<\/li><li>2021\n<ul>\n<li> <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Generating Functions of Permutations with Respect to Their Alternating Runs  <\/a><br>\nS\u00e9minaire Lotharingien de Combinatoire, B85b (2021), 5 pp.\n<\/li><\/ul>\n<\/li><li>2020\n<ul>\n<li>  <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Supercritical sequences, and the nonrationality of most principal permutation classes. <\/a>  European J. Combin. 83 (2020), 103020, 8 pp.\n<\/li><li> <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Stack words and a bound for 3-stack sortable permutations. <\/a> Discrete Appl. Math. 284 (2020), 602\u2013605.\n<\/li><li> (with Elijah DeJonge) <a href=\"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i4p44\"><br>\nPattern Avoiding Permutations with a Unique Longest Increasing Subsequence <\/a>\n<\/li><\/ul>\n<\/li><li>2019\n<ul>\n<li> (with Boris Pittel) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> On the cycle structure of the product of random maximal cycles. <\/a> S\u00e9m. Lothar. Combin. 80 (2019), 1\u201337.\n<\/li><li> (with Michael Cory) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Cyclic permutations avoiding pairs of patterns of length three. <\/a>  Discrete Math. Theor. Comput. Sci. 21 (2019), no. 2, Paper No. 8, 15 pp.\n<\/li><li> (with Istvan Mezo) <a href=\"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i3p41\"> Limiting probabilities for vertices of a given rank in 1-2 trees. <\/a> Electron. J. Combin. 26 (2019), no. 3, Paper No. 3.41, 19 pp.\n<\/li><li>  <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\">   Most principal permutation classes, and t-stack sortable permutations, have nonrational generating functions. <\/a>  Acta Math. Univ. Comenian. (N.S.) 88 (2019), no. 3, 481\u2013487.\n<\/li><li> (with Rebecca Smith) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\">  Pattern avoidance in permutations and their squares. <\/a>  Discrete Math. 342 (2019), no. 11, 3194\u20133200.\n<\/li><\/ul>\n<\/li><li>2017\n<ul>\n<li> (with Bruce Sagan and Marie-Louise Lackner) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Longest increasing subsequences and log concavity.  <\/a>  Ann. Comb. 21 (2017), no. 4, 535\u2013549.\n<\/li><li>(with Boris Pittel) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> On a random search tree: Asymptotic Enumeration of Vertices by distance from leaves. <\/a>  Adv. in Appl. Probab. 49 (2017), no. 3, 850\u2013876. <\/li>\n<\/ul>\n<\/li><li>2016\n<ul>\n<a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> On the number of vertices of each rank in phylogenetic trees and their generalizations. <\/a>  Discrete Math. Theor. Comput. Sci. 18 (2016), no. 3, Paper No. 7, 7 pp. <\/ul><\/li>\n<li> (with Meera Sitharam, Andrew Vince and Meghan Wang) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\">  Symmetry in sphere-based assembly configuration spaces.<\/a> Symmetry 8 (2016), no. 1, Art. 5, 26 pp. <\/li>\n<li>  (with Istvan Mezo) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\">  Real zeros and partitions without singleton blocks. <\/a> European J. Combin. 51 (2016), 500\u2013510. <\/li>\n<li>(with Cheyne Homberger, Jay Pantone and Vincent Vatter) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Pattern avoiding involutions, exact and asymptotic enumeration. <\/a>  Australas. J. Combin. 64 (2016), 88\u2013119. <\/li><\/ul>\n\n\n\n<li>2015\n<ul>\n<li> <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> A new record for 1324-avoiding permutations. <\/a> European J. Math, 1 (2015), 1&#8211;9.<\/li>\n<\/ul><\/li>\n\n\n\n<li>2014\n<ul>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> A new upper bound for 1324-avoiding permutations. <\/a> Combin. Probab. Comput. 23 (2014), no. 5, 717\u2013724.<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> On a family of conjectures of Joel Lewis on alternating permutations. <\/a> Graphs Combin. 30 (2014), no. 3, 521\u2013526.<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> k-protected vertices in binary search trees <\/a> Advances in Applied Math, 53 (2014), 1&#8211;11.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>2013\n<ul>\n<\/ul>\n<\/li>\n\n\n\n<li>2012\n<ul>\n<li>(with Andrew Vince) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> The number of ways to assemble a graph <\/a> Electronic Journal of Combinatorics, 19 (2012), no. 4, Paper 54, 18 pp.<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Surprising symmetries in objects counted by Catalan numbers. <\/a> Electron. J. Combin. 19 (2012), no. 1, Paper 62, 11 pp.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>2011\n<ul>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Non-overlapping permutation patterns. <\/a> Pure Math. Appl. (PU.M.A.) 22 (2011), no. 2, 99\u2013105.<\/li>\n<li>(with Meera Sitharam and Andrew Vince) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Enumeration of viral capsid assembly pathways: three orbits under permutation group action. <\/a> Bull. Math. Biol. 73 (2011), no. 4, 726\u2013753.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>2010\n<ul>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> On three different notions of monotone subsequences. <\/a> Permutation patterns, 89\u2013114, London Math. Soc. Lecture Note Ser., 376, Cambridge Univ. Press, Cambridge, 2010.<\/li>\n<li>(with Arnold Knopfmacher) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> On the probability that certain compositions have the same number of parts. <\/a> Ann. Comb. 14 (2010), no. 3, 291\u2013306.<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> The absence of a pattern and the occurrences of another. <\/a> Discrete Math. Theor. Comput. Sci. 12 (2010), no. 2, 89\u2013102.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>2009\n<ul>\n<li>(with Philippe Flajolet) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Isomorphism and symmetries in random phylogenetic trees. <\/a> J. Appl. Probab. 46 (2009), no. 4, 1005\u20131019.<\/li>\n<li>(with Ryan Flynn) <a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> The average number of block interchanges needed to sort a permutation and a recent result of Stanley. <\/a> Inform. Process. Lett. 109 (2009), no. 16, 927\u2013931.<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> On two related questions of Wilf concerning standard Young tableaux. <\/a> European J. Combin. 30 (2009), no. 5, 1318\u20131322.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>2008\n<ul>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Real zeros and normal distribution for statistics on Stirling permutations defined by Gessel and Stanley. <\/a> SIAM J. Discrete Math. 23 (2008\/09), no. 1, 401\u2013406.<\/li>\n<li>Discrete Math. 308 (2008), no. 23, 5782\u20135788.<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> The influence of symmetry on the probability of assembly pathways for icosahedral viral shells. <\/a> Comput. Math. Methods Med. 9 (2008), no. 3-4, 295\u2013302.<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/bona\/content-removed\/\"> Generalized descents and normality. <\/a> Electron. J. Combin. 15 (2008), no. 1, Note 21, 8 pp.  <\/li>\n<\/ul>\n\n<p>Sponsors of my research include the <a title=\"SF\" href=\"http:\/\/www.simonsfoundation.org\"> Simons Foundation,<\/a>  <a title=\"NSF\" href=\"http:\/\/www.nsf.gov\"> National Science Foundation <\/a> , the <a title=\"NSA\" href=\"http:\/\/www.nsa.gov\"> National Security Agency <\/a>,<br>\nand the <a title=\"HHMI\" href=\"http:\/\/www.hhmi.org\"> Howard Hughes Medical Institute.<\/a><\/p>\n<\/li>\n\n\n\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t<\/div>\r\n<\/section>\r\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":307,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"featured_post":"","footnotes":"","_links_to":"","_links_to_target":""},"class_list":["post-22","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/people.clas.ufl.edu\/bona\/wp-json\/wp\/v2\/pages\/22","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/people.clas.ufl.edu\/bona\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/people.clas.ufl.edu\/bona\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/people.clas.ufl.edu\/bona\/wp-json\/wp\/v2\/users\/307"}],"replies":[{"embeddable":true,"href":"https:\/\/people.clas.ufl.edu\/bona\/wp-json\/wp\/v2\/comments?post=22"}],"version-history":[{"count":10,"href":"https:\/\/people.clas.ufl.edu\/bona\/wp-json\/wp\/v2\/pages\/22\/revisions"}],"predecessor-version":[{"id":730,"href":"https:\/\/people.clas.ufl.edu\/bona\/wp-json\/wp\/v2\/pages\/22\/revisions\/730"}],"wp:attachment":[{"href":"https:\/\/people.clas.ufl.edu\/bona\/wp-json\/wp\/v2\/media?parent=22"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}