Combinatorics of permutations
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The number of orthogonal permutations
- The genesis of involutions (polarizations and lattice paths)
- The minimum Manhattan distance and minimum jump of permutations
- Patterns in colored circular permutations
- The Brownian limit of separable permutations
- \(q\)-log-convexity from linear transformations and polynomials with only real zeros
- Coding for locality in reconstructing permutations
- Context-free grammars for several polynomials associated with Eulerian polynomials
- Thermal state with quadratic interaction
- 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
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3
- 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
- Pattern occurrences in \(k\)-ary words revisited: a few new and old observations
- Almost square permutations are typically square
- 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
- 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
- Statistics of partial permutations via Catalan matrices
- Troupes, cumulants, and stack-sorting
- Some multivariate master polynomials for permutations, set partitions, and perfect matchings, and their continued fractions
- Pattern avoidance of \([4,k]\)-pairs in circular permutations
- Generating functions of permutations with respect to their alternating runs
- 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
- Catalan intervals and uniquely sorted permutations
- Supertrees
- Floodings of metric graphs
- Mallows permutations and finite dependence
- Polyurethane toggles
- A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate
- Stirling pairs of permutations
- On the Borel submonoid of a symplectic monoid
- Pattern-avoiding permutation powers
- Stack-sorting preimages of permutation classes
- Quantifying noninvertibility in discrete dynamical systems
- Stieltjes moment sequences for pattern-avoiding permutations
- Pattern avoiding permutations with a unique longest increasing subsequence
- When a dollar makes a BWT
- The component counts of random injections
- Fertility monotonicity and average complexity of the stack-sorting map
- Descents on quasi-Stirling permutations
- Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices
- Strategy-indifferent games of best choice
- 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 avoidance in permutations and their squares
- A new record for \(1324\)-avoiding permutations
- \((a, b)\)-rectangle patterns in permutations and words
- Lexicographic shellability of the Bruhat-Chevalley order on fixed-point-free involutions
- Preimages under the stack-sorting algorithm
- Prolific permutations and permuted packings: downsets containing many large patterns
- Extremal functions of forbidden multidimensional matrices
- Longest monotone subsequences and rare regions of pattern-avoiding permutations
- Eulerian polynomials, Stirling permutations of the second kind and perfect matchings
- Context-free grammars, generating functions and combinatorial arrays
- Positional strategies in games of best choice
- A refinement of Wilf-equivalence for patterns of length 4
- Bivariate generating functions for a class of linear recurrences: general structure
- Square permutations are typically rectangular
- Wilf equivalences between vincular patterns in inversion sequences
- Patterns in random permutations
- Block-cyclic structuring of the basis of Fourier transforms based on cyclic substitution
- Compositions and parities of complete mappings and of orthomorphisms
- Nonnegative square roots of matrices
- Positivity of permutation pattern character polynomials
- Counting ordered graphs that avoid certain subgraphs
- Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution
- Gröbner methods for representations of combinatorial categories
- Some identities of the r-Whitney numbers
- Counting permutations by runs
- scientific article; zbMATH DE number 4189999 (Why is no real title available?)
- Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps
- Stack-sorting for words
- Pairings and Signed Permutations
- Enumeration of permutations by number of alternating runs
- Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
- The shape of random pattern-avoiding permutations
- Ascent-descent Young diagrams and pattern avoidance in alternating permutations
- Characteristic Numbers of Permutations
- scientific article; zbMATH DE number 3007421 (Why is no real title available?)
This page was built for publication: Combinatorics of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892712)
