Related papers: Obstructions to a general characterization of grap…
We study and compare the gap and the Riesz topologies of the space of all unbounded regular operators on Hilbert C*-modules. We show that the space of all bounded adjointable operators on Hilbert C*-modules is an open dense subset of the…
We develop notions of a representation of a topological graph E and of a covariant representation of a topological graph E which do not require the machinery of C*-correspondences and Cuntz-Pimsner algebras. We show that the C*-algebra…
We investigate dynamical systems consisting of a locally compact Hausdorff space equipped with a partially defined local homeomorphism. Important examples of such systems include self-covering maps, one-sided shifts of finite type and, more…
We give detailed descriptions of gluing pseudoholomorphic maps in symplectic geometry, especially in the presence of an obstruction bundle. The main motivation is to try to compare the symplectic and enumerative invariants of algebraic…
Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…
We begin the study the algebraic topology of semi-coarse spaces, which are generalizations of coarse spaces that enable one to endow non-trivial `coarse-like' structures to compact metric spaces, something which is impossible in coarse…
In this paper we consider the relationship between order and topology in the vector lattice $C_b(X)$ of all bounded continuous functions on a Hausdorff space $X$. We prove that the restriction of $f\in C_b(X)$ to a closed set $A$ induces an…
The notion of graph covers is a discretization of covering spaces introduced and deeply studied in topology. In discrete mathematics and theoretical computer science, they have attained a lot of attention from both the structural and…
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological…
If $R$ is a commutative ring, $M$ a compact $R$-oriented manifold and $G$ a finite graph without loops or multiple edges, we consider the graph configuration space $M^G$ and a Bendersky-Gitler type spectral sequence converging to the…
We describe a simple homological test for obstructions to graph colorings. The main idea is to combine the framework of Hom-complexes with the following general fact: an arbitrary Z_2-space has nontrivial homology with Z_2-coefficients in…
Let G be a locally compact, Hausdorff groupoid in which s is a local homeomorphism and the unit space is totally disconnected. Assume there is a continuous cocycle c from G into a discrete group $\Gamma$. We show that the collection A(G) of…
We study topologization of the semigroup $\mathscr{O\!\!I}\!_n(L)$ of finite partial order isomorphisms of a bounded rank of an infinite linear ordered set $(L,\leqslant)$. In particular we show that every $T_1$ left-topological…
A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in the presence of linked data structures, 2) shape analysis…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
Topological quivers generalize the notion of directed graphs in which the sets of vertices and edges are locally compact (second countable) Hausdorff spaces. Associated to a topological quiver $Q$ is a $C^*$-correspondence, and in turn, a…
In this paper, we extend the ideas of graph pebbling to oriented graphs and find a classification for all graphs with fully traversable pebbling assignments that are isomorphic to their assignment graph. We then give some cases in which a…
We define obstructions which obstruct topological pseudo-isotopies from being isotopic to isotopies in dimension four. These match the smooth obstructions of Hatcher-Wagoner for smooth pseudo-isotopies, and accordingly are valued in certain…
We introduce the notion of a topological higher-rank graph, a unified generalization of the higher-rank graph and the topological graph. Using groupoid techniques, we define the Toeplitz and Cuntz-Krieger algebras of topological higher-rank…