Related papers: Helmholtz-Hodge Decomposition on Graphs
A mathematically correct description is presented on the interrelations between the dynamics of divergence free vector fields on an oriented 3-dimensional manifold $M$ and the dynamics of Hamiltonian systems. It is shown that for a given…
We show that the spectrum of the curl operator on a generic smoothly bounded domain in three-dimensional Euclidean space consists of simple eigenvalues. The main new ingredient in our proof is a formula for the variation of curl eigenvalues…
We study the free product of rooted graphs and its various decompositions using quantum probabilistic methods. We show that the free product of rooted graphs is canonically associated with free independence, which completes the proof of the…
This paper is the continuation of the research of the author and his colleagues of the {\it canonical} decomposition of graphs. The idea of the canonical decomposition is to define the binary operation on the set of graphs and to represent…
For the case of algebraic curves - compact Riemann surfaces - it is shown that de Rham cohomology group $H^{1}_{\mathrm{dR}}(X,\mathbb{C})$ of a genus $g$ Riemann surface $X$ has a natural structure of a symplectic vector space. Every…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
In this article we describe the Hall algebra H_X of an elliptic curve X defined over a finite field and show that the group SL(2,Z) of exact auto-equivalences of the derived category D^b(Coh(X)) acts on the Drinfeld double DH_X of H_X by…
We develop a new approach to the study of spectral asymmetry. Working with the operator $\operatorname{curl}:=*\mathrm{d}$ on a connected oriented closed Riemannian 3-manifold, we construct, by means of microlocal analysis, the asymmetry…
The variety of minimal rational tangents associated to Hecke curves was used by J.-M.Hwang [8] to prove the simplicity of the tangent bundle on the moduli of vector bundles over a curve. In this paper, we use the tangent maps of the…
The $k$-core of a graph is defined as the maximal subgraph in which every vertex is connected to at least $k$ other vertices within that subgraph. In this work we introduce a distance-based generalization of the notion of $k$-core, which we…
We initiate the study of inflection curves of rational vector fields on the Riemann sphere. For a rational vector field $v_R=-R(z)\frac{\partial}{\partial z}, \qquad R(z)=\frac{Q(z)}{P(z)} $ we define its affine regular inflection locus by…
A closure operator on a set $X$ is a function $\operatorname{cl}: \wp(X) \to \wp(X)$ satisfying, for all $A, B \subseteq X$, the following properties: extensivity, $A \subseteq \operatorname{cl}(A)$; monotonicity, which states that if $A…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
The existing definitions of graph convolution, either from spatial or spectral perspectives, are inflexible and not unified. Defining a general convolution operator in the graph domain is challenging due to the lack of canonical…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
The Horizontal Chord Theorem states that if a continuous curve connects points $A$ and $B$ in the plane, then for any integer $k$ there are points $C$ and $D$ on the curve such that $\overrightarrow{AB}=k \overrightarrow{CD}$. In this note,…
Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…
The core vertex set of a graph is an invariant of the graph. It consists of those vertices associated with the non-zero entries of the nullspace vectors of a $\{0,1\}$-adjacency matrix. The remaining vertices of the graph form the…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
Nonlocal vector calculus, which is based on the nonlocal forms of gradient, divergence, and Laplace operators in multiple dimensions, has shown promising applications in fields such as hydrology, mechanics, and image processing. In this…