✦ LIBER ✦

Algorithmic Methods for Finitely Generated Abelian Groups

✍ Scribed by Henri Cohen; Francisco Diaz Y Diaz; Michel Olivier

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 357 KB
Volume: 31
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.2000.1014

No coin nor oath required. For personal study only.

✦ Synopsis

We describe algorithmic tools to compute with exact sequences of Abelian groups. Although simple in nature, these are essential for a number of applications such as the determination of the structure of (Z K /m) * for an ideal m of a number field K, of ray class groups of number fields, and of conductors of the corresponding Abelian extensions.

📜 SIMILAR VOLUMES

Addition Theorems for Finite Abelian Gro

Addition Theorems for Finite Abelian Groups

✍ W.D. Gao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Let \(a_{1}, \ldots, a_{k}\) be a sequence of elements in an Abelian group of order \(n\) (repetition allowed). In this paper, we give two sufficient conditions such that an element \(g \in G\) can be written in the form \(g=a_{i_{1}}+a_{i_{2}}+\cdots+a_{i_{n}}, 1 \leqslant i_{1}<i_{2}<\cdots<i_{n}

Neighbourhood Graphs of Cayley Graphs fo

Neighbourhood Graphs of Cayley Graphs for Finitely-generated Groups

✍ Markus Neuhauser 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 134 KB

In this short note the neighbourhood graph of a Cayley graph is considered. It has, as nodes, a symmetric generating set of a finitely-generated group . Two nodes are connected by an edge if one is obtained from the other by multiplication on the right by one of the generators. Two necessary conditi

A Generating Function for the Number of

A Generating Function for the Number of Homomorphisms from a Finitely Generated Abelian Group to an Alternating Group

✍ Yugen Takegahara 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 151 KB

On the Complexity of the Isomorphism Rel

On the Complexity of the Isomorphism Relation for Finitely Generated Groups

✍ Simon Thomas; Boban Velickovic 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Algorithms for Finite Near-rings and the

Algorithms for Finite Near-rings and theirN-groups

✍ Franz Binder; Peter Mayr 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 337 KB

In this note, we present algorithms to deal with finite near-rings, the appropriate algebraic structure to study non-linear functions on finite groups. Just as rings (of matrices) operate on vector spaces, near-rings operate on groups. In our approach, we have developed efficient algorithms for a va

Tensor Categories with Fusion Rules of S

Tensor Categories with Fusion Rules of Self-Duality for Finite Abelian Groups

✍ Daisuke Tambara; Shigeru Yamagami 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Semisimple tensor categories with fusion rules of self-duality for finite abelian groups are classified. As an application, we prove that the Tannaka duals of the dihedral and the quaternion groups of order 8 and the eight-dimensional Hopf algebra of Kac and Paljutkin are not isomorphic as abstract