Related papers: A Diagrammatic Equation for Oriented Planar Graphs
We consider exact and asymptotic solutions of the stationary cubic nonlinear Schr\"odinger equation (NLSE) on metric graphs. We focus on some basic example graphs. The asymptotic solutions are obtained using the canonical perturbation…
We establish sharp pointwise kernel estimates and dispersive properties for the wave equation on noncompact symmetric spaces of general rank. This is achieved by combining the stationary phase method and the Hadamard parametrix, and in…
We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…
We first study the linear eigenvalue problem for a planar Dirac system in the open half-line and describe the nodal properties of its solution by means of the rotation number. We then give a global bifurcation result for a planar nonlinear…
In the k-Apex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor closed class of graphs, hence by the deep results of Robertson and Seymour,…
We propose an alternative variational principle whose critical point is the algebraic plane curve associated to a matrix model (the spectral curve, i.e. the large $N$ limit of the resolvent). More generally, we consider a variational…
In this paper, we address a class of specially structured problems that include speed planning, for mobile robots and robotic manipulators, and dynamic programming. We develop two new numerical procedures, that apply to the general case and…
We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…
We develop a novel, fundamental and surprisingly simple randomized iterative method for solving consistent linear systems. Our method has six different but equivalent interpretations: sketch-and-project, constrain-and-approximate, random…
We show that in $\text{O}(D)$ invariant matrix theories containing a large number $D$ of complex or Hermitian matrices, one can define a $D\rightarrow\infty$ limit for which the sum over planar diagrams truncates to a tractable, yet…
We study fermionic one-matrix, two-matrix and $D$-dimensional gauge invariant matrix models. In all cases we derive loop equations which unambiguously determine the large-$N$ solution. For the one-matrix case the solution is obtained for an…
We introduce a dbar-formulation of the orthogonal polynomials on the complex plane, and hence of the related normal matrix model, which is expected to play the same role as the Riemann-Hilbert formalism in the theory of orthogonal…
In this paper, we present numerical procedures to compute solutions of partial differential equations posed on fractals. In particular, we consider the strong form of the equation using standard graph Laplacian matrices and also weak forms…
In this paper we present a general framework for solving the stationary nonlinear Schr\"odinger equation (NLSE) on a network of one-dimensional wires modelled by a metric graph with suitable matching conditions at the vertices. A formal…
The elliptic-matrix quantum Olshanetsky-Perelomov problem is introduced for arbitrary root systems by means of an elliptic generalization of the Dunkl operators. Its equivalence with the double affine generalization of the…
We present an iterative algorithm for solving a class of \\nonlinear Laplacian system of equations in $\tilde{O}(k^2m \log(kn/\epsilon))$ iterations, where $k$ is a measure of nonlinearity, $n$ is the number of variables, $m$ is the number…
The eigenstates of a diagonalizable PT-symmetric Hamiltonian satisfy unconventional completeness and orthonormality relations. These relations reflect the properties of a pair of bi-orthonormal bases associated with non-hermitean…
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
We describe a rich family of binary variables statistical mechanics models on a given planar graph which are equivalent to Gaussian Grassmann Graphical models (free fermions) defined on the same graph. Calculation of the partition function…
We propose an integral geometric approach for computing dual distributions for the parameter distributions of multilinear models. The dual distributions can be computed from, for example, the parameter distributions of conics, multiple view…