REVIEW 2 cited by
Higher Verlinde Categories: The Mixed Case
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
abstract
Over a field of characteristic $p>0$, the higher Verlinde categories $\mathrm{Ver}_{p^n}$ are obtained by taking the abelian envelope of quotients of the category of tilting modules for the algebraic group $\mathrm{SL}_2$. These symmetric tensor categories have been introduced in arXiv:2003.10499 & arXiv:2003.10105, and their properties have been extensively studied in the former reference. In arXiv:2105.07724, the above construction for $\mathrm{SL}_2$ has been generalized to Lusztig's quantum group for $\mathfrak{sl}_2$ and root of unity $\zeta$, which produces the mixed higher Verlinde categories $\mathrm{Ver}^{\zeta}_{p^{(n)}}$. Inspired by the results of arXiv:2003.10499, we study the properties of these braided tensor categories in detail. In particular, we establish a Steinberg tensor product formula for the simple objects of $\mathrm{Ver}^{\zeta}_{p^{(n)}}$, construct a braided embedding $\mathrm{Ver}_{p^n}\hookrightarrow \mathrm{Ver}^{\zeta}_{p^{(n+1)}}$, compute the symmetric center of $\mathrm{Ver}^{\zeta}_{p^{(n)}}$, and identify its Grothendieck ring.
Forward citations
Cited by 2 Pith papers
-
Relative Invertibility and Full Dualizability of Finite Braided Tensor Categories
A finite braided tensor category is fully dualizable in the Morita 4-category of braided pre-tensor categories whenever its symmetric center is separable.
-
Tensor ideals of abelian type and quantum groups
Tensor ideals of abelian type in quantum-group tilting categories are classified by nilpotent orbits (assuming the naturality conjecture), prime tensor ideals are classified unconditionally, and Duflo involutions for ...
Discussion (0). Continue with ORCID to comment.