Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userApproximating higher-order nonlinear QED processes with first-order building blocks
99
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Higher-order tree-level processes in strong laser fields, i.e. cascades, are in general extremely difficult to calculate, but in some regimes the dominant contribution comes from a sequence of first-order processes, i.e. nonlinear Compton scattering and nonlinear Breit-Wheeler pair production. At high intensity the field can be treated as locally constant, which is the basis for standard particle-in-cell codes. However, the locally-constant-field (LCF) approximation and these particle-in-cell codes cannot be used when the intensity is only moderately high, which is a regime that is experimentally relevant. We have shown that one can still use a sequence of first-order processes to estimate higher orders at moderate intensities provided the field is sufficiently long. An important aspect of our new gluing approach is the role of the spin/polarization of intermediate particles, which is more nontrivial compared to the LCF regime.
rate research
Read More
We calculate higher-order quantum contributions in different Lorentz-violating parameters to the gauge sector of the extended QED. As a result of this one-loop calculation, some terms which do not produce first-order corrections, contribute with nontrivial gauge-invariant second-order quantum inductions.
Classical Processes (CP) is a calculus where the proof theory of classical linear logic types communicating processes with mobile channels, a la pi-calculus. Its construction builds on a recent propositions as types correspondence between session types and propositions in linear logic. Desirable properties such as type preservation under reductions and progress come for free from the metatheory of linear logic. We contribute to this research line by extending CP with code mobility. We generalise classical linear logic to capture higher-order (linear) reasoning on proofs, which yields a logical reconstruction of (a variant of) the Higher-Order pi-calculus (HOpi). The resulting calculus is called Classical Higher-Order Processes (CHOP). We explore the metatheory of CHOP, proving that its semantics enjoys type preservation and progress (terms do not get stuck). We also illustrate the expressivity of CHOP through examples, derivable syntax sugar, and an extension to multiparty sessions. Lastly, we define a translation from CHOP to CP, which encodes mobility of process code into reference passing.
Parameterization extends higher-order processes with the capability of abstraction and application (like those in lambda-calculus). This extension is strict, i.e., higher-order processes equipped with parameterization is computationally more powerful. This paper studies higher-order processes with two kinds of parameterization: one on names and the other on processes themselves. We present two results. One is that in presence of parameterization, higher-order processes can encode first-order (name-passing) processes in a quite neat fashion, in contrast to the fact that higher-order processes without parameterization cannot encode first-order processes at all. In the other result, we provide a simpler characterization of the (standard) context bisimulation for higher-order processes with parameterization, in terms of the normal bisimulation that stems from the well-known normal characterization for higher-order calculus. These two results demonstrate more essence of the parameterization method in the higher-order paradigm toward expressiveness and behavioural equivalence.
Higher order interactions are increasingly recognised as a fundamental aspect of complex systems ranging from the brain to social contact networks. Hypergraph as well as simplicial complexes capture the higher-order interactions of complex systems and allow to investigate the relation between their higher-order structure and their function. Here we establish a general framework for assessing hypergraph robustness and we characterize the critical properties of simple and higher-order percolation processes. This general framework builds on the formulation of the random multiplex hypergraph ensemble where each layer is characterized by hyperedges of given cardinality. We reveal the relation between higher-order percolation processes in random multiplex hypergraphs, interdependent percolation of multiplex networks and K-core percolation. The structural correlations of the random multiplex hypergraphs are shown to have a significant effect on their percolation properties. The wide range of critical behaviors observed for higher-order percolation processes on multiplex hypergraphs elucidates the mechanisms responsible for the emergence of discontinuous transition and uncovers interesting critical properties which can be applied to the study of epidemic spreading and contagion processes on higher-order networks.
We compute the inclusive jet spectrum in the presence of a dense QCD medium by going beyond the single parton energy loss approximation. We show that higher-order corrections are important yielding large logarithmic contributions that must be resummed to all orders. This reflects the fact that jet quenching is sensitive to fluctuations of the jet substructure.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
