Search arXivSearch

arXiv · 2606.07061

Polynomial reduction for $q$-holonomic sequences

Abstract

This paper provides a (Laurent) polynomial reduction to $q$-holonomic sequences $F_k(q)$. We first characterize Laurent polynomials $\tilde{p}(x)$ such that the product $\tilde{p}(q^k)F_k(q)$ is summable. Then the reduction framework is given to decompose any given Laurent polynomial into a summable part and a remainder with lower degree. Finally, we introduce a power-partible reduction for $q$-holonomic sequences of which the recurrence relation satisfies a certain symmetry condition. The advantage is that it can not only simultaneously eliminate the highest-degree and lowest-degree terms of a Laurent polynomial satisfying a symmetry condition, but also guarantee the symmetry of the remainder. As applications, we apply the reduction to $q$-central-Delannoy numbers to derive new $q$-identities and $q$-congruences.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rong-Hua Wang, Xiao-Ran Yang, Michael X. X. Zhong. 2026-06-05. Polynomial reduction for $q$-holonomic sequences. https://arxiv.org/abs/2606.07061

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