Related papers: A Diagrammatic Equation for Oriented Planar Graphs
We demonstrate a method which allows the stochastic modelling of quantum systems for which the generalised Fokker-Planck equation in the phase space contains derivatives of higher than second order. This generalises quantum stochastics far…
A general method to derive the diagonal representation for a generic matrix valued quantum Hamiltonian is proposed. In this approach new mathematical objects like non-commuting operators evolving with the Planck constant promoted as a…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
We consider some general aspects of the new noncommutative or quantum geometry coming out of the theory of quantum groups, in connection with Planck scale physics. A generalisation of Fourier or wave-particle duality on curved spaces…
We investigate a generic problem of learning pairwise exponential family graphical models with pairwise sufficient statistics defined by a global mapping function, e.g., Mercer kernels. This subclass of pairwise graphical models allow us to…
Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by…
This paper describes perturbative framework, on the basis of the closed-time-path formalism, in terms of quasiparticle picture for studying quasiuniform relativistic quantum field systems near equilibrium and nonequilibrium quasistationary…
We study sample covariance matrices arising from rectangular random matrices with i.i.d. columns. It was previously known that the resolvent of these matrices admits a deterministic equivalent when the spectral parameter stays bounded away…
The form factor of a quantum graph is a function measuring correlations within the spectrum of the graph. It can be expressed as a double sum over the periodic orbits on the graph. We propose a scheme which allows one to evaluate the…
In this paper we study polynomial maps of vector spaces and their eigenvectors and eigenvalues. The new quantity called complanart is defined. Complanarts determine complanarity of solution vectors of systems of polynomial equations.…
A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…
We compute spectra of large stochastic matrices $W$, defined on sparse random graphs, where edges $(i,j)$ of the graph are given positive random weights $W_{ij}>0$ in such a fashion that column sums are normalized to one. We compute spectra…
The object of the paper is to find complete systems of inequalities relating the perimeter $P$, the area $|\cdot|$ and the Cheeger constant $h$ of planar sets. To do so, we study the so called Blaschke--Santal\'o diagram of the triplet…
In this article, firstly we develop a method for a type of difference equations, applicable to solve approximately a class of first order ordinary differential equation systems. In a second step, we apply the results obtained to solve a…
We present an algorithm that takes as input an $n$-vertex planar graph $G$ and a $k$-vertex pattern graph $P$, and computes the number of (induced) copies of $P$ in $G$ in $2^{O(k/\log k)}n^{O(1)}$ time. If $P$ is a matching, independent…
We construct models of exactly solvable two-particle quantum graphs with certain non-local two-particle interactions, establishing appropriate boundary conditions via suitable self-adjoint realisations of the two-particle Laplacian. Showing…
We seek solutions $u\in\R^n$ to the semilinear elliptic partial difference equation $-Lu + f_s(u) = 0$, where $L$ is the matrix corresponding to the Laplacian operator on a graph $G$ and $f_s$ is a one-parameter family of nonlinear…
The Einstein equations for a plane-symmetric gravitational field coupled to an arbitrary nonlinear sigma model (NSM) are shown to be represented in the form of dynamical equations of a {\it generalized effective NSM}. The gravitational…
We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be…
Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the…