Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
From MaRDI portal
(Redirected from Publication:6613409)
Collections of abstracts of lectures (00B05) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)
Recommendations
Cites work
- \(k\)-arrangements, statistics, and patterns
- A Bijection in the Theory of Derangements
- A decorated tree approach to random permutations in substitution-closed classes
- An elementary proof of Bevan's theorem on the growth of grid classes of permutations
- An example of a generalized Brownian motion
- Analytic combinatorics
- Asymptotic values for degrees associated with strips of Young diagrams
- Classical length-5 pattern-avoiding permutations
- Davenport-Schinzel theory of matrices
- Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Factoring pattern-free permutations into separable ones
- Finding small patterns in permutations in linear time
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Free Random Variables
- Generating permutations with restricted containers
- Geometric grid classes of permutations
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- Inflations of geometric grid classes of permutations
- Integral representation of certain combinatorial recurrences
- Labelled well-quasi-order for permutation classes
- Large deviations and ratio limit theorems for pattern-avoiding permutations
- Large infinite antichains of permutations
- Linear clique-width for hereditary classes of cographs
- Longest monotone subsequences and rare regions of pattern-avoiding permutations
- On pattern avoidance in matchings and involutions
- Pattern avoidance in matchings and partitions
- Permutation classes
- Permutations avoiding sets of patterns with long monotone subsequences
- Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization
- Permutations, moments, measures
- Positroids and non-crossing partitions
- Restricted permutations
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Simple permutations and algebraic generating functions
- Square permutations are typically rectangular
- Stieltjes moment sequences for pattern-avoiding permutations
- Structure of random 312-avoiding permutations
- Subclasses of the separable permutations
- Supercritical sequences, and the nonrationality of most principal permutation classes
- Sur les séries de Taylor n'ayant que des singularites algebrico- logarithmiques sur leur cercle de convergence
- The (q, t)-Gaussian process
- The Brownian limit of separable permutations
- The Factorization of Locally Finite Graphs
- The shape of random pattern-avoiding permutations
- The site-perimeter of bargraphs
- Twin-width. I: Tractable FO model checking
- Universal limits of substitution-closed permutation classes
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- Wilf-equivalence for singleton classes
- Über eine Erweiterung des Stieltjesschen Momentenproblems.
This page was built for publication: Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613409)
