Search arXivSearch

arXiv · 2606.28108

Mixed Products of Modified Greaves--Jing--Zhu Operators

Abstract

Let $\mathcal Y(z;t)$ be the modified Greaves--Jing--Zhu operator on the odd power-sum ring. We first point out that this operator can be obtained from the classical neutral operator by a simple diagonal change of variables. We then study products in which the two deformation parameters are not necessarily the same. For two parameters $t$ and $s$, we compute the scalar factor that appears in the mixed product. This factor has an explicit exponential form and, in a completed setting, can also be written as a quotient of infinite $t$-Pochhammer products. We also give a recurrence for its coefficients, a product formula for several mixed operators, and formulas for the coefficients obtained after applying the operators to $\mathbf 1$. A particularly simple case occurs when $s=t^M$. In this case the scalar factor becomes the finite quotient $(u;t)_M/(-u;t)_M$. Its coefficients are signed principal specializations of one-row Schur $Q$-functions. As a result, after removing the signs, these coefficients are nonnegative palindromic polynomials. We also give a Gaussian-binomial formula and a finite-order recurrence.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. -J. Lee. 2026-06-26. Mixed Products of Modified Greaves--Jing--Zhu Operators. https://arxiv.org/abs/2606.28108

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