![]() ![]() More sophisticatedĬonstraints can be used to argue against the existence of the remaining nineĬases. ![]() Justin Kaidi, Mario Martone, Leonardo Rastelli, Mitch Weaver. Number of putative cases, only 15 satisfy all of the constraints imposed by ourĪlgorithm, six of which correspond to known 4d SCFTs. Needles in a haystack: An algorithmic approach to the classification of 4d. Download a PDF of the paper titled Needles in a haystack: An algorithmic approach to the classification of 4d $\mathcal=2$ SCFTs whose Schur indices satisfy aįourth-order untwisted modular differential equation. NEEDLES AND STRAW IN A HAYSTACK: POSTERIOR CONCENTRATION FOR POSSIBLY SPARSE SEQUENCES1 By Isma¨el Castillo and Aad van der Vaart Universit´es Paris VI
0 Comments
Leave a Reply. |