INFRA-ABELIAN GROUPS AND FREE ACTIONS OF FINITE GROUPS ON THE N -TORUS

2002 ◽  
Vol 30 (6) ◽  
pp. 2791-2803 ◽  
Author(s):  
Daciberg Lima Gonçalves ◽  
João Peres Vieira
Keyword(s):  
Finite Groups ◽  
Abelian Groups ◽  
Free Actions

Pointwise bound for ℓ-torsion in class groups: Elementary abelian extensions

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Jiuya Wang
Keyword(s):  
Galois Group ◽  
Prime Number ◽  
Finite Groups ◽  
Upper Bound ◽  
Abelian Groups ◽  
Class Groups ◽  
Abelian Extensions ◽  
Pointwise Bound ◽  
First Case

AbstractElementary abelian groups are finite groups in the form of {A=(\mathbb{Z}/p\mathbb{Z})^{r}} for a prime number p. For every integer {\ell>1} and {r>1}, we prove a non-trivial upper bound on the {\ell}-torsion in class groups of every A-extension. Our results are pointwise and unconditional. This establishes the first case where for some Galois group G, the {\ell}-torsion in class groups are bounded non-trivially for every G-extension and every integer {\ell>1}. When r is large enough, the unconditional pointwise bound we obtain also breaks the previously best known bound shown by Ellenberg and Venkatesh under GRH.

On enhanced power graphs of finite groups

2018 ◽  
Vol 17 (08) ◽  
pp. 1850146 ◽  
Author(s):  
Sudip Bera ◽  
A. K. Bhuniya
Keyword(s):  
Finite Groups ◽  
Abelian Groups ◽  
Cyclic Subgroups ◽  
Power Graph ◽  
Vertex Set ◽  
One To One

Given a group [Formula: see text], the enhanced power graph of [Formula: see text], denoted by [Formula: see text], is the graph with vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are edge connected in [Formula: see text] if there exists [Formula: see text] such that [Formula: see text] and [Formula: see text] for some [Formula: see text]. Here, we show that the graph [Formula: see text] is complete if and only if [Formula: see text] is cyclic; and [Formula: see text] is Eulerian if and only if [Formula: see text] is odd. We characterize all abelian groups and all non-abelian [Formula: see text]-groups [Formula: see text] such that [Formula: see text] is dominatable. Besides, we show that there is a one-to-one correspondence between the maximal cliques in [Formula: see text] and the maximal cyclic subgroups of [Formula: see text].

Profinite Modules

1973 ◽  
Vol 16 (3) ◽  
pp. 405-415
Author(s):  
Gerard Elie Cohen
Keyword(s):  
Finite Group ◽  
General Theory ◽  
Finite Length ◽  
Finite Groups ◽  
Inverse Limit ◽  
Abelian Groups ◽  
Point Of View ◽  
Inverse Limits ◽  
Profinite Groups ◽  
Inverse Systems

An inverse limit of finite groups has been called in the literature a pro-finite group and we have extensive studies of profinite groups from the cohomological point of view by J. P. Serre. The general theory of non-abelian modules has not yet been developed and therefore we consider a generalization of profinite abelian groups. We study inverse systems of discrete finite length R-modules. Profinite modules are inverse limits of discrete finite length R-modules with the inverse limit topology.

A NOTE ON FIXED-POINT-FREE ACTIONS OF FINITE GROUPS

1990 ◽  
Vol 41 (2) ◽  
pp. 127-130 ◽  
Author(s):  
S. D. BELL ◽  
B. HARTLEY
Keyword(s):  
Fixed Point ◽  
Finite Groups ◽  
Free Actions

Conjugacy Separability of Certain Polygonal Products

1996 ◽  
Vol 39 (3) ◽  
pp. 294-307 ◽  
Author(s):  
Goansu Kim
Keyword(s):  
Finite Groups ◽  
Abelian Groups ◽  
Finitely Generated ◽  
Cyclic Subgroups ◽  
Conjugacy Separability ◽  
Conjugacy Separable

AbstractWe show that polygonal products of polycyclic-by-finite groups amalgamating central cyclic subgroups, with trivial intersections, are conjugacy separable. Thus polygonal products of finitely generated abelian groups amalgamating cyclic subgroups, with trivial intersections, are conjugacy separable. As a corollary of this, we obtain that the group A1 *〈a1〉A2 *〈a2〉 • • • *〈am-1〉Am is conjugacy separable for the abelian groups Ai.

Sign in / Sign up

Export Citation Format

Share Document