Skip to content
Merged
Changes from all commits
Commits
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
6 changes: 3 additions & 3 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -382,8 +382,8 @@ More generally, we can shuffle the entries of the `Vector`
Using some function from `range(len(v))` to `range(result_size)`,
represented as a "action" `Vector`.
If `result_size` is not provided, it defaults to `len(v)`.
If the has duplicate entries `a[j1] == a[j2] == ...`,
then `v.shuffled_by_action(a)[a[j1]]` will be their sum `a[j1] + a[j2] + ...`,
If the action `a` has duplicate entries `a[j1] == a[j2] == ...`,
then `v.shuffled_by_action(a)[a[j1]]` will be their sum `v[j1] + v[j2] + ...`,
so each action `Vector` specifies a linear operation.

```pycon
Expand Down Expand Up @@ -448,4 +448,4 @@ Lattice(3, [[3, 0, 0], [0, 4, 4]], maxrank=2)
The single optional argument of `L.decompose(keep_together)` should be an iterable
of "component" iterables, and the integers in each component iterable are then ensured
to be placed in the same component. The summands are allocated "tightly",
with `maxrank` equal to their actual rank.
with `maxrank` equal to their actual rank.