A logical limit law for 231-avoiding permutations
From MaRDI portal
Publication:6606908
Recommendations
- Structure of random \(312\)-avoiding permutations
- Patterns in random permutations avoiding the pattern 321
- The infinite limit of random permutations avoiding patterns of length three
- The shape of random pattern-avoiding permutations
- On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
Cites work
- scientific article; zbMATH DE number 176205 (Why is no real title available?)
- scientific article; zbMATH DE number 3333280 (Why is no real title available?)
- Analytic combinatorics
- Coloring rules for finite trees, and probabilities of monadic second order sentences
- Combinatorics of permutations
- Finite model theory and its applications.
- Fixed points of 321-avoiding permutations
- Limiting probabilities of first order properties of random sparse graphs and hypergraphs
- Logical limit laws for layered permutations and related structures
- Logical limit laws for minor-closed classes of graphs
- On a paper of Guthrie and Nymann on subsums of infinite series
- On the partial sums of an infinite series.
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Permutation classes
- Probabilities on finite models
- Random Trees
- Scaling limits of permutation classes with a finite specification: a dichotomy
- The first order convergence law fails for random perfect graphs
- Two first-order logics of permutations
- Zero-One Laws for Sparse Random Graphs
This page was built for publication: A logical limit law for \(231\)-avoiding permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606908)
