相关论文: Tension continuous maps--their structure and appli…
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings are dual to the notion of flow-continuous mappings and the…
It is shown that a surjective monotone map $X\to Y$ between finite $T_0$-spaces induces a surjective map on homology. As such a map turns out to be a sequence of edge contractions in the Hasse diagram of $X$, followed by a homeomorphism,…
Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…
Let $\psi: (M,g)\longrightarrow (N,h)$ be a smooth map between Riemannian manifolds. The tension field of $\psi$ can be regarded as a map from $(M,g)$ into the Riemannian vector bundle $\psi^{-1}TN$, equipped with the Sasaki metric $G_{S}$.…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
Ordered matchings, defined as graphs with linearly ordered vertices, where each vertex is connected to exactly one edge, play a crucial role in the area of ordered graphs and their homomorphisms. Therefore, we consider related problems from…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
After a somewhat rocky start, geometry and topology have established a foothold in machine learning. Message passing, either on graphs or higher-order complexes, is one of the main drivers of geometric deep learning, and paradigms that were…
We consider an algebra of even-order square tensors and introduce a stretching map which allows us to represent tensors as matrices. The stretching map could be understood as a generalized matricization. It conserves algebraic properties of…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
Man\v{c}inska and Roberson introduced quantum graph homomorphisms as the existence of perfect quantum strategies for graph homomorphism games. The resulting relation is a quasi-order on finite graphs, and hence gives a partial order after…
Interconnected networks of rigid struts are critical for application in lightweight, load-bearing structures. However, accurately modeling stress distribution in these strut lattices poses significant computational challenges due to its…
Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…
We extend the notion of 'homomorphism-homogeneity' to a wider class of kinds of maps than previously studied, and we investigate the relations between the resulting notions of homomorphism-homogeneity, giving several examples. We also give…
We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…
Higher-order networks encode the many-body interactions of complex systems ranging from the brain to biological transportation networks. Simplicial and cell complexes are ideal higher-order network representations for investigating…
We introduce and study, for a process P delivering edges on the Cartesian product of the vertex sets of a given set of graphs, the P-product of these graphs, thereby generalizing many types of product graph. Analogous to the notion of a…