Skip to content
Open
Show file tree
Hide file tree
Changes from 13 commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
54 changes: 54 additions & 0 deletions src/Groups/pcgroup.jl
Original file line number Diff line number Diff line change
Expand Up @@ -923,3 +923,57 @@ function collector(::Type{T}, G::PcGroup) where T <: IntegerUnion
end

collector(G::PcGroup) = collector(ZZRingElem, G)

# GAP wrappers for group encoding / decoding

"""
encode(G::PcGroup)

Return a `ZZRingElem` representing the polycyclic group `G`,
using the same encoding as GAP's `CodePcGroup` and Magma's `SmallGroupEncoding`.
Currently only defined for `PcGroup`, not `SubPcGroup`.

# Examples
```jldoctest
julia> G = small_group(12, 2)
Pc group of order 12

julia> code = encode(G)
266

julia> H = pc_group(order(G), code)
Pc group of order 12

julia> encode(G) == encode(H)
true
```
"""
function encode(G::PcGroup)
return ZZ(GAP.Globals.CodePcGroup(GapObj(G))::GapInt)
end

"""
pc_group(order::IntegerUnion, code::IntegerUnion)

Given an integer `order` and an integer `code`, return the polycyclic group it encodes.
Both `order` and `code` can be of type `Int`, `BigInt`, or `ZZRingElem`.
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
Both `order` and `code` can be of type `Int`, `BigInt`, or `ZZRingElem`.

The accepted codes and resulting groups match those of GAP's `PcGroupCode` and Magma's `SmallGroupDecoding`.

# Examples
```jldoctest
julia> G = small_group(12, 2)
Pc group of order 12

julia> code = encode(G)
266

julia> H = pc_group(order(G), code)
Pc group of order 12

julia> encode(G) == encode(H)
true
```
"""
function pc_group(order::IntegerUnion, code::IntegerUnion)
return PcGroup(GAP.Globals.PcGroupCode(GAP.GapInt(BigInt(code)),GAP.GapInt(BigInt(order))))
Copy link
Member

@fingolfin fingolfin Nov 5, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

As @lgoettgens pointed out this is inefficient. We will add a GAP.GapInt constructor in GAP.jl so that one can directly write GAP.GapInt(code)

Copy link
Member

@lgoettgens lgoettgens Nov 5, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

See oscar-system/GAP.jl#1283. Once that and oscar-system/GAP.jl#1284 are merged (and further 20 minutes have passed), this line can be changed to

Suggested change
return PcGroup(GAP.Globals.PcGroupCode(GAP.GapInt(BigInt(code)),GAP.GapInt(BigInt(order))))
return PcGroup(GAP.Globals.PcGroupCode(GapInt(code), GapInt(order)))

At the same time, please change

GAP = "0.16.0"
to "0.16.1"

Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

GAP.jl 0.16.1 is out now, so this can be done.

end
1 change: 1 addition & 0 deletions src/exports.jl
Original file line number Diff line number Diff line change
Expand Up @@ -598,6 +598,7 @@ export elliptic_parameter
export elliptic_surface
export embedding
export embedding_orthogonal_group
export encode
export enriques_surface_automorphism_group
export enumerate_classes_of_lattices_with_isometry
export epimorphism_from_free_group
Expand Down
17 changes: 17 additions & 0 deletions test/Groups/pcgroup.jl
Original file line number Diff line number Diff line change
Expand Up @@ -150,3 +150,20 @@ end
@test is_bijective(f)
end
end

@testset "pcgroup code and reconstruction" begin
groups = [
cyclic_group(6),
cyclic_group(12),
dihedral_group(10),
small_group(PcGroup, 12, 2)
]

for G in groups
code = encode(G)
H = pc_group(order(G), code)
@test hom(G, H, gens(H)) isa Map
@test order(G) == order(H)
@test encode(H) == code
end
end
Loading