#18285: Implement reduced word graph
-------------------------------------------------+-------------------------
Reporter: tscrim | Owner: sage-
Type: enhancement | combinat
Priority: major | Status: closed
Component: combinatorics | Milestone: sage-6.7
Keywords: coxeter, reduced word, graph | Resolution: fixed
Authors: Travis Scrimshaw | Merged in:
Report Upstream: N/A | Reviewers: Darij
Branch: | Grinberg
7766c554cd739b0f88bfc9ac51116c84e6a0d7b0 | Work issues:
Dependencies: | Commit:
| Stopgaps:
-------------------------------------------------+-------------------------
Changes (by jipilab):
* commit: 7766c554cd739b0f88bfc9ac51116c84e6a0d7b0 =>
Comment:
Hi,
I was not quick enough to review to ticket! Darij was too fast!
I will definitely be using this in the future, thanks Travis!
I had a suggestion of extension for the ticket. I guess now I'll call it a
follow-up. There is a possible follow-up which could implement the
even/odd length braid relations (quotients of the present graph).
This is, in particular, related to the higher Bruhat order, plabic graphs,
and subword complexes.
See section 3 of this paper.
[http://arxiv.org/abs/1404.7380]
I'll need this, so I could work on it soon.
--
Ticket URL: <http://trac.sagemath.org/ticket/18285#comment:11>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
