Two first-order logics of permutations

DOI10.1016/j.jcta.2019.105158zbMath1433.05004arXiv1808.05459OpenAlexW2979904875WikidataQ127150601 ScholiaQ127150601MaRDI QIDQ2299614

Mathilde Bouvel, Valentin Féray, Michael Henry Albert

Publication date: 21 February 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.05459

zbMATH Keywords

permutationsfirst-order logicpatternsEhrenfeucht-Fraïssé gamessorting operators

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Classical first-order logic (03B10)

Related Items (10)

Pop-stack-sorting for Coxeter groups ⋮ Pattern Hopf algebras ⋮ Lattice paths and \((n - 2)\)-stack sortable permutations ⋮ Logical limit laws for layered permutations and related structures ⋮ Preface to the special issue of Permutation Patterns 2021 (PP2021) ⋮ Pattern-avoiding permutation powers ⋮ Counting 3-stack-sortable permutations ⋮ Meeting covered elements in \(\nu\)-Tamari lattices ⋮ Stack words and a bound for 3-stack sortable permutations ⋮ On a conjecture about strong pattern avoidance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the inverse image of pattern classes under bubble sort
• Sorting twice through a stack
• Finite model theory and its applications.
• Descent polynomials for permutations with bounded drop size
• Describing West-3-stack-sortable permutations with permutation patterns
• A logical approach to asymptotic combinatorics I. First order properties
• Composability of permutation classes
• Homogeneous permutations
• Permutation groups arising from pattern involvement
• Permutation classes
• Permutation Involvement and Groups
• Permutation groups, pattern involvement, and Galois connections
• Sorting Using Networks of Queues and Stacks

This page was built for publication: Two first-order logics of permutations