A combinatorial approach to the power of 2 in the number of involutions

preprint2010arXivOpen access

Abstract

We provide a combinatorial approach to the largest power of pp in the number of permutations ππ with πp=1π^p=1, for a fixed prime number pp. With this approach, we find the largest power of 22 in the number of involutions, in the signed sum of involutions and in the numbers of even or odd involutions.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.