Published in

Elsevier, Journal of Combinatorial Theory, Series A, 8(117), p. 1082-1094, 2010

DOI: 10.1016/j.jcta.2009.08.002

Links

Tools

Export citation

Search in Google Scholar

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

Journal article published in 2010 by Dongsu Kim, Jang Soo Kim
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

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