Related papers: Chains of path geometries on surfaces: theory and …
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
We propose a new method for quantitative characterization of spatial network-like patterns with loops, such as surface fracture patterns, leaf vein networks and patterns of urban streets. Such patterns are not well characterized by purely…
Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths in a Tree, J. Combin. Theory Ser. B, 41:2 (1986) 141--181]…
We introduce a persistent Hochschild homology framework for directed graphs. Hochschild homology groups of (path algebras of) directed graphs vanish in degree $i\geq 2$. To extend them to higher degrees, we introduce the notion of…
We construct a special class of spacelike surfaces in the Minkowski 4-space which are one-parameter systems of meridians of the rotational hypersurface with lightlike axis and call these surfaces meridian surfaces of parabolic type. They…
Affordable, high-quality whole-genome assemblies have made it possible to construct rich pangenomes that capture haplotype diversity across many species. As these datasets grow, they motivate the development of specialized techniques…
We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks)…
These notes give an introduction to the equivalence problem of sub-Riemannian manifolds. We first introduce preliminaries in terms of connections, frame bundles and sub-Riemannian geometry. Then we arrive to the main aim of these notes,…
The aim of this paper is to give the geometric realization of regular path complexes via (co)homology groups with coefficients in a ring $R$. Concretely, for each regular path complex $P$, we associate it with a singular $\Delta$-complex…
The geometric Cauchy problem for a class of surfaces in a pseudo-Riemannian manifold of dimension 3 is to find the surface which contains a given curve with a prescribed tangent bundle along the curve. We consider this problem for constant…
This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph…
We introduce the notion of log-Riemann surfaces. These are Riemann surfaces given by cutting and pasting planes together isometrically, and come equipped with a holomorphic local diffeomorphism to C called the projection map, and a…
Motivated by the desire of finding a geometric interpretation to the Yamabe equation on groups of Heisenberg type, we define a geometric structure on manifolds modelled locally on these groups, which we call contact structure of Heisenberg…
We investigate the geometric characteristics of constant gaussian curvature surfaces obtained from solutions of the $G(m,n)$ sigma model. Most of these solutions are related to the Veronese sequence. We show that we can distinguish surfaces…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
The square of a graph is obtained by adding additional edges joining all pair of vertices of distance two in the original graph. Particularly, if $C$ is a hamiltonian cycle of a graph $G$, then the square of $C$ is called a hamiltonian…
We investigate paths in the hexagonal circle packing and enumerate them with respect to width, height, number of steps, area, and kissing number. Functional equations and the kernel method yield closed bivariate generating functions…
Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\bf \#P}-complete even if the graph is known to be planar \cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric…
We investigate geometric properties of homogeneous parabolic geometries with generalized symmetries. We show that they can be reduced to a simpler geometric structures and interpret them explicitly. For specific types of parabolic…
We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…