REVIEW 3 cited by
Linear independence for C_ell⁽¹⁾ by using C_(2ell)⁽¹⁾
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Linear independence for C_ell⁽¹⁾ by using C_(2ell)⁽¹⁾
read the original abstract
In this note we prove linear independence of the combinatorial spanning set for standard $C_\ell^{(1)}$-module $L(k\Lambda_0)$ by establishing a connection with the combinatorial basis of Feigin-Stoyanovsky's type subspace $W(k\Lambda_0)$ of $C_{2\ell}^{(1)}$-module $L(k\Lambda_0)$. It should be noted that the proof of linear independence for the basis of $W(k\Lambda_0)$ is obtained by using simple currents and intertwining operators in the vertex operator algebra $L(k\Lambda_0)$.
Forward citations
Cited by 3 Pith papers
-
Remarks on the conjectures of Capparelli, Meurman, Primc and Primc
The authors relate the remaining two Capparelli-Meurman-Primc-Primc conjectures to non-standard specializations of standard modules for A_{2n}^{(2)} and D_{n+1}^{(2)} using prior Rogers-Ramanujan work for affine Lie algebras.
-
Leading Terms of Relations on a Level 5 Module over the Twisted Affine Lie Algebra $A_2^{(2)}$
The partial partition conditions for level 5 A2^(2) L(5Λ0) match the specialized character through q^41, miss one partition each at q^42 and q^48, and differ from the Borcea-dual A1^(1) level 2 identity.
-
Two examples of combinatorial relations among relations of $C_{n}\sp{(1)}$-standard modules for higher levels
Two examples are given where combinatorial counting of relations among relations for C_n^(1) standard modules at level 5 and C_3^(1) at higher levels matches the representation-theoretic dimension in a trapezoid of ne...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.