GroupsWithPropertyT/AutFN.jl

110 lines
3.1 KiB
Julia
Raw Normal View History

using ArgParse
using Nemo
2017-06-22 15:18:26 +02:00
import SCS.SCSSolver
using PropertyT
2017-06-22 15:18:26 +02:00
using Groups
Nemo.setpermstyle(:cycles)
2017-03-13 16:18:42 +01:00
#=
Note that the element
α(i,j,k) = ϱ(i,j)*ϱ(i,k)*inv(ϱ(i,j))*inv(ϱ(i,k)),
which surely belongs to ball of radius 4 in Aut(F₄) becomes trivial under the representation
Aut(F₄) GL₄()ℤ⁴ GL₅().
Moreover, due to work of Potapchik and Rapinchuk [1] every real representation of Aut(Fₙ) into GLₘ() (for m 2n-2) factors through GLₙ()ℤⁿ, so will have the same problem.
We need a different approach: Here we actually compute in Aut(𝔽₄)
=#
2017-09-10 16:20:36 +02:00
###############################################################################
#
# Generating set
#
###############################################################################
function SOutFN_generating_set(N::Int)
SOutFN = AutGroup(FreeGroup(N), special=true, outer=true)
S = gens(SOutFN);
S = [S; [inv(s) for s in S]]
return SOutFN, unique(S)
end
###############################################################################
#
# Parsing command line
#
###############################################################################
function parse_commandline()
s = ArgParseSettings()
@add_arg_table s begin
"--tol"
2017-09-10 16:20:36 +02:00
help = "set numerical tolerance for the SDP solver"
arg_type = Float64
2017-09-10 16:20:36 +02:00
default = 1e-6
"--iterations"
2017-09-10 16:20:36 +02:00
help = "set maximal number of iterations for the SDP solver"
arg_type = Int
2018-03-22 11:03:11 +01:00
default = 50000
"--upper-bound"
2017-09-10 16:20:36 +02:00
help = "Set an upper bound for the spectral gap"
arg_type = Float64
default = Inf
"--cpus"
help = "Set number of cpus used by solver (default: auto)"
arg_type = Int
required = false
"-N"
2017-09-10 16:20:36 +02:00
help = "Consider automorphisms of free group on N generators"
arg_type = Int
default = 2
2018-03-22 11:03:11 +01:00
"--radius"
help = "Radius of ball B_r(e,S) to find solution over"
arg_type = Int
default = 2
"--warmstart"
help = "Use warmstart.jld as the initial guess for SCS"
action = :store_true
end
return parse_args(s)
end
function main()
2018-03-22 11:05:36 +01:00
include("CPUselect.jl")
set_parallel_mthread(PARSEDARGS, workers=true)
2017-09-10 16:20:36 +02:00
N = parsed_args["N"]
radius = 2
tol = parsed_args["tol"]
iterations = parsed_args["iterations"]
upper_bound = parsed_args["upper-bound"]
2017-09-10 16:20:36 +02:00
dirname = "SOutF$(N)_$(upper_bound)_r=$radius"
2017-09-10 16:20:36 +02:00
logger = PropertyT.setup_logging(dirname)
2017-09-10 16:20:36 +02:00
info(logger, "Group: $dirname")
info(logger, "Iterations: $iterations")
info(logger, "Precision: $tol")
info(logger, "Upper bound: $upper_bound")
2017-09-10 16:20:36 +02:00
G, S = SOutFN_generating_set(N)
info(logger, G)
info(logger, "Symmetric generating set of size $(length(S))")
info(logger, S)
Id = G()
solver = SCSSolver(eps=tol, max_iters=iterations, linearsolver=SCS.Direct)
2017-09-10 16:20:36 +02:00
@time PropertyT.check_property_T(dirname, S, Id, solver, upper_bound, tol, 2)
return 0
end
2017-03-13 16:18:42 +01:00
main()