Related papers: Algebras of graph functions

We give a computationally efficient method for constructing the linear differential operator with polynomial coefficients whose space of holomorphic solutions is spanned by all the branches of a function defined by a generic algebraic…

The paper by M. Baker and S. Norine in 2007 introduced a new parameter on configurations of graphs and gave a new result in the theory of graphs which has an algebraic geometry flavour. This result was called Riemann-Roch formula for graphs…

Let $\operatorname{Witt}$ be the Lie algebra generated by the set $\{L_i\,\vert\, i \in {\mathbb Z}\}$ and $\operatorname{Vir}$ its universal central extension. Let $\operatorname{Diff}(V)$ be the Lie algebra of differential operators on…

Network data can be conveniently modeled as a graph signal, where data values are assigned to the nodes of a graph describing the underlying network topology. Successful learning from network data requires methods that effectively exploit…

We consider difference operators in $L^2$ on $\R$ of the form $$ L f(s)=p(s)f(s+i)+q(s) f(s)+r(s) f(s-i) ,$$ where $i$ is the imaginary unit. The domain of definiteness are functions holomorphic in a strip with some conditions of decreasing…

Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…

The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…

In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…

The Green's function of the discrete Sch\"odinger operator on a finite graph is considered. This setting reproduces Laplacian and signless Laplacian by adjusting appropriate potentials. We show two ways of the expression for the Green's…

Differential categories were introduced by Blute, Cockett, and Seely as categorical models of differential linear logic and have since lead to abstract formulations of many notions involving differentiation such as the directional…

Consider the Plancherel decomposition of the tensor product of a highest weight and a lowest weight unitary representations of $SL_2$. We construct explicitly the action of the Lie algebra $sl_2 + sl_2$ in the direct integral of Hilbert…

Quantum differential operators on Reflection Equation Algebras, corresponding to Hecke symmetries R were introduced in previous publications. In the present paper we are mainly interested in quantum analogs of the Laplace and Casimir…

We consider a variable order differential operator on a graph with a cycle. We study the inverse spectral problem for this operator by the system of spectra. The main results of the paper are the uniqueness theorem and the constructive…

Symmetrically self-similar graphs are an important type of fractal graph. Their Green functions satisfy order one iterative functional equations. We show when the branching number of a generating cell is two, either the graph is a star…

We introduce certain correlation functions (graded $q$--traces) associated to vertex operator algebras and superalgebras which we refer to as $n$--point functions. These naturally arise in the studies of representations of Lie algebras of…

We consider the space-fractional operator with order $0<\alpha<1$ on the metric star graph. The boundary conditions at the vertices of the metric star graph providing the self-adjointness of the operator are derived. The obtained result is…

Graph Convolutional Networks (GCNs) have shown to be effective in handling unordered data like point clouds and meshes. In this work we propose novel approaches for graph convolution, pooling and unpooling, inspired from finite differences…

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…

For a given infinite connected graph $G=(V,E)$ and an arbitrary but fixed conductance function $c$, we study an associated graph Laplacian $\Delta_{c}$; it is a generalized difference operator where the differences are measured across the…

We show how to deduce Rellich inequalities from Hardy inequalities on infinite graphs. Specifically, the obtained Rellich inequality gives an upper bound on a function by the Laplacian of the function in terms of weighted norms. These…