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...
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Discrete Mathematics & Theoretical Computer Science
2024-04-01
|
| Serie: | Discrete Mathematics & Theoretical Computer Science |
| Soggetti: | |
| Accesso online: | http://dmtcs.episciences.org/11751/pdf |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|