Related papers: Constructing the covariant three-point vertices sy…
An efficient algorithm is developed for compactly weaving all the Lorentz covariant three-point vertices in relation to the decay of a massive particle $X$ of mass $m_X$ and spin $J$ into two particles $ M_{1,2}$ with equal mass $m$ and…
We present a systematic technique for constructing Lorentz covariant orbital-spin ($LS$) bases for matrix elements of local operators and the associated form factors, thereby extending the traditional multipole expansion to a Lorentz…
We present efficient algorithms to calculate trajectories for periodic Lorentz gases consisting of square lattices of circular obstacles in two dimensions, and simple cubic lattices of spheres in three dimensions; these become increasingly…
We have worked out covariant amplitudes for any two-body decay of a resonance with an arbitrary non-zero mass, which involves arbitrary integer spins in the initial and the final states. One key new ingredient for this work is the…
We present a systematic technique for constructing the Lorentz-covariant structures of hadronic matrix elements of local operators. The spinor Young tableaux of the Lorentz group is employed to construct all possible structures for the…
The distribution engendered by successive splitting of one point vortex are considered. The process of splitting a vortex in three using a reverse three-point vortex collapse course is analysed in great details and shown to be dissipative.…
The well-known Landau-Yang (LY) theorem on the decay of a neutral particle into two photons is generalized for analyzing the decay of a neutral or charged particle into two identical massless particles of any spin. Selection rules…
In this paper, the Lorentz covariance of algorithms is introduced. Under Lorentz transformation, both the form and performance of a Lorentz covariant algorithm are invariant. To acquire the advantages of symplectic algorithms and Lorentz…
We describe an algorithm that, given a k-tuple of permutations representing the monodromy of a rational map, constructs an arbitrarily precise floating-point complex approximation of that map. We then explain how it has been used to study a…
Particle physics experiments often require the simultaneous reconstruction of many interaction vertices. Usually, this problem is solved by ad hoc heuristic algorithms. We propose a universal approach to address the multiple vertex finding…
We show how to construct embedding space three-point functions for operators in arbitrary Lorentz representations by employing the formalism developed in arXiv:1905.00036 and arXiv:1905.00434. We study tensor structures that intertwine the…
By the method of discrete transformation equations of 3-th wave hierarchy are constructed. We present in explicit form two Poisson structures, which allow to construct Hamiltonian operator consequent application of which leads to all…
Analytical formulas for some useful three-particles integrals are derived. Many of these integrals include Bessel and/or trigonometric functions of one and two interparticle (relative) coordinates $r_{32}, r_{31}$ and $r_{21}$. The formulas…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
Lorentz invariant structure-preserving algorithms possess reference-independent secular stability, which is vital for simulating relativistic multi-scale dynamical processes. The splitting method has been widely used to construct…
We compute the distance-dependent three-point function of general planar maps and of bipartite planar maps, i.e., the generating function of these maps with three marked vertices at prescribed pairwise distances. Explicit expressions are…
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
Designing the topology of three-dimensional structures is a challenging problem due to its memory and time consumption. In this paper, we present a robust and efficient algorithm for solving large-scale 3D topology optimization problems.…
A manifestly relativistic-invariant Lellouch-L\"uscher formalism for the three-particle decays is proposed. Similarly to ref.[1], the formalism is based on the use of the non-relativistic effective Lagrangians. Manifest Lorentz invariance…
We propose a randomized algorithm for enumerating the vertices of a zonotope, which is a low-dimensional linear projection of a hypercube. The algorithm produces a pair of the zonotope's vertices by sampling a random linear combination of…