Related papers: Helmholtz-Hodge Decomposition on Graphs

A hole is a chordless cycle with at least four vertices. A hole is odd if it has an odd number of vertices. A dart is a graph which vertices $a, b, c, d, e$ and edges $ab, bc, bd, be, cd, de$. Dart-free graphs have been actively studied in…

An ordered graph is a graph enhanced with a linear order on the vertex set. An ordered graph is a core if it does not have an order-preserving homomorphism to a proper subgraph. We say that $H$ is the core of $G$ if (i) $H$ is a core, (ii)…

Let $K$ be a number field, $\UX$ be a smooth projective curve over it and $D$ be a reduced divisor on $\UX$. Let $(E,\nabla)$ be a fibre bundle with connection having meromorphic poles on $D$. Let $p_1,...,p_s\in\UX(K)$ and…

This work provides the foundation for the finite element analysis of an elliptic problem which is the rotational analogue of the $p$-Laplacian and which appears as a model of the magnetic induction in a high-temperature superconductor…

We study hyperelliptic curves y^2=f(x) over local fields of odd residue characteristic. We introduce the notion of a "cluster picture" associated to the curve, that describes the p-adic distances between the roots of f(x), and show that…

The Hodge decomposition provides a very powerful mathematical method for the analysis of 2D and 3D vector fields. It states roughly that any vector field can be $L^2$-orthogonally decomposed into a curl-free, divergence-free, and a harmonic…

Let X be a smooth projective curve over a field k of characteristic zero. The differential fundamental group of X is defined as the Tannakian dual to the category of vector bundles with (integrable) connections on X. This work investigates…

We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a…

In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…

In this work, the divergence and curl operators are obtained using the coordinate free non rigid basis formulation of differential geometry. Although the authors have attempted to keep the presentation self-contained as much as possible,…

This article is devoted to the generalization of results obtained in 2002 by Jabin, Otto and Perthame. In their article they proved that planar vector fields taking value into the unit sphere of the euclidean norm and satisfying a given…

We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…

We develop a Helmholtz-like theorem for differential forms in Euclidean space $E_{n}$ using a uniqueness theorem similar to the one for vector fields. We then apply it to Riemannian manifolds, $R_{n}$, which, by virtue of the…

Let $X$ be a compact K\"{a}hler manifold, and let $L$ be a line bundle on $X.$ Define $I_k(L)$ to be the kernel of the multiplication map $ Sym^k H^0 (L) \to H^0 (L^k).$ For all $h \leq k,$ we define a map $\rho : I_k(L) \to Hom (H^{p,q}…

In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a…

A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection. Even though there…

We introduce the notion of a graph derangement, which naturally interpolates between perfect matchings and Hamiltonian cycles. We give a necessary and sufficient condition for the existence of graph derangements on a locally finite graph.…

Givental has defined a Lagrangian cone in a symplectic vector space which encodes all genus-zero Gromov-Witten invariants of a smooth projective variety X. Let Y be the subvariety in X given by the zero locus of a regular section of a…

Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…

The vorticity of a vector field on 3-dimensional Euclidean space is usually given by the curl of the vector field. In this paper, we extend this concept to n-dimensional compact and oriented Riemannian manifold. We analyse many properties…