Related papers: Primitive path homology

In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz, Sutherland,…

Solutions to linear controlled differential equations can be expressed in terms of iterated path integrals of the driving path. This collection of iterated integrals encodes essentially all information about the driving path. While upper…

We introduce a new topological invariant of complex line arrangements in the complex projective plane, derived from the interaction between their complement and the boundary of a regular neighbourhood. The motivation is to identify Zariski…

One can define the notion of primitive length spectrum for a simple regular periodic graph via counting the orbits of closed reduced primitive cycles under an action of a discrete group of automorphisms. We prove that this primitive length…

We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…

The primitive curves are the multiple curves that can be locally embedded in smooth surfaces (we will always suppose that the associated reduced curves are smooth). These curves have been defined and studied by C. Banica and O.Forster in…

We prove that among all graphs of order n, the path uniquely minimises the average order of its connected induced subgraphs. This confirms a conjecture of Kroeker, Mol and Oellermann, and generalises a classical result of Jamison for trees,…

We show that the notions of homotopy epimorphism and homological epimorphism in the category of differential graded algebras are equivalent. As an application we obtain a characterization of acyclic maps of topological spaces in terms of…

Homology of braid groups and Artin groups can be related to the study of spaces of curves. We completely calculate the integral homology of the family of smooth curves of genus $g$ with one boundary component, that are double coverings of…

We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in…

This paper describes the homology of various simplicial complexes associated to set families from combinatorial number theory, including primitive sets, pairwise coprime sets, product-free sets, and coprime-free sets. We present a condition…

In this short survey we report on the theory of biharmonic maps between Riemannian manifolds.

We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.

A graph is a path graph if it is the intersection graph of a family of subpaths of a tree. In 1970, Renz asked for a characterizaton of path graphs by forbidden induced subgraphs. Here we answer this question by listing all graphs that are…

We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…

In light of Lov\'{a}sz's longstanding question on the existence of Hamilton paths in vertex-transitive graphs, this paper considers a natural variant: what if vertex-transitivity is relaxed, yet a high degree of symmetry--specifically…

We show that for a complete complex algebraic variety the pure component of homology coincides with the image of intersection homology. Therefore pure homology is topologically invariant. To obtain slightly more general results we introduce…

Motivic homotopy theory is meant to play the role of algebraic topology, in particular homotopy theory, in the context of algebraic geometry. As proved by Oliver Rondigs and Paul Arne Ostvaer, this theory is closely connected to Voevodsky's…

The $k$-coprime graph of order $n$ is the graph with vertex set $\{k, k+1, \ldots, k+n-1\}$ in which two vertices are adjacent if and only if they are coprime. We characterize Hamiltonian $k$-coprime graphs. As a particular case, two…

A \emph{primitive hole} of a graph $G$ is a cycle of length 3 in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of the graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is the…