Repository navigation
Conversation
For sectors with a simple unit, a superset of the coupled sectors suffices, as the fusion tree iterators yield nothing for the others: the unit if one side is empty, and otherwise the fusion product of the shorter side only, instead of the intersection of the fusion products of both sides. The trees and their order are unchanged. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Instead of constructing a block for every combination of codomain and domain sectors, `fusionblocks` groups the cached `fusiontrees(W)` by their uncoupled sectors, in the same order as before. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
`sort!(...; by = rank)` evaluated `rank`, and with it the `Dict` lookups of (product) sectors, at every comparison. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
… only the longer side for trees Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…no legs on one side Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
For several units, a coupled sector of a block must be compatible with the units at both ends of either side; otherwise the fusion tree iterator throws instead of being empty. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…ccur Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
`fusiontrees(W)` is a `FusionTreePairs`, an `AbstractIndices` holding the splitting and fusion trees of every coupled sector; the position of a pair follows from those of its trees, and is its token. `subblockstructure(W)` shares these tokens. `fusionblocks` groups the trees of each side by their uncoupled sectors, combines the groups in the order in which they first occur, and fills every block once at its final size; `degeneracystructure` loops over the trees of both sides. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…ePairs The units of a product sector, the block sectors of a space without indices, come with a shape, and showing a FusionTreePairs iterates it in reverse. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
lkdvos
force-pushed
the
lb/fusiontreeblock_construction
branch
from
October 28, 2026 19:19
8e373fa to
3f74b72
Compare
This branch has not been deployed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Closes #596. Stacked on #581.
fusiontrees(W)is aFusionTreePairs, anAbstractIndicesthat stores the splitting and fusion trees of every coupled sector instead of every pair. The position of a pair follows from those of its trees, and is its (integer) token.subblockstructure(W)is aFusionTreePairDictsharing those tokens.fusionblocksgroups the trees of each side by their uncoupled sectors, combines the groups in the order in which they first occur (the order of Construct fusion tree blocks from the shorter side, and group the cached trees infusionblocks#581), and fills every block once at its final size.degeneracystructureloops over the trees of both sides.The transformers are identical to those of #581, block order included, on all transformers of one CTMRG iteration (554 for fℤ₂ × U(1) × SU(3), 550 for fℤ₂ × U(1) × SU(2) × U(1)).
Building those transformers, on top of main + #580 + #581 + #592 (D = 7, shared machine at load 16–29, ranges over 3 interleaved rounds):
Keying the groups by the integer positions of the uncoupled sectors instead makes
fusionblocksabout 1 s faster for SU(2), but the totals are within the noise, so this keeps the simpler version.🤖 Generated with Claude Code