Related papers: Tension continuous maps--their structure and appli…
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We…
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalizations of tolerance graphs with direct applications in the…
Normal maps between discrete groups $N\rightarrow G$ were characterized [FS] as those which induce a compatible topological group structure on the homotopy quotient $EN\times_N G$. Here we deal with topological group (or loop) maps…
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…
Typed metagraphs are defined as hypergraphs with types assigned to hyperedges and their targets, and the potential to have targets of hyperedges connect to whole links as well as targets. Directed typed metagraphs (DTMGs) are introduced via…
In [S. Basu, A. Gabrielov, N. Vorobjov, Semi-monotone sets. arXiv:1004.5047v2 (2011)] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals, and having connected intersections with all…
Structural properties of finite digraphs $R$ and $S$ are studied which enforce $\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for every finite digraph $G \in \mathfrak{ D }'$, where ${\cal H}(G,H)$ is the set of homomorphisms from $G$ to $H$, and…
We define and develop a homotopy invariant notion for the sequential topological complexity of a map $f:X\to Y,$ denoted $TC_{r}(f)$, that interacts with $TC_{r}(X)$ and $TC_{r}(Y)$ in the same way Jamie Scott's topological complexity map…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
We introduce the notion of \emph{topo-symmetric extensions} of topological groups, a new generalization of classical group extensions that incorporates both topological and symmetry constraints. We define morphisms between such extensions,…
In this paper we study a new product of graphs called {\em tight product}. A graph $H$ is said to be a tight product of two (undirected multi) graphs $G_1$ and $G_2$, if $V(H)=V(G_1)\times V(G_2)$ and both projection maps $V(H)\to V(G_1)$…
This is the first one of a series of papers on association of orientations, lattice polytopes, and abelian group arrangements to graphs. The purpose is to interpret the integral and modular tension polynomials of graphs at zero and negative…
Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…
We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a…
Persistent Homology is a powerful tool in Topological Data Analysis (TDA) to capture topological properties of data succinctly at different spatial resolutions. For graphical data, shape, and structure of the neighborhood of individual data…
Persistent homology is a cornerstone of topological data analysis, offering a multiscale summary of topology with robustness to nuisance transformations, such as rotations and small deformations. Persistent homology has seen broad use…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…
Tree tensor network descriptions of critical quantum spin chains are empirically known to reproduce correlation functions matching CFT predictions in the continuum limit. It is natural to seek a more complete correspondence, additionally…
This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…