Implement left descent and reduced word for colored permutations

[tscrim]

Because they are nice enough groups, we can define an algorithm using left descents (in a certain sense) to compute a reduced word for a colored permutation using the standard generating set.

CC: @sagetrac-sage-combinat @AndrewAtLarge @stumpc5 @fchapoton

Component: combinatorics

Keywords: colored permutations, complex reflection groups

Author: Travis Scrimshaw

Branch/Commit: f9cca1a

Reviewer: Andrew Mathas

Issue created by migration from https://trac.sagemath.org/ticket/25283

[tscrim]

Branch: public/combinat/colored_permutations_reduced_word-25283

[tscrim]

Commit: 39c0121

[tscrim]

New commits:

39c0121

Implementation of descents and reduced word for colored permutations.

[fchapoton]

comment:2

coverage is not 100%

[sagetrac-git]

Changed commit from 39c0121 to 55d7f22

[sagetrac-git]

Branch pushed to git repo; I updated commit sha1. New commits:

55d7f22

Adding missing doctest.

[tscrim]

comment:4

Forgot to add that doctest in. Now at 100% coverage.

[AndrewMathas]

Reviewer: Andrew Mathas

[AndrewMathas]

comment:5

A nice small patch that's easy to review:) I haven't checked the mathematics but the doc tests do this so I think it's good to go.

[vbraun]

comment:6

Merge conflict

[sagetrac-git]

Changed commit from 55d7f22 to f9cca1a

[sagetrac-git]

Branch pushed to git repo; I updated commit sha1. New commits:

f9cca1a

Merge branch 'public/combinat/colored_permutations_reduced_word-25283' of git://trac.sagemath.org/sage into public/combinat/colored_permutations_reduced_word-25283

[tscrim]

comment:8

Trivial conflict.

[vbraun]

Changed branch from public/combinat/colored_permutations_reduced_word-25283 to f9cca1a