A logical limit law for \(231\)-avoiding permutations
From MaRDI portal
Publication:6606908
DOI10.46298/DMTCS.11751zbMATH Open1547.05004MaRDI QIDQ6606908
Michael Albert, Marc Noy, Valentin Féray, Mathilde Bouvel
Publication date: 17 September 2024
Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Finite model theory and its applications.
- On the partial sums of an infinite series.
- Logical limit laws for minor-closed classes of graphs
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Two first-order logics of permutations
- Combinatorics of Permutations
- Permutation classes
- Random Trees
- Zero-One Laws for Sparse Random Graphs
- Probabilities on finite models
- Coloring rules for finite trees, and probabilities of monadic second order sentences
- On a paper of Guthrie and Nymann on subsums of infinite series
- The first order convergence law fails for random perfect graphs
- 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
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)
