Related papers: Graph invariants from the topology of rigid isotop…
Higher dimensional automata, i.e. labelled precubical sets, model concurrent systems. We introduce the homology graph of an HDA, which is a directed graph whose nodes are the homology classes of the HDA. We show that the homology graph is…
Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…
We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph $G = (V,E)$ is $(k,p)$-planar if $V$ can be partitioned into clusters of size at most $k$ such that $G$ admits a drawing where: (i) each…
A directed acyclic graph $G=(V,E)$ is said to be $(e,d)$-depth robust if for every subset $S \subseteq V$ of $|S| \leq e$ nodes the graph $G-S$ still contains a directed path of length $d$. If the graph is $(e,d)$-depth-robust for any $e,d$…
We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…
For a graph invariant $\pi$, the Contraction($\pi$) problem consists in, given a graph $G$ and two positive integers $k,d$, deciding whether one can contract at most $k$ edges of $G$ to obtain a graph in which $\pi$ has dropped by at least…
A {\em $(d,h)$-decomposition} of a graph $G$ is an order pair $(D,H)$ such that $H$ is a subgraph of $G$ where $H$ has the maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ of maximum out-degree at most $d$. A graph…
Let $n, d$ be integers with $1 \leq d \leq \left \lfloor \frac{n-1}{2} \right \rfloor$, and set $h(n,d):={n-d \choose 2} + d^2$ and $e(n,d):= \max\{h(n,d),h(n, \left \lfloor \frac{n-1}{2} \right \rfloor)\}$. Because $h(n,d)$ is quadratic in…
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
Let $E\to B$ be a smooth vector bundle of rank $n$, and let $P \in I^p(GL(n,\mathbb{R}))$ be a $GL(n,\mathbb{R})$-invariant polynomial of degree $p$ compatible with a universal integral characteristic class $ u \in…
This is the first part of an article in two parts, which builds the foundation of a Floer-theoretic invariant, (I_F). (See math.DG/0505013 for part II). The Floer homology can be trivial in many variants of the Floer theory; it is therefore…
Given a graph $G$, the graph $[G]$ obtained by adding, for each pair of vertices of $G$, a unique vertex adjacent to both vertices is called the binding graph of $G$. In this work, we show that the class of binding graphs is…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
This work is a continuation of the program initiated in [arXiv:2311.18302]. We show how one can define novel gauge-theoretic (holomorphic) Floer homologies of seven, six, and five-manifolds, from the physics of a topologically-twisted 8d…
The formal class of a germ of diffeomorphism $\phi$ is embeddable in a flow if $\phi$ is formally conjugated to the exponential of a germ of vector field. We prove that there are complex analytic unipotent germs of diffeomorphisms at…
Splitting invariants describe how a plane curve "splits" by the pull-back under a Galois cover over the projective plane whose branch locus contains no component of the plane curve. They enable us to distinguish the embedded topology of…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
In this paper we study the topology of the space of Riemann surfaces in a simply connected space X, S_{g,n} (X, \gamma). This is the space consisting of triples, (F_{g,n}, \phi, f), where F_{g,n} is a Riemann surface of genus g and…
A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…
An answer to the question investigated in this paper brings a new characterization of internal groupoids such that: (a) it holds even when finite limits are not assumed to exist; (b) it is a full subcategory of the category of…