Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
DOI10.4171/OWR/2024/6zbMATH Open1546.00051MaRDI QIDQ6613409
Author name not available (Why is that?)
Publication date: 2 October 2024
Published in: Oberwolfach Reports (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of abstracts of lectures (00B05) Asymptotic enumeration (05A16)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The shape of random pattern-avoiding permutations
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- Integral representation of certain combinatorial recurrences
- Excluded permutation matrices and the Stanley-Wilf conjecture
- An example of a generalized Brownian motion
- A decorated tree approach to random permutations in substitution-closed classes
- Davenport-Schinzel theory of matrices
- Finite transition matrices for permutations avoiding pairs of length four patterns
- The site-perimeter of bargraphs
- Sur les séries de Taylor n'ayant que des singularites algebrico- logarithmiques sur leur cercle de convergence
- The Brownian limit of separable permutations
- Generating permutations with restricted containers
- The \((q, t)\)-Gaussian process
- Asymptotic values for degrees associated with strips of Young diagrams
- Pattern avoidance in matchings and partitions
- Supercritical sequences, and the nonrationality of most principal permutation classes
- Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
- Permutations avoiding sets of patterns with long monotone subsequences
- On pattern avoidance in matchings and involutions
- 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
- Classical length-5 pattern-avoiding permutations
- Stieltjes moment sequences for pattern-avoiding permutations
- Universal limits of substitution-closed permutation classes
- Inflations of geometric grid classes of permutations
- Longest monotone subsequences and rare regions of pattern-avoiding permutations
- Simple permutations and algebraic generating functions
- Wilf-equivalence for singleton classes
- Square permutations are typically rectangular
- Structure of random \(312\)-avoiding permutations
- Geometric grid classes of permutations
- Large infinite antichains of permutations
- Permutation classes
- Linear Clique‐Width for Hereditary Classes of Cographs
- Subclasses of the separable permutations
- Free Random Variables
- A Bijection in the Theory of Derangements
- Positroids and non-crossing partitions
- Permutations, Moments, Measures
- Labelled well-quasi-order for permutation classes
- Twin-width I: Tractable FO Model Checking
- $k$-Arrangements, Statistics, and Patterns
- An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations
- Finding small patterns in permutations in linear time
- Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations
- The Factorization of Locally Finite Graphs
- Über eine Erweiterung des Stieltjesschen Momentenproblems.
- Restricted permutations
- Factoring pattern-free permutations into separable ones
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)
