Related papers: Contour calculus for many-particle functions
The recursion method, which solves coupled Heisenberg equations in a Lanczos operator basis, has recently emerged as a powerful nonperturbative tool for computing dynamical correlation functions in strongly correlated two- and…
We introduce a novel approach addressing global analysis of a difficult class of nonconvex-nonsmooth optimization problems within the important framework of Lagrangian-based methods. This genuine nonlinear class captures many problems in…
This paper describes perturbative framework, on the basis of closed-time-path formalism, for studying quasiuniform relativistic quantum field systems near equilibrium and nonequilibrium quasistationary systems. At the first part, starting…
Certain many-particle Hardy inequalities are derived in a simple and systematic way using the so-called ground state representation for the Laplacian on a subdomain of $\mathbb{R}^n$. This includes geometric extensions of the standard Hardy…
Nonequilibrium quantum mechanics can be solved with the Keldysh formalism, which evolves the quantum mechanical states forward in time in the presence of a time-dependent field, and then evolves them backward in time, undoing the effect of…
Generalizing response theory of open systems far from equilibrium is a central quest of nonequilibrium statistical physics. Using stochastic thermodynamics, we develop an algebraic method to study the response of nonequilibrium steady state…
We extend the recent spectral approach for quenched limit theorems developed for piecewise expanding dynamics under general random driving [DrFrGTVa18] to quenched random piecewise hyperbolic dynamics including some classes of billiards.…
The method of the real time perturbative calculations of nonequilibrium averages is generalised to the case of varying chemical potential. Calculations are performed in the frame of Zubarev's nonequilibrium density matrix approach. In this…
This paper is motivated by the introduction of a new functional setting of General Relativity (GR) based on the adoption of suitable group non-local point transformations (NLPT). Unlike the customary local point transformatyion usually…
The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge…
Discontinuous visibility changes remain a major bottleneck when optimizing surfaces within a physically-based inverse renderer. Many previous works have proposed sophisticated algorithms and data structures to sample visibility silhouettes…
In the standard sequent presentations of Girard's Linear Logic (LL), there are two "non-decreasing" rules, where the premises are not smaller than the conclusion, namely the cut and the contraction rules. It is a universal concern to…
The fundamental problem of calculus of variations is considered when solutions are differentiable curves on locally convex spaces. Such problems admit an extension of the Euler-Lagrange equations [Orlov 2002] for continuously normally…
The problem of derivation of the equations of motion from the field equations is considered. Einstein's field equations have a specific analytical form: They are linear in the second order derivatives and quadratic in the first order…
An underlying fundamental assumption in relativistic perturbation theory is the existence of a parametric family of spacetimes that can be Taylor expanded around a background. Since the choice of the latter is crucial, sometimes it is…
Roundoff error problems have occurred frequently in interpolation methods of time-fractional equations, which can lead to undesirable results such as the failure of optimal convergence. These problems are essentially caused by catastrophic…
New invariants for 2-dimensional cell complexes are defined, which can be interpreted as curvature bounds. These invariants are proved to be rational and computable in a companion article. This document is a survey that collects theorems…
In this paper we initiate the study of the computational complexity of learning linear temporal logic (LTL) formulas from examples. We construct approximation algorithms for fragments of LTL and prove hardness results; in particular we…
We present a general prescription for the holographic computation of real-time n-point functions in non-trivial states. In QFT such real-time computations involve a choice of a time contour in the complex time plane. The holographic…
In optimal transport, quadratic regularization is an alternative to entropic regularization when sparse couplings or small regularization parameters are desired. Quadratic regularization penalizes transport couplings by the squared $L^2$…