196 results on '"Miklós Bóna"'
Search Results
2. The absence of a pattern and the occurrences of another
3. Permutations avoiding sets of patterns with long monotone subsequences.
4. Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves.
5. Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121).
6. Long increasing subsequences and non-algebraicity.
7. A Method to Prove the Nonrationality of Some Combinatorial Generating Functions.
8. Stack words and a bound for 3-stack sortable permutations.
9. Pattern avoidance in permutations and their squares.
10. On the cycle structure of the product of random maximal cycles.
11. Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451).
12. Supercritical sequences, and the nonrationality of most principal permutation classes.
13. Cyclic permutations avoiding pairs of patterns of length three.
14. Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121)
15. Permutations with Exactly One Copy of a Monotone Pattern of Length k, and a Generalization
16. A Walk Through Combinatorics
17. Pattern-avoiding involutions: exact and asymptotic enumeration.
18. Pattern Avoidance and Genome Sorting (Dagstuhl Seminar 16071).
19. Real zeros and partitions without singleton blocks.
20. The number of ways to assemble a graph.
21. Pattern Avoiding Permutations with a Unique Longest Increasing Subsequence.
22. On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM
23. A New Upper Bound for 1324-Avoiding Permutations.
24. k-Protected vertices in binary search trees.
25. On a Family of Conjectures of Joel Lewis on Alternating Permutations.
26. Review of extremal combinatorics with applications to computer science (2nd edition) by Stasys Jukna.
27. Limiting Probabilities for Vertices of a Given Rank in 1-2 Trees.
28. Review of probability: theory and examples, 4th edition by Rick Durrett.
29. Review of proofs from THE BOOK (4th edition) by Martin Aigner and Günter M. Ziegler.
30. Analytic combinatorics by Philippe Flajolet and Robert Sedgewick, published by Cambridge Press, 2009 824 pages, hardcover.
31. A combinatorial approach to matrix theory and Its applications by Richard Brualdi and Dragos Cvetkovic, Published by Cambridge Press, 2009 824 pages, hardcover.
32. The average number of block interchanges needed to sort a permutation and a recent result of Stanley.
33. On two related questions of Wilf concerning Standard Young Tableaux.
34. Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley.
35. Get Them All. Algorithms and Permutations
36. Combinatorics of Permutations
37. How Did We Get Here? Permutations as Genome Rearrangements
38. In This Way, but Nicely. Pattern Avoidance. Follow-Up
39. Permutations and the Rest. Algebraic Combinatorics of Permutations
40. In One Line and Close. Permutations as Linear Orders
41. In Any Way but This. Pattern Avoidance. The Basics
42. In Many Circles. Permutations as Products of Cycles
43. Do Not Look Just Yet. Solutions to Odd-Numbered Exercises
44. Where the monotone pattern (mostly) rules.
45. Combinatorics of permutations.
46. On the enumeration of certain weighted graphs.
47. New records in Stanley-Wilf limits.
48. The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns.
49. A simple proof for the exponential upper bound for some tenacious patterns.
50. Review of Bijective Combinatorics by Nicholas Loehr.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.