id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
25283,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.",enhancement,closed,major,sage-8.3,combinatorics,fixed,"colored permutations, complex reflection groups",sage-combinat andrew.mathas stumpc5 chapoton,,Travis Scrimshaw,Andrew Mathas,N/A,,f9cca1a180b71d4ec94b16fc53f596897d180340,f9cca1a180b71d4ec94b16fc53f596897d180340,,