skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Eccentric-orbit extreme-mass-ratio-inspiral radiation: Analytic forms of leading-logarithm and subleading-logarithm flux terms at high PN orders
Award ID(s):
1806447
PAR ID:
10159688
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Physical Review D
Volume:
100
Issue:
10
ISSN:
2470-0010
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. The continual production of long wavelength gravitons during primordial inflation endows graviton loop corrections with secular growth factors. During a prolonged period of inflation, these factors eventually overwhelm the small loop-counting parameter of GH2, causing perturbation theory to break down. A technique was recently developed for summing the leading secular effects at each order in non-linear sigma models, which possess the same kind of derivative interactions as gravity. This technique combines a variant of Starobinsky’s stochastic formalism with a variant of the renormalization group. Generalizing the technique to quantum gravity is a two-step process, the first of which is the determination of the gauge fixing condition that will allow this summation to be realized; this is the subject of this paper. Moreover, we briefly discuss the second step, which shall obtain the Langevin equation, in which secular changes in gravitational phenomena are driven by stochastic fluctuations of the graviton field. 
    more » « less
  2. null (Ed.)
  3. null (Ed.)
    We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorization of RSA-768 in 2009 and a 768-bit discrete logarithm computation in 2016. Our two computations at the 795-bit level were done using the same hardware and software, and show that computing a discrete logarithm is not much harder than a factorization of the same size. Moreover, thanks to algorithmic variants and well-chosen parameters, our computations were significantly less expensive than anticipated based on previous records. 
    more » « less