Related papers: Chains of path geometries on surfaces: theory and …
Using a tight binding model we calculate the conductance of monovalent atomic chains for different contact geometries. The leads connected to the chains are modelled as semi-infinite fcc lattices with different orientations and couplings.…
This paper focuses on developing an efficient algorithm for analyzing a directed network (graph) from a topological viewpoint. A prevalent technique for such topological analysis involves computation of homology groups and their…
We seek to characterize homology classes of Lagrangian projective spaces embedded in irreducible holomorphic-symplectic manifolds, up to the action of the monodromy group. This paper addresses the case of manifolds deformation-equivalent to…
The family of Euclidean triangles having some fixed perimeter and area can be identified with a subset of points on a nonsingular cubic plane curve, i.e., an elliptic curve; furthermore, if the perimeter and the square of the area are…
We use the lattice model of directed walks to investigate the conformational as well as the adsorption properties of a semiflexible homopolymer chain immersed in a good solvent in two and three dimensions. To account for the stiffness in…
Square grid circle patterns with prescribed intersection angles, mimicking holomorphic maps z^a and log(z) are studied. It is shown that the corresponding circle patterns are imbedded and described by special separatrix solutions of…
In this chapter, we identify fundamental geometric structures that underlie the problems of sampling, optimisation, inference and adaptive decision-making. Based on this identification, we derive algorithms that exploit these geometric…
For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…
We embed neighborhood geometries of graphs on surfaces as point-circle configurations. We give examples coming from regular maps on surfaces with maximum number of automorphisms for their genus and survey geometric realization of pentagonal…
We build an analogue for the Levi-Civita connection on Riemannian manifolds for sub-Riemannian manfiolds modeled on the Heisenberg group. We demonstrate some geometric properties of this connection to justify our choice and show that this…
The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks. When the network is fully known, the shortest path problem can be…
Weingarten transformations which, by definition, preserve the asymptotic lines on smooth surfaces have been studied extensively in classical differential geometry and also play an important role in connection with the modern geometric…
We reduce CR-structures on smooth elliptic and hyperbolic manifolds of CR-codimension 2 to parallelisms thus solving the problem of global equivalence for such manifolds. The parallelism that we construct is defined on a sequence of two…
In recent years many algorithms have been developed for finding patterns in graphs and networks. A disadvantage of these algorithms is that they use subgraph isomorphism to determine the support of a graph pattern; subgraph isomorphism is a…
We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…
Intersection homology is defined for simplicial, singular and PL chains and it is well known that the three versions are isomorphic for a full filtered simplicial complex. In the literature, the isomorphism, between the singular and the…
The \emph{thinness} of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Graphs with thinness at most two include, for example, bipartite convex graphs. Many…
In the present article we study a special class of surfaces in the four-dimensional Euclidean space, which are one-parameter systems of meridians of the standard rotational hypersurface. They are called meridian surfaces. We show that a…
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
In this paper, firstly, we will study the structure of the path complex $(\Omega_*(G;\Z),\partial)$ of a digraph $G$ via the $\Z$-generators of $\Omega_*(G,\Z)$ under strongly regular condition, which is called the minimal path in…