✦ LIBER ✦

Enumeration of Metacyclicp-Groups

✍ Scribed by Steven Liedahl

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 133 KB
Volume: 186
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.1996.0381

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Graphical Regular Representations of

The Graphical Regular Representations of Finite Metacyclicp-Groups

✍ Cai Heng Li; Hyo-Seob Sim 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 136 KB

A Cayley graph = Cay(G, S) is called a graphical regular representation of the group G if Aut = G. One long-standing open problem about Cayley graphs is to determine which Cayley graphs are graphical regular representations of the corresponding groups. A simple necessary condition for to be a graphi

Enumerating Boundedly Generated Finite G

Enumerating Boundedly Generated Finite Groups

✍ Alexander Lubotzky 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 66 KB

We prove a conjecture of Mann and Pyber which estimates the number of finite groups of a given order and a given number of generators. This implies that the normal subgroup growth of free groups is of rate n log n .

ENUMERATION OF SOME CLASSES OF RECURSIVE

ENUMERATION OF SOME CLASSES OF RECURSIVELY ENUMERABLE SETS

✍ Kempachiro Ohashi 📂 Article 📅 1964 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB

Enumeration of networks

✍ P. F. Thomson 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB

Enumeration of Hypergraphs

✍ Toru Ishihara 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 87 KB

In this paper, we will study enumeration of hypergraphs. Let S p be a symmetric group acting on a p-setX . It induces the permutation group S \* p acting on the set of all subsets of X . Our problem is reduced to finding a good formula for the cycle index of S \* p . A crucial point is to calculate

Enumeration of Planar Constellations

✍ Mireille Bousquet-Mélou; Gilles Schaeffer 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 270 KB

The enumeration of transitive ordered factorizations of a given permutation is a combinatorial problem related to singularity theory. Let n ≥ 1, and let σ 0 be a permutation of n having d i cycles of length i, for i ≥ 1. Let m ≥ 2. We prove that the number of m-tuples σ 1 σ m of permutations of n su