Concept

Steven Weinberg (physicien)

Publications associées (4)

Universality of loop corrected soft theorems in 4d

In [1], logarithmic correction to subleading soft photon and soft graviton theorems have been derived in four spacetime dimensions from the ratio of IR-finite S-matrices. This has been achieved after factoring out IR-divergent components from the tradition ...

New York2023

Spin-dependent gravitational tail memory in D=4

Biswajit Sahoo

We derive the leading spin-dependent gravitational tail memory, which appears at the second post-Minkowskian order and behaves as u(-2) for large retarded time u. This result follows from the classical soft graviton theorem at order omega In omega as a low ...

AMER PHYSICAL SOC2022

Floating Phase versus Chiral Transition in a 1D Hard-Boson Model

Frédéric Mila, Natalia Chepiga

We investigate the nature of the phase transition between the period-three charge-density wave and the disordered phase of a hard-boson model proposed in the context of cold-atom experiments. Building on a density-matrix renormalization group algorithm tha ...

2019

How to find neutral leptons of the nuMSM?

An extension of the Standard Model by three singlet fermions with masses smaller than the electroweak scale allows to explain simultaneously neutrino oscillations, dark matter and baryon asymmetry of the Universe. We discuss the properties of neutral lepto ...

2007

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search