kalmar/Groups.jl
1
0
Fork 0
mirror of https://github.com/kalmarek/Groups.jl.git synced 2024-11-19 06:30:29 +01:00
Code Issues Releases Wiki Activity

Since SMC act from the left(!) distinguish Aut(Left|Right)Perm

Browse Source
This commit is contained in:
Marek Kaluba 2021-07-07 10:36:40 +02:00
parent 99fd238cf2
commit eef13c9afa
No known key found for this signature in database
GPG Key ID: 8BF1A3855328FC15
2 changed files with 58 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

51
src/groups/symplectic_twists.jl
View File

@ -217,3 +217,54 @@ function evaluate!(
return t
end
struct PermLeftAut <: GSymbol
perm::Vector{UInt8}
function PermLeftAut(p::AbstractVector{<:Integer})
@assert sort(p) == 1:length(p)
return new(p)
end
end
function Base.show(io::IO, p::PermLeftAut)
print(io, "σˡ")
join(io, (subscriptify(Int(i)) for i in p.perm))
end
Base.inv(p::PermLeftAut) = PermLeftAut(invperm(p.perm))
Base.:(==)(p::PermLeftAut, q::PermLeftAut) = p.perm == q.perm
Base.hash(p::PermLeftAut, h::UInt) = hash(p.perm, hash(PermLeftAut, h))
function evaluate!(v::NTuple{T, N}, p::PermLeftAut, ::Alphabet, tmp=one(first(v))) where {T, N}
G = parent(first(v))
A = alphabet(G)
img = gens(G)[p.perm]
gens_idcs = Dict(A[A[first(word(im))]] => img[i] for (i,im) in enumerate(gens(G)))
for elt in v
copyto!(tmp, elt)
resize!(word(elt), 0)
for idx in word(tmp)
# @show idx
if haskey(gens_idcs, idx)
k = gens_idcs[idx]
append!(word(elt), word(k))
elseif haskey(gens_idcs, inv(A, idx))
k = inv(gens_idcs[inv(A, idx)])
append!(word(elt), word(k))
else
push!(word(elt), idx)
end
end
_setnormalform!(elt, false)
_setvalidhash!(elt, false)
normalform!(tmp, elt)
copyto!(elt, tmp)
end
return v
end

14
src/groups/transvections.jl
View File

@ -82,25 +82,25 @@ Base.@propagate_inbounds function evaluate!(v::NTuple{T, N}, t::Transvection, A:
return v
end
struct PermAut <: GSymbol
struct PermRightAut <: GSymbol
perm::Vector{UInt8}
function PermAut(p::AbstractVector{<:Integer})
function PermRightAut(p::AbstractVector{<:Integer})
@assert sort(p) == 1:length(p)
return new(p)
end
end
function Base.show(io::IO, p::PermAut)
function Base.show(io::IO, p::PermRightAut)
print(io, 'σ')
join(io, (subscriptify(Int(i)) for i in p.perm))
end
Base.inv(p::PermAut) = PermAut(invperm(p.perm))
Base.inv(p::PermRightAut) = PermRightAut(invperm(p.perm))
Base.:(==)(p::PermAut, q::PermAut) = p.perm == q.perm
Base.hash(p::PermAut, h::UInt) = hash(p.perm, hash(PermAut, h))
Base.:(==)(p::PermRightAut, q::PermRightAut) = p.perm == q.perm
Base.hash(p::PermRightAut, h::UInt) = hash(p.perm, hash(PermRightAut, h))
Base.@propagate_inbounds function evaluate!(v::NTuple{T, N}, p::PermAut, ::Alphabet, tmp=one(first(v))) where {T, N}
function evaluate!(v::NTuple{T, N}, p::PermRightAut, ::Alphabet, tmp=one(first(v))) where {T, N}
return v[p.perm]
end