article · UMYU Scientifica
An Involution is a Permutation which is equal to its own inverse. An involution is a permutation of a non-empty set which does not contain any permutation cycles of length greater than two (i.e., it consists exclusively of fixed points and transpositions). In this research, we obtain a generating function for the Aunu polynomials. The Aunu polynomials enumerate Aunu-permutation/Involutions according to their number of descents or their number of excedances. In this research, we generated Aunu polynomials of orders: , however, further investigation in the same pattern would lead to the generation of more polynomials of higher orders.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.56919/usci.2652.010
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.
