Related papers: Chains of path geometries on surfaces: theory and …
In this paper, projective representations of generalized chain geometries are investigated, using the concepts and results of part I. In particular, we study under which conditions such a projective representation maps the chains of a…
All parabolic geometries, i.e. Cartan geometries with homogeneous model a real generalized flag manifold, admit highly interesting classes of distinguished curves. The geodesics of a projective class of connections on a manifold, conformal…
We study the geometry of surfaces in $\mathbb R^5$ by relating it to the geometry of regular and singular surfaces in $\mathbb R^4$ obtained by orthogonal projections. In particular, we obtain relations between asymptotic directions, which…
We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…
We develop new techniques in order to deal with Riccati-type equations, subject to a further algebraic constraint, on Riemannian manifolds $(M^3,g)$. We find that the obstruction to solve the aforementioned equation has order $4$ in the…
We study three classical graph problems - Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. These problems have been widely studied for points in the…
In this paper, we introduce the branched signature model, motivated by the branched rough path framework of [Gubinelli, Journal of Differential Equations, 248(4), 2010], which generalizes the classical geometric rough path. We establish a…
A supergrid graph is a finite vertex-induced subgraph of the infinite graph whose vertex set consists of all points of the plane with integer coordinates and in which two vertices are adjacent if the difference of their x or y coordinates…
With the help of a generalization of the Fermat principle in general relativity, we show that chains in CR geometry are geodesics of a certain Kropina metric constructed from the CR structure. We study the projective equivalence of Kropina…
We classify maximal quartic generalised projective special real curves up to equivalence. A maximal quartic generalised projective special real curve consists of connected components of the intersection of the hyperbolic points of a quartic…
In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which there exists a family of interiorly disjoint paths on a grid in one-to-one correspondence with their vertex set such that two vertices are…
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…
We study some sub-Riemannian objects (such as horizontal connectivity, horizontal connection, horizontal tangent plane, horizontal mean curvature) in hypersurfaces of sub-Riemannian manifolds. We prove that if a connected hypersurface in a…
The consideration of the so-called rotation minimizing frames allows for a simple and elegant characterization of plane and spherical curves in Euclidean space via a linear equation relating the coefficients that dictate the frame motion.…
We introduce a crossed module of piecewise linear surfaces and study the signature homomorphism, defined as the surface holonomy of a universal translation invariant $2$-connection. This provides a transform whereby surfaces are represented…
We present an algorithm to compute path homology for simple digraphs, and use it to topologically analyze various small digraphs en route to an analysis of complex temporal networks which exhibit such digraphs as underlying motifs. The…
We characterise the quotient surface graphs arising from symmetric contact systems of line segments in the plane and also from symmetric pointed pseudotriangulations in the case where the group of symmetries is generated by a translation or…
A hypergraph consists of a set of vertices and a set of subsets of vertices, called hyperedges. In the metro map metaphor, each hyperedge is represented by a path (the metro line) and the union of all these paths is the support graph (metro…
Using the path lattice cohomology we provide a conceptual topological characterization of the geometric genus for certain complex normal surface singularities with rational homology sphere links, which is uniformly valid for all…
Hypergraphs have seen widespread application in network and data science communities in recent years. We present a survey of recent work to construct auxiliary structures from hypergraphs -- specifically simplicial, relative, and chain…