Role of democratic <i>SU2</i> x <sub><i>n</i></sub> dual-group carrier space and group structure in the superboson quantum-Liouville physics of identical spin ensembles: Maximal <sub><i>n</i></sub> tensor product reduction, via symbolic algebraic combinatorics
Bibliographic record
Abstract
Structural aspects of superboson mappings and their dual group-based carrier spaces inherent in quantum-Liouville NMR formalisms are presented for their conceptual role in understanding the transformational properties and the spin dynamics of identical [A] n ([Formula: see text] n ) spin ensembles or [AX] n systems, given in terms of {T kq (υ)} º {|kqυ > >} tensorial bases. Interest in the explicit democratic labelling of the Liouvillian carrier subspaces of [A] n spin ensembles, prompts an examination of the inner products (ITPs) that define the projective carrier space associated with superbosons. A weak-branching (WB) limit (for (bipartite) partitions λ [Formula: see text] n, for n-indexed (SU2 ×)[Formula: see text] n ) ITPs gives rise to: (i) maximal coefficient sets for [µ] [Formula: see text] [µ']([Formula: see text] n ) irrep products (in Butler's notation), under a sufficiently high (n [Formula: see text] 4µ, 4µ') indexed [Formula: see text] n group, or (ii) to identical numerical {c [Formula: see text], λ' } sequence-ordered sets of reduction coefficients over similar, displaced-sequence fields on augmenting ITP to [µ] [Formula: see text] [µ''], where µ'' > µ' > µ, or else (iii) to some (sequence-displaced) subset of the latter. The origins of the decompositional WB limit as part of group structure may be traced to an algorithmic similarity between the LittlewoodRichardson and Young(III) combinatorial rules. Alternative approaches to the bipartite product decompositional mappings are possible, using both (subspatial-restricted) Schur-function techniques of Wybourne and [Formula: see text] 16[Formula: see text]n[Formula: see text]28 symbolic algorithmic enumerations based on the SYMMETRICA discrete-maths. package of Kerber et al. (J. Symbolic Comput. 14, 195 (1993)). The nature of maximal sets and scaling in ITP decompositions is established and recognition given to the role of combinatorics, [Formula: see text] n algorithms and the superboson algebras of the SU(2) × [Formula: see text] n group in (multiple) quantized spin physics. PACS Nos.: 02.10, 03.65Ca, 33.20Vq, 33.25+k
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".