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

Dongsu Kim; Jang Soo Kim

doi:10.1016/j.jcta.2009.08.002

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

Dongsu Kim
, Jang Soo Kim

Korea Advanced Institute of Science and Technology

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

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.

Original language	English
Pages (from-to)	1082-1094
Number of pages	13
Journal	Journal of Combinatorial Theory. Series A
Volume	117
Issue number	8
DOIs	https://doi.org/10.1016/j.jcta.2009.08.002
State	Published - Nov 2010
Externally published	Yes

Keywords

Divisibility
Involutions
Power of a prime

Access to Document

10.1016/j.jcta.2009.08.002

Cite this

@article{1ef42655ebfb4777ab3f8adf2f66abdc,

title = "A combinatorial approach to the power of 2 in the number of involutions",

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.",

keywords = "Divisibility, Involutions, Power of a prime",

author = "Dongsu Kim and Kim, \{Jang Soo\}",

year = "2010",

month = nov,

doi = "10.1016/j.jcta.2009.08.002",

language = "English",

volume = "117",

pages = "1082--1094",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "8",

}

TY - JOUR

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

AU - Kim, Dongsu

AU - Kim, Jang Soo

PY - 2010/11

Y1 - 2010/11

N2 - 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.

AB - 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.

KW - Divisibility

KW - Involutions

KW - Power of a prime

UR - https://www.scopus.com/pages/publications/77955655620

U2 - 10.1016/j.jcta.2009.08.002

DO - 10.1016/j.jcta.2009.08.002

M3 - Article

AN - SCOPUS:77955655620

SN - 0097-3165

VL - 117

SP - 1082

EP - 1094

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 8

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this