Related papers: First order operators on shrinking graph-like spac…
The study of first-order optimization is sensitive to the assumptions made on the objective functions. These assumptions induce complexity classes which play a key role in worst-case analysis, including the fundamental concept of algorithm…
We say that a first order formula A distinguishes a graph G from another graph G' if A is true on G and false on G'. Provided G and G' are non-isomorphic, let D(G,G') denote the minimal quantifier rank of a such formula. We prove that, if G…
This paper develops some deeper consequences of an extended definition, proposed previously by the author, of pseudo-differential operators that are of type $1,1$ in H\"ormander's sense. Thus, it contributes to the long-standing problem of…
In this work we provide a survey of Fuglede's flux extensions of first order partial differential operators, a concept largely forgotten today. A long the way we also survey the classical weak and strong extensions of PDE operators and the…
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
Vertex operators, being families of birational transformations of infinite-dimensional algebraic ``varieties'' M, act on appropriate line bundles on M. However, they act on (meromorphic) sections only as_partial operators_: they are defined…
We discuss ways in which momentum operators can be introduced on an oriented metric graph. A necessary condition appears to the balanced property, or a matching between the numbers of incoming and outgoing edges; we show that a graph…
A network is a countable, connected graph X viewed as a one-complex, where each edge [x,y]=[y,x] (x,y in X^0, the vertex set) is a copy of the unit interval within the graph's one-skeleton X^1 and is assigned a positive conductance c(xy). A…
A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…
We determine the general form of the first order linear symmetry operators for the linearized field equation of metric perturbations in the spacetimes of dimension D>=4. Apart from the part derived easily from the invariance under general…
We study various representations for cyclic lambda-terms as higher-order or as first-order term graphs. We focus on the relation between 'lambda-higher-order term graphs' (lambda-ho-term-graphs), which are first-order term graphs endowed…
We propose a general condition, to ensure essential self-adjointness for the Gau{\ss}-Bonnet operator, based on a notion of completeness as Chernoff. This gives essential self-adjointness of the Laplace operator both for functions or…
We study Schr\"{o}dinger operators on star metric graphs with potentials of the form $\alpha\varepsilon^{-2}Q(\varepsilon^{-1}x)$. In dimension 1 such potentials, with additional assumptions on $Q$, approximate in the sense of distributions…
We consider the minimum-cut partitioning of a graph into more than two parts using spectral methods. While there exist well-established spectral algorithms for this problem that give good results, they have traditionally not been well…
In a bounded domain $G$ with smooth border studied boundary value and spectral problems for operators of the rotor (vortex) and the gradient of the divergence $+\lambda\,I$ in the Sobolev spaces. For $\lambda\neq 0$ these operators are…
The scaled relative graph (SRG) of an operator is a subset of the complex plane. It captures several salient features of an operator, such as contractiveness, and can be used to reveal the geometric nature of many of the inequality based…
This paper presents an algebraic approach to characterizing higher-order differential operators. While the foundational Leibniz rule addresses first-order derivatives, its extension to higher orders typically involves identities relating…
We deal in this work with a class of graphs, namely, the class of distance-regular graphs, in which on the basis of $k$-adjacency operators, the adjacency operator $A$ of a distance-regular graph is identified as a Jacobi matrix. To get so,…
We introduce merge-width, a family of graph parameters that unifies several structural graph measures, including treewidth, degeneracy, twin-width, clique-width, and generalized coloring numbers. Our parameters are based on new…
Some results on the approximation of functions from the Sobolev spaces on metric graphs by step functions are obtained. The estimates are uniform with respect to all graphs of a given finite length, and the constant factors in the…