Searcharxiv⌕ Search

arXiv subjects

José Francisco Morales

Publications and source records attributed to José Francisco Morales.

4 recordsLinked to original sources

From the confluent Heun equation to a new factorized and resummed gravitational waveform for circularized, nonspinning, compact binaries

We introduce a new factorized and resummed waveform for circularized, nonspinning, compact binaries that leverages on the solution of the Teukolsky equation once mapped into a confluent Heun equation. The structure of the solution allows one to identify new resummed factors that completely absorb all test-mass logarithms and transcendental numbers via exponentials and $Γ$-functions at any post-Newtonian (PN) order. The corresponding residual relativistic and phase corrections are thus polynomial with rational coefficients, that are in fact PN-truncated hypergeometric functions. Our approach complements the recent proposal of Ivanov et al. [Phys. Rev. Lett. 135 (2025) 14, 141401], notably recovering the corresponding renormalization group scaling of multipole moments from first principles and fixing the scaling constant. In the test mass limit, our approach (pushed up to 10PN) yields waveforms and fluxes that are globally more accurate than those obtained using the standard factorized approach of Damour et al. [Phys. Rev. D 79 (2009), 064004]. The method generalizes straightforwardly to comparable mass binaries implementing the new concept of universal anomalous dimension of multipole moments and might be eventually useful to improve current state of the art effective-one-body waveform models for coalescing binaries.

gr-qc↗

Resumming Post-Minkowskian and Post-Newtonian gravitational waveform expansions

We derive formulae that resum, at a given order in the soft limit, the infinite series of Post-Minkowskian (small gravitational coupling) or Post-Newtonian (small velocities) corrections to the gravitational waveform produced by particles moving along a general (open or closed) trajectory in the Schwarzschild geometry in the probe limit. Specifying to the case of circular orbits, we compute the waveform and the energy flux to order 30PN, and compare it against the available results in the literature. Our results are based on a novel hypergeometric representation of the solutions of the Heun equation (and its confluence), that leads to a simple mathematical proof of the Heun connection formula.

gr-qc↗

OPE coefficients in Argyres-Douglas theories

The calculation of physical quantities in certain quantum field theories such as those of the Argyres-Douglas type is notoriously hard, due to the lack of a Lagrangian description. Here we tackle this problem following two alternative approaches. On the one hand, we use localization on the four-sphere to compute two-correlators and OPE coefficients in Argyres-Douglas superconformal theories. On the other hand, we use the conformal bootstrap machinery to put stringent bounds on such coefficients, only relying on the knowledge of central charge and conformal dimension of the operators. We compare the results obtained with these two methods and find good agreement for all rank-one cases and for the rank-two Argyres-Douglas theories (A_1,A_4) and (A_1,A_5), in the moduli space of pure SU(5) and SU(6) super Yang-Mills. We also apply our results from localization to obtain bounds on the dimensions of the lightest neutral unprotected operators of the CFTs.

hep-th↗

Theory and Practice of Finding Eviction Sets

Many micro-architectural attacks rely on the capability of an attacker to efficiently find small eviction sets: groups of virtual addresses that map to the same cache set. This capability has become a decisive primitive for cache side-channel, rowhammer, and speculative execution attacks. Despite their importance, algorithms for finding small eviction sets have not been systematically studied in the literature. In this paper, we perform such a systematic study. We begin by formalizing the problem and analyzing the probability that a set of random virtual addresses is an eviction set. We then present novel algorithms, based on ideas from threshold group testing, that reduce random eviction sets to their minimal core in linear time, improving over the quadratic state-of-the-art. We complement the theoretical analysis of our algorithms with a rigorous empirical evaluation in which we identify and isolate factors that affect their reliability in practice, such as adaptive cache replacement strategies and TLB thrashing. Our results indicate that our algorithms enable finding small eviction sets much faster than before, and under conditions where this was previously deemed impractical.

cs.CR↗