PropertyT.jl/test/runtests.jl

118 lines
3.5 KiB
Julia
Raw Normal View History

2019-01-14 17:44:35 +01:00
using AbstractAlgebra, Nemo, Groups, SCS
using JLD
2019-01-14 17:44:35 +01:00
using PropertyT
using Test
2019-01-14 17:44:35 +01:00
indexing(n) = [(i,j) for i in 1:n for j in (i+1):n]
function Groups.gens(M::MatSpace)
@assert M.cols == M.rows
N = M.cols
E(i,j) = begin g = M(1); g[i,j] = 1; g end
S = [E(i,j) for (i,j) in indexing(N)]
S = [S; transpose.(S)]
return S
end
solver(iters; accel=1) =
SCSSolver(max_iters=iters, acceleration_lookback=accel, eps=1e-10)
2019-01-18 15:59:17 +01:00
@testset "1703.09680 Examples" begin
2019-01-14 17:44:35 +01:00
2019-01-18 15:59:17 +01:00
@testset "SL(2,Z)" begin
N = 2
G = MatrixSpace(Nemo.ZZ, N,N)
S = Groups.gens(G)
2019-01-28 08:42:40 +01:00
S = [S; inv.(S)]
2019-01-14 17:44:35 +01:00
2019-01-28 08:42:40 +01:00
rm("SL($N,Z)", recursive=true, force=true)
2019-01-18 15:59:17 +01:00
sett = PropertyT.Settings("SL($N,Z)", G, S, solver(20000, accel=20); upper_bound=0.1)
@test PropertyT.check_property_T(sett) == false
end
2019-01-14 17:44:35 +01:00
2019-01-18 15:59:17 +01:00
@testset "SL(3,Z)" begin
N = 3
G = MatrixSpace(Nemo.ZZ, N,N)
S = Groups.gens(G)
2019-01-28 08:42:40 +01:00
S = [S; inv.(S)]
rm("SL($N,Z)", recursive=true, force=true)
2019-01-18 15:59:17 +01:00
sett = PropertyT.Settings("SL($N,Z)", G, S, solver(1000, accel=20); upper_bound=0.1)
@test PropertyT.check_property_T(sett) == true
end
2019-01-14 17:44:35 +01:00
2019-01-18 15:59:17 +01:00
@testset "SAut(F₂)" begin
N = 2
G = SAut(FreeGroup(N))
S = Groups.gens(G)
S = [S; inv.(S)]
2019-01-28 08:42:40 +01:00
rm("SAut(F$N)", recursive=true, force=true)
2019-01-18 15:59:17 +01:00
sett = PropertyT.Settings("SAut(F$N)", G, S, solver(20000);
upper_bound=0.15, warmstart=false)
@test PropertyT.check_property_T(sett) == false
end
2019-01-14 17:44:35 +01:00
end
2019-01-28 08:42:40 +01:00
@testset "1712.07167 Examples" begin
2019-01-14 17:44:35 +01:00
2019-01-18 15:59:17 +01:00
@testset "oSL(3,Z)" begin
N = 3
G = MatrixSpace(Nemo.ZZ, N,N)
S = Groups.gens(G)
2019-01-28 08:42:40 +01:00
S = [S; inv.(S)]
2019-01-18 15:59:17 +01:00
autS = WreathProduct(PermGroup(2), PermGroup(N))
2019-01-28 08:42:40 +01:00
rm("oSL($N,Z)", recursive=true, force=true)
2019-01-18 15:59:17 +01:00
sett = PropertyT.Settings("SL($N,Z)", G, S, autS, solver(2000, accel=20);
upper_bound=0.27, warmstart=false)
@test PropertyT.check_property_T(sett) == false
#second run just checks the solution
@test PropertyT.check_property_T(sett) == false
2019-01-14 17:44:35 +01:00
2019-01-18 15:59:17 +01:00
sett = PropertyT.Settings("SL($N,Z)", G, S, autS, solver(2000, accel=10);
upper_bound=0.27, warmstart=true)
@test PropertyT.check_property_T(sett) == true
end
2019-01-28 08:42:40 +01:00
@testset "oSL(4,Z)" begin
N = 4
G = MatrixSpace(Nemo.ZZ, N,N)
S = Groups.gens(G)
S = [S; inv.(S)]
autS = WreathProduct(PermGroup(2), PermGroup(N))
rm("oSL($N,Z)", recursive=true, force=true)
sett = PropertyT.Settings("SL($N,Z)", G, S, autS, solver(5000, accel=10);
upper_bound=1.3, warmstart=false)
@test PropertyT.check_property_T(sett) == false
#second run just checks the obtained solution
@test PropertyT.check_property_T(sett) == false
sett = PropertyT.Settings("SL($N,Z)", G, S, autS, solver(20000, accel=10);
upper_bound=1.3, warmstart=true)
@test PropertyT.check_property_T(sett) == true
end
2019-01-14 17:44:35 +01:00
2019-01-28 08:42:40 +01:00
@testset "SAut(F₃)" begin
2019-01-18 15:59:17 +01:00
N = 3
G = SAut(FreeGroup(N))
S = Groups.gens(G)
S = [S; inv.(S)]
autS = WreathProduct(PermGroup(2), PermGroup(N))
2019-01-28 08:42:40 +01:00
rm("oSAut(F$N)", recursive=true, force=true)
2019-01-18 15:59:17 +01:00
sett = PropertyT.Settings("SAut(F$N)", G, S, autS, solver(10000);
upper_bound=0.15, warmstart=false)
@test PropertyT.check_property_T(sett) == false
end
2019-01-14 17:44:35 +01:00
end