Decomposition of Feynman integrals by multivariate intersection numbers

We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master integrals, employing multivariate intersection numbers. We discuss a recursive algorithm for the computation of multivariate intersection numbers, and provide three different approaches for a direct decomposition of Feynman integrals, which we dub thestraight decomposition, thebottom-up decomposition, and thetop-down decomposition. These algorithms exploit the unitarity structure of Feynman integrals by computing intersection numbers supported on cuts, in various orders, thus showing the synthesis of the intersection-theory concepts with unitarity-based methods and integrand decomposition. We perform explicit computations to exemplify all of these approaches applied to Feynman integrals, paving a way towards potential applications to generic multi-loop integrals.

Recapturing the Structure of Group of Units of Any Finite Commutative Chain Ring

A finite ring with an identity whose lattice of ideals forms a unique chain is called a finite chain ring. Let R be a commutative chain ring with invariants p,n,r,k,m. It is known that R is an Eisenstein extension of degree k of a Galois ring S=GR(pn,r). If p−1 does not divide k, the structure of the unit group U(R) is known. The case (p−1)∣k was partially considered by M. Luis (1991) by providing counterexamples demonstrated that the results of Ayoub failed to capture the direct decomposition of U(R). In this article, we manage to determine the structure of U(R) when (p−1)∣k by fixing Ayoub’s approach. We also sharpen our results by introducing a system of generators for the unit group and enumerating the generators of the same order.

NO direct decomposition: Progresses, challenges and opportunities

NO direct decomposition is deemed as the ideal technology to diminish NO from exhaust waste owing to its cost-effectiveness and eco-friendliness characteristics. However, its wide application is seriously impeded by...

Au-modified Pd catalyst exhibits improved activity and stability for NO direct decomposition

The direct decomposition of NOx at moderate temperatures is a challenge because of the poisoning of the surface of noble metals by oxygen, yet the modification of Pd with Au...

Metabelian groups: Full-rank presentations, randomness and Diophantine problems

We study metabelian groups 𝐺 given by full rank finite presentations \langle A\mid R\rangle_{\mathcal{M}} in the variety ℳ of metabelian groups. We prove that 𝐺 is a product of a free metabelian subgroup of rank \max\{0,\lvert A\rvert-\lvert R\rvert\} and a virtually abelian normal subgroup, and that if \lvert R\rvert\leq\lvert A\rvert-2, then the Diophantine problem of 𝐺 is undecidable, while it is decidable if \lvert R\rvert\geq\lvert A\rvert. We further prove that if \lvert R\rvert\leq\lvert A\rvert-1, then, in any direct decomposition of 𝐺, all factors, except one, are virtually abelian. Since finite presentations have full rank asymptotically almost surely, metabelian groups finitely presented in the variety of metabelian groups satisfy all the aforementioned properties asymptotically almost surely.