Skip to content

Use to instead of constructing ToddCoxeter from WordGraph #462

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Joseph-Edwards merged 1 commit into from
Jul 24, 2026
Merged

Use to instead of constructing ToddCoxeter from WordGraph #462

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
11 changes: 5 additions & 6 deletions tests/test_todd_coxeter.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -24,6 +24,7 @@
congruence_kind,
froidure_pin,
presentation,
to,
todd_coxeter,
tril,
word_graph,
Expand Down Expand Up @@ -166,8 +167,8 @@ def test_settings():
tc.standardize("shooortlex")

S = FroidurePin(Transf([3, 1, 2, 1, 2]), Transf([1, 1, 1, 2, 2]))
tc = ToddCoxeter(congruence_kind.twosided, S.right_cayley_graph())
assert tc.number_of_classes() == 4
tc = to(congruence_kind.twosided, S, S.right_cayley_graph(), rtype=(ToddCoxeter, list[int]))
assert tc.number_of_classes() == 5

p = Presentation([0, 1])
presentation.add_rule(p, [0, 0, 0, 0], [0])
Expand Down Expand Up @@ -210,21 +211,19 @@ def test_000_iterators():
]

S = FroidurePin(Transf([1, 3, 4, 2, 3]), Transf([3, 2, 1, 3, 3]))
tc = ToddCoxeter(congruence_kind.onesided, S.right_cayley_graph())
tc = to(congruence_kind.onesided, S, S.right_cayley_graph(), rtype=(ToddCoxeter, list[int]))
tc.add_generating_pair(
froidure_pin.factorisation(S, Transf([3, 4, 4, 4, 4])),
froidure_pin.factorisation(S, Transf([3, 1, 3, 3, 3])),
)
assert tc.generating_pairs() == [[0, 1, 0, 0, 0, 1, 1, 0, 0], [1, 0, 0, 0, 1]]
words = WordRange().alphabet_size(2).min(1).max(5)
assert todd_coxeter.non_trivial_classes(tc, list(words)) == [
[[0], [0, 0, 0, 0]],
[[1], [1, 1, 1]],
[[0, 1], [0, 1, 1, 1]],
[[1, 0], [1, 1, 1, 0]],
[[1, 1], [1, 1, 1, 1]],
[[1, 0, 1], [1, 1, 0, 1]],
[[0, 0, 0, 1], [1, 0, 0, 1]],
]


Expand Down Expand Up @@ -263,7 +262,7 @@ def test_033():

def test_036():
S = FroidurePin(Transf([1, 3, 4, 2, 3]), Transf([3, 2, 1, 3, 3]))
tc = ToddCoxeter(congruence_kind.twosided, S.right_cayley_graph())
tc = to(congruence_kind.twosided, S, S.right_cayley_graph(), rtype=(ToddCoxeter, list[int]))
tc.add_generating_pair([0], [1])
tc.add_generating_pair([0, 0], [0])
assert tc.number_of_classes() == 1
Expand Down
Loading