A logical limit law for $231$-avoiding permutations
We prove that the class of 231-avoiding permutations satisfies a logical limit law, i.e. that for any first-order sentence $\Psi$, in the language of two total orders, the probability $p_{n,\Psi}$ that a uniform random 231-avoiding permutation of size $n$ satisfies $\Psi$ admits a limit as $n$ is la...
Uloženo v:
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Discrete Mathematics & Theoretical Computer Science
2024-04-01
|
| Edice: | Discrete Mathematics & Theoretical Computer Science |
| Témata: | |
| On-line přístup: | http://dmtcs.episciences.org/11751/pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|