Related papers: Deformations of box complexes
In this paper we use the theory of barcodes as a new tool for studying dynamics of area-preserving homeomorphisms. We will show that the barcode of a Hamiltonian diffeomorphism of a surface depends continuously on the diffeomorphism, and…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…
We show how the small perturbations of a linear cocycle have a relative rotation number associated with an invariant measure of the base dynamics an with a $2$-dimensional bundle of the finest dominated splitting (provided that some…
We introduce amorphic complexity as a new topological invariant that measures the complexity of dynamical systems in the regime of zero entropy. Its main purpose is to detect the very onset of disorder in the asymptotic behaviour. For…
A classical result by Lov\'asz asserts that two graphs $G$ and $H$ are isomorphic if and only if they have the same left profile, that is, for every graph $F$, the number of homomorphisms from $F$ to $G$ coincides with the number of…
We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…
Using the definition of colouring of $2$-edge-coloured graphs derived from $2$-edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to $2$-edge-coloured graphs. We find closed forms for the first three…
The determination of the quantum chromatic number of graphs has attracted considerable attention recently. However, there are few families of graphs whose quantum chromatic numbers are determined. A notable exception is the family of…
The stable Kneser graph $SG_{n,k}$, $n\ge1$, $k\ge0$, introduced by Schrijver \cite{schrijver}, is a vertex critical graph with chromatic number $k+2$, its vertices are certain subsets of a set of cardinality $m=2n+k$. Bj\"orner and de…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
We introduce two coproducts on mixed graphs (that is to say graphs with both oriented and unoriented edges), the first one by separation of the vertices into two parts, and the second one given by contraction and extractions of subgraphs.…
We define and develop a homotopy invariant notion for the topological complexity of a map $f:X \to Y$, denoted TC($f$), that interacts with TC($X$) and TC($Y$) in the same way cat($f$) interacts with cat($X$) and cat($Y$). Furthermore,…
This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers to the equivalence class of orientations of a graph $G$ those…
Let $box(G)$ be the boxicity of a graph $G$, $G[H_1,H_2,\ldots, H_n]$ be the $G$-generalized join graph of $n$-pairwise disjoint graphs $H_1,H_2,\ldots, H_n$, $G^d_k$ be a circular clique graph (where $k\geq 2d$) and $\Gamma(R)$ be the…
The neighborhood complex $N(G)$ is a simplicial complex assigned to a graph $G$ whose connectivity gives a lower bound for the chromatic number of $G$. We show that if the Kronecker double coverings of graphs are isomorphic, then their…
V.I. Arnold [Russian Math. Surveys 26(2) (1971) 29-43] constructed miniversal deformations of square complex matrices under similarity. Reduction transformations to them and also to miniversal deformations of matrix pencils and matrices…
This paper extends the Bakry-\'{E}mery theorem connecting the Ricci curvature and log-Sobolev inequalities to the matrix-valued setting. Using tools from noncommuative geometry, it is shown that for a right invariant second order…
Given two nilpotent endomorphisms, we determine when their lattices of hyperinvariant subspaces are isomorphic. The study of the lattice of hyperinvariant subspaces can be reduced to the nilpotent case when the endomorphism has a…
We give a construction to remove coincidence points of continuous maps on graphs (1-complexes) by changing the maps by homotopies. When the codomain is not homeomorphic to the circle, we show that any pair of maps can be changed by…