Related papers: A recursive approach to determine correlation func…
We compute the correlation functions mixing the powers of two non-commuting random matrices within the same trace. The angular part of the integration was partially known in the literature: we pursue the calculation and carry out the…
We present a simple and consistent way to compute correlation functions in interacting theories with non-trivial phase diagram. As an example we show how to consistently compute the four-point function in three dimensional…
In this article I study pairing of two interacting particles in ideal 1D, 2D and Bethe lattices. I employ the method of recursion that has been formulated recently by Berciu et. al. to compute the pair functions in real space without…
A method for the calculation of translationally invariant wave functions for systems of identical fermions with arbitrary potential of pair interaction is developed. It is based on the well-known result that the essential dynamic part of…
An integrable system is often formulated as a flat connection, satisfying a Lax equation. It is given in terms of compatible systems having a common solution called the ``wave function" $\Psi$ living in a Lie group $G$, which satisfies some…
The contributions to the coefficient functions of the quark and the mixed quark-gluon condensate to mesonic correlators are calculated for the first time to all orders in the quark masses, and to lowest order in the strong coupling…
In this paper we present a recurrent relation for counting meaningful compositions of the higher-order differential operations on the space $R^{n}$ (n=3,4,...) and extract the non-trivial compositions of order higher than two.
In this work we propose a novel composite method for accurate calculation of the energies of many-electron atoms. The dominant contribution to the energy (pair energies) are calculated by using explicitly correlated factorisable coupled…
Under consideration are multicomponent minimization problems involving a separable nonsmooth convex function penalizing the components individually, and nonsmooth convex coupling terms penalizing linear mixtures of the components. We…
A recursion operator is an integro-differential operator which maps a generalized symmetry of a nonlinear PDE to a new symmetry. Therefore, the existence of a recursion operator guarantees that the PDE has infinitely many higher-order…
In the spirit of the Head-Gordon-Pople algorithm, we report vertical, transfer and horizontal recurrence relations for the efficient and accurate computation of four-electron integrals over Gaussian basis functions. Our recursive approach…
We calculate connected correlators in Gaussian orthogonal, unitary and symplectic random matrix ensembles by the replica method in the 1/N-expansion. We obtain averaged one-point Green's functions up to the next-to-leading order O(1/N) and…
The paper develops an optimal regulator for a general class of multi-input affine nonlinear systems minimizing a nonlinear cost functional with infinite horizon. The cost functional is general enough to enforce saturation limits on the…
In order to meet the precision requirements for the LHC and future colliders, next-to-next-to-leading order corrections to a wide range of processes are essential, making general automated tools highly desirable. Extending the strategy of…
Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained…
The momentum correlation functions of baryon pairs, which reflects the baryon-baryon interaction at low energies, are investigated for multi-strangeness pairs ($\Omega\Omega$ and $N\Omega$) produced in relativistic heavy-ion collisions. We…
The formulae for correlators K2 and K3 of a given particle observable (e.g. energy or transverse momentum) accounting for the track reconstruction efficiency are presented. Similar to the case of an ideal detector, the correlators can be…
We explore the robustness of the correlation matrix Hamiltonian reconstruction technique with respect to the choice of operator basis, studying the effects of bases that are undercomplete and over-complete -- too few or too many operators…
The evaluation of partition functions is a central problem in statistical physics. For lattice systems and other discrete models the partition function may be expressed as the contraction of a tensor network. Unfortunately computing such…
We present a new algorithm to rapidly compute the two-point (2PCF), three-point (3PCF) and n-point (n-PCF) correlation functions in roughly O(N log N) time for N particles, instead of O(N^n) as required by brute force approaches. The…