Related papers: A characterization of chains in dimension three
The notion of a braid is generalized into two and three dimensions. Two-dimensional braids are described by braid monodromies or graphics called charts. In this paper we introduce the notion of curtains, and show that three-dimensional…
For a simple graph $G$, the $3$-distance graph, $D_3(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $3$ in the graph $G$. For a connected graph $G$, we provide some conditions for…
In this article we give a necessary and sufficient condition to characterize projective submanifolds in ${\mathbb P}^N$ with codimensions 2 and 3. The conditions involve the Chern classes of the manifold and a very ample line bundle on the…
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…
The structure of the character degree graphs $\Delta(G)$, i.e. the prime graphs on the set $\mathrm{cd}(G)$ of the irreducible character degrees of a finite group $G$, such that $G$ is solvable and $\Delta(G)$ has diameter three, remains an…
Conformal geodesics form an invariantly defined family of unparametrized curves in a conformal manifold generalizing unparametrized geodesics/paths of projective connections. The equation describing them is of third order, and it was an…
On real hypersurfaces in complex space forms many results are proven. In this paper we generalize some results concerning extrinsic geometry of real hypersurfaces, to CR submanifolds of maximal CR dimension in complex space forms.
Classical path search assumes complete graphs and scalar optimization metrics, yet real infrastructure networks are incomplete and require multi-dimensional evaluation. We introduce the concept of traversal: a generalization of paths that…
In this work we discuss the dynamics of a three dimensional chain which is described by generalized nonlinear sigma model The formula of the probability distribution of two topologically entangled chain is provided. The interesting case of…
We compute the projective dimension and regularity of $3$-path ideals of arbitrary graphs with at most one cycle.
Path graphs are intersection graphs of paths in a tree.~In this paper we give a "6\ good characterization" of path graphs, namely, we prove that path graph membership is in $NP\cap CoNP$ without resorting to existing polynomial time…
A novel family of integrable third order maps is presented. Each map possesses, by construction, a pair of rational invariants and a commuting map from the same class. The 3-dimensional invariant curve is parametrized, in general, by an…
In this investigation we study a family of networks, called spiders, which covers a range of networks going from chains to complete graphs. These spiders are characterized by three parameters: the number of nodes in the core, the number of…
We characterize certain CR structures of arbitrary codimension (different from 3, 4 and 5) on Riemannian Spin$^c$ manifolds by the existence of a Spin$^c$ structure carrying a strictly partially pure spinor field. Furthermore, we study the…
We classify the normal CR structures on $S^3$ and their automorphism groups. Together with [3], this closes the classification of normal CR structures on contact 3-manifolds. We give a criterion to compare 2 normal CR structures, and we…
Inspired by the modelization of 2D materials systems, we characterize arrangements of identical nonflat squares in 3D. We prove that the fine geometry of such arrangements is completely characterized in terms of patterns of mutual…
Network models with latent geometry have been used successfully in many applications in network science and other disciplines, yet it is usually impossible to tell if a given real network is geometric, meaning if it is a typical element in…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…
It is well-known that 7-dimensional 3-Sasakian manifolds carry a one-parametric family of compatible G_2 structures and that they do not admit a characteristic connection. In this note, we show that there is nevertheless a distinguished…
We study three-dimensional path geometries with nontrivial torsion of maximal rank. We introduce the notion of constant torsion and show that such path geometries are in one-to-one correspondence with certain cone structures modeled on…