Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.13003

Dyck Symmetric Functions and Applications to \(q,t\)-Catalan Polynomials

Graham Hawkes
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper develops three related combinatorial results for Dyck-type sequences. First, it constructs a row-insertion algorithm for dual Dyck sequences and extends it to Dyck tableaux. This construction gives a weight-preserving bijection between dual Dyck factorizations and pairs consisting of a Dyck tableau and a semistandard Young tableau of the same shape. As a consequence, the associated dual Dyck symmetric functions are Schur-positive, and the corresponding affine Dyck symmetric functions have the conjugate-shape Schur expansion. Second, it applies these Dyck symmetric functions to the \(q,t\)-Catalan polynomial. It gives a two-column tableau formula for \(C_n(q,t)\), expressing it as a sum over Dyck \(m\)-skeletons and at-most-two-column Dyck tableaux with summands involving two-variable Schur functions. Third, it develops a Dyck-skeleton formula for the deficit range \(\defc\le 2n-8\). Full and special Dyck skeletons, together with local \(\mathrm{East}\), \(\mathrm{West}\), \(\mathrm{up}\), and \(\mathrm{down}\) moves, organize the low-area half of each low-deficit slice into skeleton-indexed strings. The \(q,t\)-symmetry of \(C_n(q,t)\) supplies the complementary high-area half in the resulting interval formula.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Graham Hawkes. 2026-05-13. Dyck Symmetric Functions and Applications to \(q,t\)-Catalan Polynomials. https://arxiv.org/abs/2605.13003

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗