scientific article; zbMATH DE number 2107707
From MaRDI portal
Publication:4821520
zbMath1052.05001MaRDI QIDQ4821520
Publication date: 13 October 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
permutationspermutation statisticspattern avoidanceprobabilistic methodsalgebraic combinatoricssorting algorithms
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items
Geometric properties of matrices induced by pattern avoidance ⋮ A combinatorial bijection on di-sk trees ⋮ Influence of certain transpositions on the cyclic structure of permutations ⋮ Special transpositions of permutation elements and properties of their composition ⋮ Bounded affine permutations. II: Avoidance of decreasing patterns ⋮ Generalized Matsumoto-Tits sections and quantum quasi-shuffle algebras ⋮ A fast algorithm for permutation pattern matching based on alternating runs ⋮ Pattern avoidance in poset permutations ⋮ Generation and enumeration of some classes of interval orders ⋮ Set partitions and integrable hierarchies ⋮ Maximum of the sum of consecutive terms in random permutations ⋮ The size of Bruhat intervals between nested involutions in \(S_{n}\) ⋮ New records in Stanley-Wilf limits ⋮ On a conjecture concerning shuffle-compatible permutation statistics ⋮ On very sparse circulant \((0,1)\) matrices ⋮ Restricted Dumont permutations, Dyck paths, and noncrossing partitions ⋮ Patterns in Shi tableaux and Dyck paths ⋮ On (shape-)Wilf-equivalence for words ⋮ Permutations and words counted by consecutive patterns ⋮ Block decomposition of permutations and Schur-positivity ⋮ Pattern avoidance in ordered set partitions and words ⋮ On the connected components of a random permutation graph with a given number of edges ⋮ Adjacent \(q\)-cycles in permutations ⋮ Catalan structures and Catalan pairs ⋮ Cyclic and lift closures for \(k \ldots 21\)-avoiding permutations ⋮ Alternating sign matrices, related (0,1)-matrices, and the Smith normal form ⋮ Revisiting pattern avoidance and quasisymmetric functions ⋮ About half permutations ⋮ Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture ⋮ Noncrossing partitions, noncrossing graphs, and \(q\)-permanental equations ⋮ Degrees of nonlinearity in forbidden 0-1 matrix problems ⋮ Product decompositions of the symmetric group induced by separable permutations ⋮ The estimation of the zeros of the Bell and \( r\)-Bell polynomials ⋮ \(q\)-analog of tableau containment ⋮ Pattern-avoiding inversion sequences and open partition diagrams ⋮ Permutations and pairs of Dyck paths ⋮ On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles ⋮ A new Euler-Mahonian constructive bijection ⋮ Symmetry and log-concavity results for statistics on Fibonacci tableaux ⋮ Catalan pairs: a relational-theoretic approach to Catalan numbers ⋮ Scale invariant operators and combinatorial expansions ⋮ Enumeration formulæ for pattern restricted Stirling permutations ⋮ Unfair permutations ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ The simple harmonic urn ⋮ A kind of Eulerian numbers connected to Whitney numbers of Dowling lattices ⋮ Highly symmetric generalized circulant permutation matrices ⋮ On symmetric polynomials with only real zeros and nonnegative \(\gamma\)-vectors ⋮ Derivative polynomials and enumeration of permutations by number of interior and left peaks ⋮ A characterization of the single-crossing domain ⋮ Finitely labeled generating trees and restricted permutations ⋮ Semiclassical limit for almost fermionic anyons ⋮ Preimages under the Queuesort algorithm ⋮ Restricted stacks as functions ⋮ Some limit theorems with respect to constrained permutations and partitions ⋮ Pattern avoidance and quasisymmetric functions ⋮ Large deviations for permutations avoiding monotone patterns ⋮ Staircase patterns in words: subsequences, subwords, and separation number ⋮ The orthomorphism graph \(\mathcal{L}_3(q)\) ⋮ Eulerian numbers associated with arithmetical progressions ⋮ Combinatorial interpretation of general Eulerian numbers ⋮ The \(r\)-derangement numbers ⋮ Double Catalan monoids ⋮ On random stable partitions ⋮ On a refinement of Wilf-equivalence for permutations ⋮ Generating restricted classes of involutions, Bell and Stirling permutations ⋮ Finding common structured patterns in linear graphs ⋮ The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns ⋮ Permutation groups arising from pattern involvement ⋮ Permutation matrices, their discrete derivatives and extremal properties ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ On the frequencies of patterns of rises and falls ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions ⋮ An asymptotic distribution theory for Eulerian recurrences with applications ⋮ Bijective proofs of shuffle compatibility results ⋮ Cycles in the graph of overlapping permutations avoiding barred patterns ⋮ On the enumeration of certain weighted graphs ⋮ Wave linked partitions and 312-avoiding permutations with primacy being 1 ⋮ Where the monotone pattern (mostly) rules ⋮ Lower bounds for superpatterns and universal sequences ⋮ Stack sorting with increasing and decreasing stacks ⋮ Finding and counting permutations via CSPs ⋮ A variant of the tandem duplication-random loss model of genome rearrangement ⋮ Patterns in random permutations avoiding some sets of multiple patterns ⋮ On random trees obtained from permutation graphs ⋮ The \(r\)-alternating permutations ⋮ Permutation reconstruction from a few large patterns ⋮ Permutation matrices related to Sudoku ⋮ Refined Wilf-equivalences by Comtet statistics ⋮ On the surface area of the \((n,k)\)-star graph ⋮ Cyclic pattern containment and avoidance ⋮ A multiset version of determinants and the coin arrangements lemma ⋮ The maximal-inversion statistic and pattern-avoiding permutations ⋮ An involution on increasing trees ⋮ A combinatorial approach to derangement matrix of type \(B\) ⋮ Fast distance multiplication of unit-Monge matrices ⋮ Probabilistic compositional models: solution of an equivalence problem ⋮ Bounds on superpatterns containing all layered permutations ⋮ The \(r\)-central factorial numbers with even indices ⋮ Permutation graphs and the weak Bruhat order ⋮ COUNTING PERMUTATIONS BY NUMBERS OF EXCEDANCES, FIXED POINTS AND CYCLES ⋮ The estimation of the zeros of some counting polynomials ⋮ Extensions of the linear bound in the Füredi-Hajnal conjecture ⋮ Word-Representable Graphs: a Survey ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ Unnamed Item ⋮ The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three ⋮ Permutations avoiding the complement of a regular permutation group ⋮ Unnamed Item ⋮ Permutations avoiding a pattern of length three under Mallows distributions ⋮ An analogue of Mahonian numbers and log-concavity ⋮ Young tableaux with periodic walls: counting with the density method ⋮ Dynamical aspects of \(\sigma\)-machines ⋮ Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations ⋮ Maxima and visibility in involutions ⋮ Multipermutations and Stirling multipermutations ⋮ Permutation (Matrices) and Beyond ⋮ Some identities involving \(q\)-Stirling numbers of the second kind in type B ⋮ Further refinements of Wilf-equivalence for patterns of length 4 ⋮ Patterns in Random Permutations Avoiding the Pattern 132 ⋮ Permutation classes and polyomino classes with excluded submatrices ⋮ How often are two permutations comparable? ⋮ Algebraic Bethe ansatz approach to the asymptotic behavior of correlation functions ⋮ Longest alternating subsequences of \(k\)-ary words ⋮ Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations ⋮ Bounded affine permutations I. Pattern avoidance and enumeration ⋮ Enumeration of Dumont permutations avoiding certain four-letter patterns ⋮ Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations ⋮ Counting permutations by their alternating runs ⋮ Reconstructing compositions ⋮ Unnamed Item ⋮ A geometric form for the extended patience sorting algorithm ⋮ Packing densities of more 2-block patterns ⋮ Poly-Bernoulli Numbers and Eulerian Numbers ⋮ Rationality of the Möbius function of a composition poset ⋮ The Möbius function of a composition poset ⋮ A note on permutation regularity ⋮ Some identities involving second kind Stirling numbers of types \(B\) and \(D\) ⋮ Some identities involving second kind Stirling numbers of types \(B\) and \(D\) ⋮ Buses, Bullies, and Bijections ⋮ Generalisations of the Euler adic ⋮ The Infinite limit of random permutations avoiding patterns of length three ⋮ CONTENT AND SINGLETONS BRING UNIQUE IDENTIFICATION MINORS ⋮ Ascending runs in permutations and valued Dyck paths ⋮ Structure of random 312-avoiding permutations ⋮ On the Brownian separable permuton ⋮ Unnamed Item
