Tootfinder

This https://arxiv.org/abs/2409.17464 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_grqc_…

Computation of $\langle Φ^2\rangle$ and quantum fluxes at the polar interior of a spinning black hole
Renormalization of physical quantities for quantum field theories in curved spacetimes can be achieved via the consistent subtraction of counterterms within a regularization scheme such as a point-splitting method. Pragmatic mode-sum regularization (PMR) is a point-splitting method which is particularly suitable for rotating black hole spacetimes. We extend and tailor the t-splitting variant of PMR specifically for the interior of a Kerr black hole on the axis of rotation, focusing on a minimal…

The $\mathcal{W}$-algebra bootstrap of 6d $\mathcal{N}=(2,0)$ theories
Mitchell Woolley
https://arxiv.org/abs/2506.08094 https://arxi…

The $\mathcal{W}$-algebra bootstrap of 6d $\mathcal{N}=(2,0)$ theories
6d (2,0) SCFTs of type $\mathfrak{g}$ have protected subsectors that were conjectured in arxiv:1404.1079 to be captured by $\mathcal{W}_\mathfrak{g}$ algebras. We write down the crossing equations for mixed four-point functions $\langle S_{k_1} S_{k_2}S_{k_3}S_{k_4}\rangle$ of 1/2-BPS operators $S_{k_i}$ in 6d (2,0) theories and detail how a certain twist reduces this system to a 2d meromorphic CFT multi-correlator bootstrap problem. We identify the relevant 6d (2,0) $\mathcal{W}$-algebras of t…

Efficient and Reuseable Cloud Configuration Search Using Discovery Spaces
Michael Johnston, Burkhard Ringlein, Christoph Hagleitner, Alessandro Pomponio, Vassilis Vassiliadis, Christian Pinto, Srikumar Venugopal
https://arxiv.org/abs/2506.21467

Efficient and Reuseable Cloud Configuration Search Using Discovery Spaces
Finding the optimal set of cloud resources to deploy a given workload at minimal cost while meeting a defined service level agreement is an active area of research. Combining tens of parameters applicable across a large selection of compute, storage, and services offered by cloud providers with similar numbers of application-specific parameters leads to configuration spaces with millions of deployment options. In this paper, we propose Discovery Space, an abstraction that formalizes the descr…

From Model to Classroom: Evaluating Generated MCQs for Portuguese with Narrative and Difficulty Concerns
Bernardo Leite, Henrique Lopes Cardoso, Pedro Pinto, Abel Ferreira, Lu\'is Abreu, Isabel Rangel, Sandra Monteiro
https://arxiv.org/abs/2506.15598

From Model to Classroom: Evaluating Generated MCQs for Portuguese with Narrative and Difficulty Concerns
While MCQs are valuable for learning and evaluation, manually creating them with varying difficulty levels and targeted reading skills remains a time-consuming and costly task. Recent advances in generative AI provide an opportunity to automate MCQ generation efficiently. However, assessing the actual quality and reliability of generated MCQs has received limited attention -- particularly regarding cases where generation fails. This aspect becomes particularly important when the generated MCQs …

Automata on $S$-adic words
Val\'erie Berth\'e, Toghrul Karimov, Mihir Vahanwala
https://arxiv.org/abs/2506.17460 https://arxi…

Automata on $S$-adic words
A fundamental question in logic and verification is the following: for which unary predicates $P_1, \ldots, P_k$ is the monadic second-order theory of $\langle \mathbb{N}; <, P_1, \ldots, P_k \rangle$ decidable? Equivalently, for which infinite words $α$ can we decide whether a given Büchi automaton $A$ accepts $α$? Carton and Thomas showed decidability in case $α$ is a fixed point of a letter-to-word substitution $σ$, i.e., $σ(α) = α$. However, abundantly more words, e.g., Sturmian wor…