First-order convergence for 321-avoiding permutations
From MaRDI portal
Cites work
- 0-1 laws and decision problems for fragments of second-order logic
- A generalization of Catalan numbers
- A logical limit law for \(231\)-avoiding permutations
- Advanced Lectures on Machine Learning
- Analytic combinatorics
- Catalan Numbers
- Catalan numbers, their generalization, and their uses
- Ergodic properties of nonnegative matrices. I
- Generating and enumerating 321-avoiding and skew-merged simple permutations
- Generating trees and the Catalan and Schröder numbers
- Growth rates for subclasses of Av(321)
- scientific article; zbMATH DE number 1577990 (Why is no real title available?)
- scientific article; zbMATH DE number 4008383 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 176205 (Why is no real title available?)
- scientific article; zbMATH DE number 887782 (Why is no real title available?)
- scientific article; zbMATH DE number 6157246 (Why is no real title available?)
- scientific article; zbMATH DE number 238432 (Why is no real title available?)
- scientific article; zbMATH DE number 3272562 (Why is no real title available?)
- Linear operators and their spectra
- Logical limit laws for layered permutations and related structures
- Model theory.
- On random models of finite power and monadic logic
- Pattern-avoiding involutions: exact and asymptotic enumeration
- Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Patterns in permutations and words.
- Permutation classes
- Probabilities on finite models
- Second-Order Logic and Foundations of Mathematics
- The insertion encoding of permutations
- The shape of random pattern-avoiding permutations
- The strange logic of random graphs
- Thermodynamic formalism for countable symbolic Markov chains
- Topics in the Constructive Theory of Countable Markov Chains
- Topological entropy and recurrence of countable chains
- Transfer operators, endomorphisms, and measurable partitions
- Two first-order logics of permutations
This page was built for publication: First-order convergence for 321-avoiding permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231857)