Abstract
We provide a combinatorial approach to the largest power of in the number of permutations with , for a fixed prime number . With this approach, we find the largest power of in the number of involutions, in the signed sum of involutions and in the numbers of even or odd involutions.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.