Search arXivSearch

arXiv · 2607.01141

Normal ordering in the $(p,q)$-deformed generalized Weyl algebra. II: Interpretation in terms of rook placements

Abstract

In this paper, we investigate the combinatorial structure arising from the $(p, q)$-deformed generalized Weyl algebra generated by variables $X, Y$, and $Z_p$, satisfying the $(p, q)$-commutation relations $XY-qYX=h Y^sZ_{p}, XZ_p=pZ_pX$, and $Z_pY=pYZ_p$, where $s\in \mathbb{N}_0$. Our primary objective is to use the normal ordering process defined by these relations to develop a novel model of $(p, q)$-deformed rook theory. Specifically, we introduce a new framework of $(p, q)$-deformed $s$-rook numbers derived from this normal ordering process. Utilizing these combinatorial models, we provide explicit combinatorial interpretations for the associated $(p, q)$-generalized Stirling numbers via rook placements on staircase boards. Our results extend several classical and recent formulations in the literature to the general $p\neq 1$ setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Toufik Mansour, Lahcen Oussi, Matthias Schork. 2026-07-14. Normal ordering in the $(p,q)$-deformed generalized Weyl algebra. II: Interpretation in terms of rook placements. https://arxiv.org/abs/2607.01141

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