Related papers: Tree expansion in time-dependent perturbation theo…
We propose a unified approach for different exponential perturbation techniques used in the treatment of time-dependent quantum mechanical problems, namely the Magnus expansion, the Floquet--Magnus expansion for periodic systems, the…
In the present work, a new time-dependent exchange theory is presented wherein the symmetry constraints, on a multi-electron wavefunction, are properly accounted for. In so doing, the equations of motion, incorporating the required…
An accurate theoretical description of structure formation at least in the mildly non-linear regime is essential for comparison with data from next generation galaxy surveys. In a recent approach one follows the time evolution of…
This paper deals with the recoverable robust spanning tree problem under interval uncertainty representations. A polynomial time, combinatorial algorithm for the recoverable spanning tree problem is first constructed. This problem…
We propose a randomized algorithm to compute the log-partition function of weakly interacting fermions with polynomial runtime in both the system size and precision. Although weakly interacting fermionic systems are considered tractable for…
Using the general argument in Borel resummation of perturbation theory that links the divergent perturbation theory to the nonperturbative effect we argue that the nonperturbative effect associated with the perturbation theory should have a…
We study quantum mechanical systems with a discrete spectrum. We show that the asymptotic series associated to certain paths of steepest-descent (Lefschetz thimbles) are Borel resummable to the full result. Using a geometrical approach…
I provide a straightforward proof that a simple harmonic oscillator perturbed by an (almost) arbitrary positive interaction has a perturbative expansion for any finite-time Euclidian transition amplitude which obeys the following result:…
This study addresses the predictive limitation of probabilistic circuits and introduces transformations as a remedy to overcome it. We demonstrate this limitation in robotic scenarios. We motivate that independent component analysis is a…
This paper demonstrates that a computer aided perturbation theory can easily be realized by use of a cumulant approach. In contrast to a recent alternative formulation on the basis of Wegner's flow equation method the present approach can…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
This paper considers the problem of invoking auxiliary, unobservable variables to facilitate the structuring of causal tree models for a given set of continuous variables. Paralleling the treatment of bi-valued variables in [Pearl 1986], we…
We present details and expand on the framework leading to the recently introduced degenerate adiabatic perturbation theory [Phys. Rev. Lett. 104, 170406 (2010)], and on the formulation of the degenerate adiabatic theorem, along with its…
In this thesis time-dependent configurations are studied in the formalism of first-quantized string. These configurations are exact: solutions of the corresponding two-dimensional conformal field theory can be found. We can compute…
In this paper, the time-varying formation and time-varying formation tracking problems are solved for linear multi-agent systems over digraphs without the knowledge of the eigenvalues of the Laplacian matrix associated to the digraph. The…
Adaptive perturbation is a new method for perturbatively computing the eigenvalues and eigenstates of quantum mechanical Hamiltonians that heretofore were not believed to be obtainable by such methods. The novel feature of adaptive…
The call-by-value lambda calculus can be endowed with permutation rules, arising from linear logic proof-nets, having the advantage of unblocking some redexes that otherwise get stuck during the reduction. We show that such an extension…
We provide a systematic formula, in terms of integer partitions, that generates perturbation theory explicitly at an arbitrary order. Our approach naturally includes an infinite number of perturbations and uses a single matrix equation that…
The question of the asymptotic form of the perturbation expansion in scalar field theories is reconsidered. Renewed interest in the computation of terms in the epsilon-expansion, used to calculate critical exponents, has been frustrated by…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…