Combinatorics of Permutations

DOI10.1201/b12210zbMath1255.05001OpenAlexW2477858045MaRDI QIDQ2892712

Publication date: 22 June 2012

Full work available at URL: https://doi.org/10.1201/b12210

permutations permutation statistics pattern avoidance probabilistic methods algebraic combinatorics sorting algorithms

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Related Items

Nonnegative square roots of matrices, Preimages under the stack-sorting algorithm, The genesis of involutions (polarizations and lattice paths), Counting ordered graphs that avoid certain subgraphs, The minimum Manhattan distance and minimum jump of permutations, Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution, Some identities of the \(r\)-Whitney numbers, Counting permutations by runs, Some multivariate master polynomials for permutations, set partitions, and perfect matchings, and their continued fractions, Pattern avoidance of \([4,k\)-pairs in circular permutations], Patterns in colored circular permutations, Generating functions of permutations with respect to their alternating runs, Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps, Scaling limits of permutation classes with a finite specification: a dichotomy, Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization, Sorting by shuffling methods and a queue, The Brownian limit of separable permutations, \(q\)-log-convexity from linear transformations and polynomials with only real zeros, Square permutations are typically rectangular, Prolific permutations and permuted packings: downsets containing many large patterns, Wilf equivalences between vincular patterns in inversion sequences, Extremal functions of forbidden multidimensional matrices, Catalan intervals and uniquely sorted permutations, Patterns in random permutations, Longest monotone subsequences and rare regions of pattern-avoiding permutations, Block-cyclic structuring of the basis of Fourier transforms based on cyclic substitution, Eulerian polynomials, Stirling permutations of the second kind and perfect matchings, Enumeration of permutations by number of alternating runs, Supertrees, Floodings of metric graphs, Mallows permutations and finite dependence, Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers, Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux, The shape of random pattern-avoiding permutations, Polyurethane toggles, A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate, Ascent-descent Young diagrams and pattern avoidance in alternating permutations, Stirling pairs of permutations, Context-free grammars, generating functions and combinatorial arrays, Positional strategies in games of best choice, Coding for locality in reconstructing permutations, On the Borel submonoid of a symplectic monoid, Pattern-avoiding permutation powers, Compositions and parities of complete mappings and of orthomorphisms, Stack-sorting preimages of permutation classes, Quantifying noninvertibility in discrete dynamical systems, Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3, Context-free grammars for several polynomials associated with Eulerian polynomials, Enumeration of permutations by number of alternating descents, Stieltjes moment sequences for pattern-avoiding permutations, A refinement of Wilf-equivalence for patterns of length 4, Pattern avoiding permutations with a unique longest increasing subsequence, Permutations sortable by two stacks in parallel and quarter plane walks, Enumerating permutations by their run structure, When a dollar makes a BWT, Counting permutations by alternating descents, The component counts of random injections, Bivariate generating functions for a class of linear recurrences: general structure, Fertility monotonicity and average complexity of the stack-sorting map, Thermal state with quadratic interaction, Descents on quasi-Stirling permutations, Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices, Hamiltonian cycles in unitary prefix transposition rearrangement graphs, Strategy-indifferent games of best choice, Properties of combinatorial optimization problems over polyhedral-spherical sets, Largest minimal inversion-complete and pair-complete sets of permutations, Rook and Wilf equivalence of integer partitions, Avoiding patterns and making the best choice, An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations, Parabolically induced functions and equidistributed pairs, Supercritical sequences, and the nonrationality of most principal permutation classes, The pure descent statistic on permutations, On a family of conjectures of Joel Lewis on alternating permutations, Further bijections to pattern-avoiding valid hook configurations, Asymptotics of 3-stack-sortable permutations, Stack-sorting with consecutive-pattern-avoiding stacks, Stable characters from permutation patterns, A generalized Eulerian triangle from staircase tableaux and tree-like tableaux, Counting 3-stack-sortable permutations, David-Barton type identities and alternating run polynomials, Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences, Alternating sign matrices: extensions, König-properties, and primary sum-sequences, A five-element transformation monoid on labelled trees, The operators \(F_i\) on permutations, 132-avoiding permutations and inversions, Pattern occurrences in \(k\)-ary words revisited: a few new and old observations, Almost square permutations are typically square, Pattern avoidance in permutations and their squares, Stack words and a bound for 3-stack sortable permutations, Stack-sorting, set partitions, and Lassalle's sequence, The role of colour flows in matrix element computations and Monte Carlo simulations, Counting embeddings of rooted trees into families of rooted trees, Strings from linear recurrences and permutations: a gray code, A new record for \(1324\)-avoiding permutations, The feasible regions for consecutive patterns of pattern-avoiding permutations, Permutations avoiding sets of patterns with long monotone subsequences, On a conjecture about strong pattern avoidance, \((a, b)\)-rectangle patterns in permutations and words, Statistics of partial permutations via Catalan matrices, Lexicographic shellability of the Bruhat-Chevalley order on fixed-point-free involutions, Troupes, cumulants, and stack-sorting, Variations of central limit theorems and Stirling numbers of the first kind, Stack-sorting for Coxeter groups, A view from the bridge spanning combinatorics and probability, Parity alternating permutations starting with an odd integer, Unnamed Item, Generation of the symmetric group Sn2, Unnamed Item, Schröder partitions, Schröder tableaux and weak poset patterns, Counting regions of the boxed threshold arrangement, Highly sorted permutations and Bell numbers, Fertilitopes, Cumulants, spreadability and the Campbell-Baker-Hausdorff series, Insdel codes from subspace and rank-metric codes, Some results related to Hurwitz stability of combinatorial polynomials, REMARKABLE RELATIONS BETWEEN THE CENTRAL BINOMIAL SERIES, EULERIAN POLYNOMIALS, AND POLY-BERNOULLI NUMBERS, LEADING TO STEPHAN'S OBSERVATION, A grammatical calculus for peaks and runs of permutations, Matching points in compositions and words, Moments of permutation statistics and central limit theorems, The deranged Bell numbers, Special values of spectral zeta functions of graphs and Dirichlet \(L\)-functions, A natural idempotent in the descent algebra of a finite Coxeter group, Positivity of permutation pattern character polynomials, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Containing All Permutations, Compressed Sensing with Nonlinear Fourier Atoms, Enumeration of Stack-Sorting Preimages via a Decomposition Lemma, Fixed points of 321-avoiding permutations, Enumerating threshold graphs and some related graph classes, Zeros of the dilogarithm, Fertility, Strong Fertility, and Postorder Wilf Equivalence, Unnamed Item, Interlocked Permutations, A Multiset Version of Even-Odd Permutations Identity, Colored Multipermutations and a Combinatorial Generalization of Worpitzky's Identity, Unnamed Item, Unnamed Item, On square roots of isometries, Gröbner methods for representations of combinatorial categories, Sums of r-Lah numbers and r-Lah polynomials, Combinatorial generation via permutation languages. I. Fundamentals, Stack-sorting for Words