Related papers: Constructing the covariant three-point vertices sy…
The soft and collinear singularities of general scalar and tensor one-loop N-point integrals are worked out explicitly. As a result a simple explicit formula is given that expresses the singular part in terms of 3-point integrals. Apart…
This paper proposes new derivations of three well-known sorting algorithms, in their functional formulation. The approach we use is based on three main ingredients: first, the algorithms are derived from a simpler algorithm, i.e. the…
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the…
The paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in…
In this work, we develop a fully implicit Hybrid High-Order algorithm for the Cahn-Hilliard problem in mixed form. The space discretization hinges on local reconstruction operators from hybrid polynomial unknowns at elements and faces. The…
Khuri-Treiman equations have proven to be a useful theoretical tool in the analysis of 3-body decays, specially into the $3\pi$ final state. In this work we present in full detail the necessary generalization of the formalism to study the…
Group convolutions and cross-correlations, which are equivariant to the actions of group elements, are commonly used in mathematics to analyze or take advantage of symmetries inherent in a given problem setting. Here, we provide efficient…
We show how to use the Bern-Kosower master formula, originally a generating functional for on-shell gluon matrix elements, to derive well-organized form factor decompositions of the off-shell one-particle-irreducible N - gluon vertices. Two…
We suggest an efficient scheme for quantum computation with linear optical elements utilizing "linked" photon states. The linked states are designed according to the particular quantum circuit one wishes to process. Once a linked-state has…
We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie…
We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an…
We study point particles in 2+1 dimensional first order gravity using a triangulation to fix the connection and frame-field. The Hamiltonian is reduced to a boundary term which yields the total mass. The triangulation is dynamical with…
We introduce a new Partition of Unity Method for the numerical homogenization of elliptic partial differential equations with arbitrarily rough coefficients. We do not restrict to a particular ansatz space or the existence of a finite…
We present a neural network architecture that is fully equivariant with respect to transformations under the Lorentz group, a fundamental symmetry of space and time in physics. The architecture is based on the theory of the…
The venerable 2D point-vortex model plays an important role as a simplified version of many disparate physical systems, including superfluids, Bose-Einstein condensates, certain plasma configurations, and inviscid turbulence. This system is…
A covariant formulation for the Newton-Hooke particle is presented by following an algorithm developed by us \cite{BMM1, BMM2, BMM3}. It naturally leads to a coupling with the Newton-Cartan geometry. From this result we provide an…
We compute the local intersection cohomology of the irreducible components of varieties of complexes, by using Lusztig's geometric approach to quantum groups and explicit constructions of elements of Lusztig's canonical bases.
This paper presents a novel method for the reconstruction of interaction vertices in particle collision data. The algorithm is an agglomerative clustering technique designed for high-luminosity environments in current and future…
Structured optimization uses a prescribed set of atoms to assemble a solution that fits a model to data. Polarity, which extends the familiar notion of orthogonality from linear sets to general convex sets, plays a special role in a simple…
The Hodge decomposition provides a very powerful mathematical method for the analysis of 2D and 3D vector fields. It states roughly that any vector field can be $L^2$-orthogonally decomposed into a curl-free, divergence-free, and a harmonic…