Related papers: An Exact Formulation of the Time-Ordered Exponenti…
The time-ordered exponential representation of a complex time evolution operator in the interaction picture is studied. Using the complex time evolution, we prove the Gell-Mann -- Low formula under certain abstract conditions, in…
The Cut & Count technique and the rank-based approach have lead to single-exponential FPT algorithms parameterized by treewidth, that is, running in time $2^{O(tw)}n^{O(1)}$, for Feedback Vertex Set and connected versions of the classical…
Of primary interest in this paper is the numerical approximation of a time dependent fractional, in space, diffusion equation where the domain is assumed to be nonhomogeneous, having different axial diffusion coefficients. This work is…
Lie-Trotter-Suzuki decompositions are an efficient way to approximate operator exponentials $\exp(t H)$ when $H$ is a sum of $n$ (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution…
In the PATH COVER problem, one asks to cover the vertices of a graph using the smallest possible number of (not necessarily disjoint) paths. While the variant where the paths need to be pairwise vertex-disjoint, which we call PATH…
In the present paper, a discrete version of It\^o's formula for a class of multi-dimensional random walk is introduced and applied to the study of a discrete-time complete market model which we call He's framework. The formula unifies…
Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems with lengths, distances…
A large number of NP-hard graph problems can be solved in $f(w)n^{O(1)}$ time and space when the input graph is provided together with a tree decomposition of width $w$, in many cases with a modest exponential dependence $f(w)$ on $w$.…
We analyze the quantum-mechanical behavior of a system described by a one-dimensional asymmetric potential constituted by a step plus (i) a linear barrier or (ii) an exponential barrier. We solve the energy eigenvalue equation by means of…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
In the Disjoint Paths problem, the input is an undirected graph $G$ on $n$ vertices and a set of $k$ vertex pairs, $\{s_i,t_i\}_{i=1}^k$, and the task is to find $k$ pairwise vertex-disjoint paths connecting $s_i$ to $t_i$. The problem was…
A new representation of the exact time dependent solution of the discrete master equation is derived. This representation can be considered as contraction of the path integral solution of Haken. It allows the calculation of the probability…
We give a novel spectral approximation algorithm for the balanced separator problem that, given a graph G, a constant balance b \in (0,1/2], and a parameter \gamma, either finds an \Omega(b)-balanced cut of conductance O(\sqrt(\gamma)) in…
We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
The concept of NP-completeness has been proposed for half a century, and it is conjectured that there are no subexponential-time algorithms for NP-hard problems, which is known as the Exponential Time Hypothesis (ETH). As a pivotal…
We derive an explicit formula for the fundamental solution $K_{T_{q+1}}(x,x_{0};t)$ to the discrete-time diffusion equation on the $(q+1)$-regular tree $T_{q+1}$ in terms of the discrete $I$-Bessel function. We then use the formula to…
Under the Strong Exponential Time Hypothesis, an integer linear program with $n$ Boolean-valued variables and $m$ equations cannot be solved in $c^n$ time for any constant $c < 2$. If the domain of the variables is relaxed to $[0,1]$, the…
We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is…
The Operator Product Expansion provides expressions for the $n^{th}$ moments of $g_1(x)$ and $g_2(x)$ in terms of hadronic matrix elements of local operators for $n =$ odd integer. In some cases these matrix elements are expected to be…