Related papers: Multigraphs and Time Ordered Isserlis-Wick formula…
We present a simple way to produce good weights for several types of ergodic theorem including the Wiener-Wintner type multiple return time theorem and the multiple polynomial ergodic theorem. These weights are deterministic and come from…
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs…
Recently, Apers and Piddock [TQC '23] strengthened the connection between quantum walks and electrical networks via Kirchhoff's Law and Ohm's Law. In this work, we develop a new multidimensional electrical network by defining Alternative…
The integrand of any multi-loop integral is characterised after Feynman parametrisation by two polynomials. In this review we summarise the properties of these polynomials. Topics covered in this article include among others: Spanning trees…
A graphical model provides a compact and efficient representation of the association structure of a multivariate distribution by means of a graph. Relevant features of the distribution are represented by vertices, edges and other…
We present a method to compute real-time path integrals numerically, by Monte-Carlo sampling on near-Lefschetz thimbles. We present a collection of tools based on the Lefschetz thimble methods, which together provide an alternative to…
Formal structure of phase-space path integrals based on different types of operator orderings is analysed.
We derive a full Bern-Kosower-type rule for scalar QED starting from quantum field theory: we derive a set of rules for calculating $S$-matrix elements for any processes at any order of the coupling constant. Gauge-invariant set of diagrams…
We have developed a numerical approach to compute real-time path integral expressions for quantum transport problems out of equilibrium. The scheme is based on a deterministic iterative summation of the path integral (ISPI) for the…
The path integral quantization method is applied to a relativistically covariant version of the Hopfield model, which represents a very interesting mesoscopic framework for the description of the interaction between quantum light and…
Entwined space-time paths are bound pairs of trajectories which are traversed in opposite directions with respect to macroscopic time. In this paper we show that ensembles of entwined paths on a discrete space-time lattice are simply…
The spatially discretized magnetic vector potential formulation of magnetoquasistatic field problems is transformed from an infinitely stiff differential algebraic equation system into a finitely stiff ordinary differential equation (ODE)…
We prove that many aspects of the differential geometry of embedded Riemannian manifolds can be formulated in terms of multi linear algebraic structures on the space of smooth functions. In particular, we find algebraic expressions for…
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
We present the path-sum formulation for $\mathsf{OE}[\mathsf{H}](t',t)=\mathcal{T}\,\text{exp}\big(\int_{t}^{t'}\!\mathsf{H}(\tau)\,d\tau\big)$, the time-ordered exponential of a time-dependent matrix $\mathsf{H}(t)$. The path-sum…
Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…
Given a graph $G=(V,E)$, the longest induced path problem asks for a maximum cardinality node subset $W\subseteq V$ such that the graph induced by $W$ is a path. It is a long established problem with applications, e.g., in network analysis.…
In this paper, the $mn$-dimensional space of tensor-product polynomials of two variables, of degree at most $(m-1)+(n-1)$, is considered. A theory of two-variate polynomials is developed by establishing the algebra and basic algebraic…
We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel - by proving a $\#SAC^1$ upper bound. This is in stark contrast to #P-completeness of the same problem in general graphs. Our main…