Related papers: Poincare Hopf for vector fields on graphs
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
Every generic linear functional $f$ on a convex polytope $P$ induces an orientation on the graph of $P$. From the resulting directed graph one can define a notion of $f$-arborescence and $f$-monotone path on $P$, as well as a natural graph…
We consider the numerical investigation of surface bound orientational order using unit tangential vector fields by means of a gradient-flow equation of a weak surface Frank-Oseen energy. The energy is composed of intrinsic and extrinsic…
Tverberg's theorem says that a set with sufficiently many points in $\mathbb{R}^d$ can always be partitioned into $m$ parts so that the $(m-1)$-simplex is the (nerve) intersection pattern of the convex hulls of the parts. In…
We study the enumeration of graph orientations under local degree constraints. Given a finite graph $G = (V, E)$ and a family of admissible sets $\{\mathsf P_v \subseteq \mathbb{Z} : v \in V\}$, let $\mathcal N (G; \prod_{v \in V} \mathsf…
Type families on higher inductive types such as pushouts can capture homotopical properties of differential geometric constructions including connections, curvature, and vector fields. We define a class of pushouts based on simplicial…
In arXiv:1709.07504 Aguiar and Ardila give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.
Recently, M.~Baker and N.~Bowler introduced the notion of matroids over hyperfields as a unifying theory of various generalizations of matroids. In this paper we generalize the notion of minors and direct sums from ordinary matroids to…
In the paper we treat Gale diagrams in a combinatorial way. The interpretation allows to describe simplicial complexes which are Alexander dual to boundaries of simplicial polytopes and, more generally, to nerve-complexes of general…
This paper is a continuation of the paper F. A. Arias and M. Malakhaltsev "A generalization of the Gauss-Bonnet and Hopf-Poincar\'e theorems", ArXiv:1510.01395 [MathDG] 5 Oct 2015. Let $\pi : E \to M$ be a locally trivial fiber bundle over…
The harmonic index of a graph $G$ is defined as the sum of weights $\frac{2}{deg(v) + deg(u)}$ of all edges $uv$ of $E (G)$, where $deg (v)$ denotes the degree of a vertex $v$ in $V (G)$. In this note we generalize results of [L. Zhong, The…
A notion of Paley-Wiener spaces is introduced on combinatorial graphs. It is shown that functions from some of these spaces are uniquely determined by their values on some sets of vertices which are called the uniqueness sets. Such…
The goal of this work is to generalize the Gauss-Bonnet and Poincar\'{e}-Hopf Theorems to the case of orbifolds with boundary. We present two such generalizations, the first in the spirit of Satake. In this case, the local data (i.e.…
Hyperquot schemes are generalizations of Grothendieck's Quot scheme to partial flags. Using a Bialynicki-Birula decomposition, we obtain combinatorial data for the Betti numbers, and collect this information into the form of rational…
The main aim of the paper is to give a socle theory for Leavitt path algebras of arbitrary graphs. We use both the desingularization process and combinatorial methods to study Morita invariant properties concerning the socle and to…
We consider specific linear combinations of two loop modular graph functions on the toroidal worldsheet with $2s$ links for $s=2, 3$ and $4$. In each case, it satisfies an eigenvalue equation with source terms involving $E_{2s}$ and $E_s^2$…
This manuscript introduces a finite collection of generalized permutohedra associated to a simple graph. The first polytope of this collection is the graphical zonotope of the graph and the last is the graph-associahedron associated to it.…
We argue that all building blocks of transformer models can be expressed with a single concept: combinatorial Hopf algebra. Transformer learning emerges as a result of the subtle interplay between the algebraic and coalgebraic operations of…