Related Experiment Video
Updated: Feb 13, 2026

Behavioral Tasks for Examining Identity Recognition In Mice
Published on: February 7, 2025
A note on some identities of derangement polynomials
Taekyun Kim1,2, Dae San Kim3, Gwan-Woo Jang2
11Department of Mathematics, College of Science, Tianjin Polytechnic University, Tianjin, China.
Abstract:
The problem of counting derangements was initiated by Pierre Rémond de Montmort in 1708 (see Carlitz in Fibonacci Q. 16(3):255-258, 1978, Clarke and Sved in Math. Mag. 66(5):299-303, 1993, Kim, Kim and Kwon in Adv. Stud. Contemp. Math. (Kyungshang) 28(1):1-11 2018. A derangement is a permutation that has no fixed points, and the derangement number [Formula: see text] is the number of fixed-point-free permutations on an n element set. In this paper, we study the derangement polynomials and investigate some interesting properties which are related to derangement numbers. Also, we study two generalizations of derangement polynomials, namely higher-order and r-derangement polynomials, and show some relations between them. In addition, we express several special polynomials in terms of the higher-order derangement polynomials by using umbral calculus.
More Related Videos
11:13The Social Dimension of Stress: Experimental Manipulations of Social Support and Social Identity in the Trier Social Stress Test
Published on: November 19, 2015
11:02Identification and Quantification of Deranged Metabolites in Critically Ill Patients Using NMR-Based Metabolomics
Published on: November 29, 2024
Related Concept Videos
Long Division of Polynomials
Real Zeros of Polynomials
Introduction to Polynomial Functions
Synthetic Disvision of Polynomials
Trigonometric Identities II
Personal Identity