Probabilistic degenerate derangement polynomials

In combinatorics, a derangement is a permutation of the elements of a set, such that no element appears in its original position. The number of derangements of an [Formula: see text]-element set is called the [Formula: see text]th derangement number. Recently, the degenerate derangement numbers and...

Full description

Saved in:
Bibliographic Details
Main Authors: Taekyun Kim, Dae San Kim, Dmitry V. Dolgy
Format: Article
Language:English
Published: Taylor & Francis Group 2025-12-01
Series:Mathematical and Computer Modelling of Dynamical Systems
Subjects:
Online Access:https://www.tandfonline.com/doi/10.1080/13873954.2025.2529188
Tags: Add Tag
No Tags, Be the first to tag this record!