On separable permutations and three other pairs in the Schröder class

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Gil, Juan B., Lopez, Oscar A., Weiner, Michael D.
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910075830927360
author Gil, Juan B.
Lopez, Oscar A.
Weiner, Michael D.
author_facet Gil, Juan B.
Lopez, Oscar A.
Weiner, Michael D.
contents We study positional statistics for four families of pattern-avoiding permutations counted by the large Schröder numbers. Specifically, we focus on the pairs of patterns {2413,3142} (separable permutations), {1324,1423}, {1423,2413}, and {1324,2134}. For each class, we derive multivariate generating functions that track the relative positions of specific entries. Our approach combines structural decompositions with the kernel method to obtain explicit formulas involving the generating function for the Schröder numbers. As a byproduct, we obtain alternative proofs that each of these classes is enumerated by the Schröder numbers. We also identify several known triangular arrays arising from our positional refinements, including connections to the central binomial coefficients and sequences appearing in the work of Kreweras on covering hierarchies.
format Preprint
id arxiv_https___arxiv_org_abs_2603_25528
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On separable permutations and three other pairs in the Schröder class
Gil, Juan B.
Lopez, Oscar A.
Weiner, Michael D.
Combinatorics
Primary 05A05, Secondary 05A15, 05A19
We study positional statistics for four families of pattern-avoiding permutations counted by the large Schröder numbers. Specifically, we focus on the pairs of patterns {2413,3142} (separable permutations), {1324,1423}, {1423,2413}, and {1324,2134}. For each class, we derive multivariate generating functions that track the relative positions of specific entries. Our approach combines structural decompositions with the kernel method to obtain explicit formulas involving the generating function for the Schröder numbers. As a byproduct, we obtain alternative proofs that each of these classes is enumerated by the Schröder numbers. We also identify several known triangular arrays arising from our positional refinements, including connections to the central binomial coefficients and sequences appearing in the work of Kreweras on covering hierarchies.
title On separable permutations and three other pairs in the Schröder class
topic Combinatorics
Primary 05A05, Secondary 05A15, 05A19
url https://arxiv.org/abs/2603.25528