Related papers: A Diagrammatic Equation for Oriented Planar Graphs
We propose a renormalization group flow equation for a functional that generates $S$-matrix elements and which captures similarities to the well-known Wetterich and Polchinski equations. While the latter ones respectively involve the…
In this paper we will consider the peridynamic equation of motion which is described by a second order in time partial integro-differential equation. This equation has recently received great attention in several fields of Engineering…
In the paper, some geometric properties of the plane interception curve defined by a nonlinear ordinary differential equation are discussed. Its parametric representation is used to find the limits of some triangle elements associated with…
A path integral is presented that solves a general class of linear second order partial differential equations with Dirichlet/Neumann boundary conditions. Elementary kernels are constructed for both Dirichlet and Neumann boundary…
Modeling complex systems, like neural networks, simple liquids or flocks of birds, often works in reverse to textbook approaches: given data for which averages and correlations are known, we try to find the parameters of a given model…
An orthogonal drawing is an embedding of a plane graph into a grid. In a seminal work of Tamassia (SIAM Journal on Computing 1987), a simple combinatorial characterization of angle assignments that can be realized as bend-free orthogonal…
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$…
We study a model of fully-packed dimer configurations (or perfect matchings) on a bipartite periodic graph that is two-dimensional but not planar. The graph is obtained from $\mathbb Z^2$ via the addition of an extensive number of extra…
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…
The paper is devoted to investigating a Cauchy problem for nonlinear elliptic PDEs in the abstract Hilbert space. The problem is hardly solved by computation since it is severely ill-posed in the sense of Hadamard. We shall use a modified…
In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…
We construct bivariate orthogonal polynomials (OPs) on algebraic curves of the form $y^m = \phi(x)$ in $\mathbb{R}^2$ where $m = 1, 2$ and $\phi$ is a polynomial of arbitrary degree $d$, in terms of univariate semiclassical OPs. We compute…
Suppose that $G=(V, E)$ be a locally finite and connected graph with symmetric weight and uniformly positive measure, where $V$ denotes the vertex set and $E$ denotes the edge set. We are concered with the following problem $$…
In this paper, a quantum dot mathematical model based on a two-dimensional Schr\"odinger equation assuming the 1/r inter-electronic potential is revisited. Generally, it is argued that the solutions of this model obtained by solving a…
In this paper, we focus on two types of degenerate partial differential equations: a degenerate elliptic equation and a degenerate parabolic equation. Significantly, both categories are characterized by the same principal operator. To…
Given n data points in R^d, an appropriate edge-weighted graph connecting the data points finds application in solving clustering, classification, and regresssion problems. The graph proposed by Daitch, Kelner and Spielman (ICML~2009) can…
This is a survey paper based on previous results of the author. In the paper, we define and discuss the generalizations of linear partial differential equations to multidimensional variational problems. We consider two examples of such…
Branched rough paths, used to solve ODEs on $\mathbb{R}$, have been generalised in two different directions. In one direction, there are regularity structures aimed at solving SPDEs on $\mathbb{R}$. In the other direction, there are…
A partially embedded graph (or PEG) is a triple (G,H,\H), where G is a graph, H is a subgraph of G, and \H is a planar embedding of H. We say that a PEG (G,H,\H) is planar if the graph G has a planar embedding that extends the embedding \H.…
We establish a deep connection between the Prandtl equations linearised around a quadratic shear flow, confluent hypergeometric functions of the first kind, and the Schr\"odinger operator. Our first result concerns an ODE and a spectral…