Search arXivSearch

arXiv · 2508.12659

A Poisson Type Operator Deformed by Generalized Fibonacci Numbers and Its Combinatorial Moment Formula

Abstract

We introduce a two-parameter deformation of the classical Poisson distribution from the viewpoint of noncommutative probability theory, by defining a $(q,t)$-Poisson type operator (random variable) on the $(q,t)$-Fock space \cite{Bl12} (See also \cite{BY06, AY20}). From the analogous viewpoint of the classical Poisson limit theorem in probability theory, we are naturally led to a family of orthogonal polynomials, which we call the $(q,t)$-Charlier polynomials. These generalize the $q$-Charlier polynomials of Saitoh-Yoshida \cite{SY00a, SY00b} and reflect deeper combinatorial symmetries through the additional deformation parameter $t$. A central feature of this paper is the derivation of a combinatorial moment formula of the $(q,t)$-Poisson type operator and the $(q,t)$-Poisson distribution. This is accomplished by means of a card arrangement technique, which encodes set partitions together with crossing and nesting statistics. The resulting expression naturally exhibits a duality between these statistics, arising from a structure rooted in generalized Fibonacci numbers. Our approach provides a concrete framework where methods in combinatorics and theory of orthogonal polynomials are used to investigate the probabilistic properties arising from the $(q,t)$-deformation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nobuhiro Asai, Marek Bożejko, Lahcen Oussi, Hiroaki Yoshida. 2025-08-18. A Poisson Type Operator Deformed by Generalized Fibonacci Numbers and Its Combinatorial Moment Formula. https://arxiv.org/abs/2508.12659

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO