On pattern-avoiding permutons
From MaRDI portal
Publication:6641057
DOI10.1002/RSA.21208MaRDI QIDQ6641057
Jan Hladký, Frederik Garbe, Kristýna Pekárková, Gabor Kun
Publication date: 20 November 2024
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A measure-theoretic approach to the theory of dense hypergraphs
- Large deviations for permutations avoiding monotone patterns
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Patterns in permutations and words.
- A permutation regularity lemma
- Limits of permutation sequences
- Quasirandom permutations are characterized by 4-point densities
- A combinatorial problem in geometry.
- Combinatorics of Permutations
- Fast Property Testing and Metrics for Permutations
- The absence of a pattern and the number of occurrences of another
- Permutation Property Testing under Different Metrics with Low Query Complexity
- Cliques in dense inhomogeneous random graphs
- Hereditary properties of permutations are strongly testable
This page was built for publication: On pattern-avoiding permutons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6641057)
