On the orders of directly indecomposable groups

P. Erdős, Péter P. Pálfy

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We investigate the set of those integers n for which directly indecomposable groups of order n exist. For even n such groups are easily constructed. In contrast, we show that the density of the set of odd numbers with this property is zero. For each n we define a graph whose connected components describe uniform direct decompositions of all groups of order n. We prove that for almost all odd numbers (i.e., with the exception of a set of density zero) this graph has a single 'big' connected component and all other vertices are isolated. We also give an asymptotic formula for the number of isolated vertices of the graph, i.e., for the number of prime divisors q of n such that every group of order n has a cyclic direct factor of order q.

Original language English 165-179 15 Discrete Mathematics 200 1-3 Published - Apr 6 1999

Fingerprint

Decomposition
Odd number
Connected Components
Graph in graph theory
Zero
Asymptotic Formula
Divisor
Exception
Decompose
Integer

Keywords

• Density
• Indecomposable group
• Uniform factorization

ASJC Scopus subject areas

• Discrete Mathematics and Combinatorics
• Theoretical Computer Science

Cite this

On the orders of directly indecomposable groups. / Erdős, P.; Pálfy, Péter P.

In: Discrete Mathematics, Vol. 200, No. 1-3, 06.04.1999, p. 165-179.

Research output: Contribution to journalArticle

Erdős, P & Pálfy, PP 1999, 'On the orders of directly indecomposable groups', Discrete Mathematics, vol. 200, no. 1-3, pp. 165-179.
Erdős, P. ; Pálfy, Péter P. / On the orders of directly indecomposable groups. In: Discrete Mathematics. 1999 ; Vol. 200, No. 1-3. pp. 165-179.
@article{c648ee4682ac4ecfb8417d470cd6ae3c,
title = "On the orders of directly indecomposable groups",
abstract = "We investigate the set of those integers n for which directly indecomposable groups of order n exist. For even n such groups are easily constructed. In contrast, we show that the density of the set of odd numbers with this property is zero. For each n we define a graph whose connected components describe uniform direct decompositions of all groups of order n. We prove that for almost all odd numbers (i.e., with the exception of a set of density zero) this graph has a single 'big' connected component and all other vertices are isolated. We also give an asymptotic formula for the number of isolated vertices of the graph, i.e., for the number of prime divisors q of n such that every group of order n has a cyclic direct factor of order q.",
keywords = "Density, Indecomposable group, Uniform factorization",
author = "P. Erdős and P{\'a}lfy, {P{\'e}ter P.}",
year = "1999",
month = "4",
day = "6",
language = "English",
volume = "200",
pages = "165--179",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - On the orders of directly indecomposable groups

AU - Erdős, P.

AU - Pálfy, Péter P.

PY - 1999/4/6

Y1 - 1999/4/6

N2 - We investigate the set of those integers n for which directly indecomposable groups of order n exist. For even n such groups are easily constructed. In contrast, we show that the density of the set of odd numbers with this property is zero. For each n we define a graph whose connected components describe uniform direct decompositions of all groups of order n. We prove that for almost all odd numbers (i.e., with the exception of a set of density zero) this graph has a single 'big' connected component and all other vertices are isolated. We also give an asymptotic formula for the number of isolated vertices of the graph, i.e., for the number of prime divisors q of n such that every group of order n has a cyclic direct factor of order q.

AB - We investigate the set of those integers n for which directly indecomposable groups of order n exist. For even n such groups are easily constructed. In contrast, we show that the density of the set of odd numbers with this property is zero. For each n we define a graph whose connected components describe uniform direct decompositions of all groups of order n. We prove that for almost all odd numbers (i.e., with the exception of a set of density zero) this graph has a single 'big' connected component and all other vertices are isolated. We also give an asymptotic formula for the number of isolated vertices of the graph, i.e., for the number of prime divisors q of n such that every group of order n has a cyclic direct factor of order q.

KW - Density

KW - Indecomposable group

KW - Uniform factorization

UR - http://www.scopus.com/inward/record.url?scp=0347670963&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347670963&partnerID=8YFLogxK

M3 - Article

VL - 200

SP - 165

EP - 179

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -