Search arXivSearch

arXiv · 2603.25528

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

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Juan B. Gil, Oscar A. Lopez, Michael D. Weiner. 2026-06-05. On separable permutations and three other pairs in the Schröder class. https://arxiv.org/abs/2603.25528

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO