Brauer-monoid direct implementation. A degree n diagram is represented by a single vector of length 2n. The value at position i is the image of point i.
Brauer-monoid direct implementation. A degree n diagram is represented by a single vector of length 2n. The value at position i is the image of point i.
(alternate x y)Lazy infinite list repeating x y.
Lazy infinite list repeating x y.
(brauer-gens n)The standard generators for the symmetric group and a cup-cap.
The standard generators for the symmetric group and a cup-cap.
(complete maps)Given half the maps individually (arrows in one direction), this completes the diagram.
Given half the maps individually (arrows in one direction), this completes the diagram.
(mul a b)Composing two Brauer diagrams, assumed to be same degree.
Composing two Brauer diagrams, assumed to be same degree.
(trace start diagrams)Trace a path starting from the given point. This is used when stacking two diagrams for composition. The second argument, diagrams, should contain a lazy infinite list, alternating the diagrams. When composing a and b, tracing a point from a should have the list a,b,a,b,a,b,...; while tracing from b should have b,a,b,a,...
Trace a path starting from the given point. This is used when stacking two diagrams for composition. The second argument, diagrams, should contain a lazy infinite list, alternating the diagrams. When composing a and b, tracing a point from a should have the list a,b,a,b,a,b,...; while tracing from b should have b,a,b,a,...
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |