arXiv subjects
Publications and source records attributed to Takahiro Matsushita.
We determine the homotopy types of the independence complexes of $(n \times 4)$ and $(n \times 5)$-square grid graphs. In fact, they are homotopy equivalent to wedges of spheres.
We construct invariant quasimorphisms for groups acting on the circle. Furthermore, we provide a criterion for the non-extendablity of the resulting quasimorphisms and an explicit formula which relates the values of our quasimorphisms to those of the Poincaré translation number. By using them, we show that the stable commutator length $\mathrm{scl}_G$ and the stable mixed commutator length $\mathrm{scl}_{G,N}$ are not bi-Lipschitzly equivalent for the surface group $G=π_1(Σ_{\ell})$ of genus at least $2$ and its commutator subgroup $N = [π_1(Σ_{\ell}), π_1(Σ_{\ell})]$. We also show the non-equivalence for a pair $(G,N)$ such that $G$ is the fundamental group of a $3$-dimensional closed hyperbolic mapping torus. These pairs serve as the first family of examples of such $(G,N)$ in which $G$ is finitely generated.
We determine the homotopy types of the independence complexes of the $(n \times 6)$-square grid graphs. In fact, we show that these complexes are homotopy equivalent to wedges of spheres.
In the present paper, for a pair $(G,N)$ of a group $G$ and its normal subgroup $N$, we consider the mixed commutator length $\mathrm{cl}_{G,N}$ on the mixed commutator subgroup $[G,N]$. We focus on the setting of wreath products: $ (G,N)=(\mathbb{Z}\wr Γ, \bigoplus_Γ\mathbb{Z})$. Then we determine mixed commutator lengths in terms of the general rank in the sense of Malcev. As a byproduct, when an abelian group $Γ$ is not locally cyclic, the ordinary commutator length $\mathrm{cl}_G$ does not coincide with $\mathrm{cl}_{G,N}$ on $[G,N]$ for the above pair. On the other hand, we prove that if $Γ$ is locally cyclic, then for every pair $(G,N)$ such that $1\to N\to G\to Γ\to 1$ is exact, $\mathrm{cl}_{G}$ and $\mathrm{cl}_{G,N}$ coincide on $[G,N]$. We also study the case of permutational wreath products when the group $Γ$ belongs to a certain class related to surface groups.
The dominance complex $D(G)$ of a simple graph $G = (V,E)$ is the simplicial complex consisting of the subsets of $V$ whose complements are dominating. We show that the connectivity of $D(G)$ plus $2$ is a lower bound for the vertex cover number $τ(G)$ of $G$.
The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jelić Milutinović et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the connectivity of the matching complexes of polygonal line tilings. In this paper, we determine the homotopy types of the matching complexes of polygonal line tilings recursively, and determine their connectivities.
Let $N$ be a normal subgroup of a group $G$. A quasimorphism $f$ on $N$ is $G$-invariant if $f(gxg^{-1}) = f(x)$ for every $g \in G$ and every $x \in N$. The goal in this paper is to establish Bavard's duality theorem of $G$-invariant quasimorphisms, which was previously proved by Kawasaki and Kimura in the case $N = [G,N]$. Our duality theorem provides a connection between $G$-invariant quasimorphisms and $(G,N)$-commutator lengths. Here for $x \in [G,N]$, the $(G,N)$-commutator length $\mathrm{cl}_{G,N}(x)$ of $x$ is the minimum number $n$ such that $x$ is a product of $n$ commutators which are written as $[g,x]$ with $g \in G$ and $h \in N$. In the proof, we give a geometric interpretation of $(G,N)$-commutator lengths. As an application of our Bavard duality, we obtain a sufficient condition on a pair $(G,N)$ under which $\mathrm{scl}_G$ and $\mathrm{scl}_{G,N}$ are bi-Lipschitzly equivalent on $[G,N]$.
The bounded degree complex $BD(G,λ)$ is a generalization of the matching complexes of a graph. In this paper, we show that the bounded degree complex of a forest is shellable, by using independence complexes of hypergraphs. We obtain a wedge decomposition result of bounded degree complexes when a graph $G$ has a leaf
We show that a relation among minimal non-faces of a fillable complex $K$ yields an identity of iterated (higher) Whitehead products in a polyhedral product over $K$. In particular, for the $(n-1)$-skeleton of a simplicial $n$-sphere, we always have such an identity, and for the $(n-1)$-skeleton of a $(n+1)$-simplex, the identity is the Jacobi identity of Whitehead products ($n=1$) and Hardie's identity of higher Whitehead products ($n\ge 2$).
The neighborhood complexes of graphs were introduced by Lovász in his proof of the Kneser conjecture. He showed that a certain topological property of $N(G)$ gives a lower bound for the chromatic number of $G$. In this paper, we study a combinatorial description of the fundamental groups of the neighborhood complexes. For a positive integer $r$, we introduce the $r$-fundamental group $π_1^r(G,v)$ of a based graph $(G,v)$ and the $r$-neighborhood complex $N_r(G)$ of $G$. The $1$-neighborhood complex is the neighborhood complex. We show that the even part $π_1^{2r}(G,v)_{ev}$, which is a subgroup of $π_1^{2r}(G,v)$ with index 1 or 2, is isomorphic to the fundamental group of $(N_r(G),v)$ if $v$ is not isolated. We can use the $r$-fundamental groups to show the non-existence of graph homomorphisms. For example, we show that $π_1^3(KG_{2k+1,k})$ is isomorphic to $\mathbb{Z} /2$, and this implies that there is no graph homomorphism from $KG_{2k+1,k}$ to the 5-cycle graph $C_5$. We discuss the covering maps associated to $r$-fundamental groups.
We show that there are $k$ simple graphs whose Kronecker covers are isomorphic to the bipartite Kneser graph $H(n,k)$, and that their chromatic numbers coincide with $χ(K(n,k)) = n - 2k + 2$. We also determine the automorphism groups of these graphs.
We generalize some results of Gray and McGibbon-Roitberg on relations between phantom maps and rational homotopy to relative phantom maps. Since the $\lim^1$ and the profinite completion techniques do not apply to relative phantom maps, we develop new techniques.
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 neighborhood complexes are isomorphic. As an application, for integers $m$ and $n$ greater than 2, we construct connected graphs $G$ and $H$ such that $N(G) \cong N(H)$ but $χ(G) = m$ and $χ(H) = n$. We also construct a graph $KG_{n,k}'$ such that $KG_{n,k}'$ and the Kneser graph $KG_{n,k}$ are not isomorphic but their Kronecker double coverings are isomorphic.
The de Bruijn-Erdős theorem states that the chromatic number of an infinite graph equals the maximum of the chromatic numbers of finite subgraphs. Such a determinativeness by finite subobjects appears in the definition of a phantom map which is classical in algebraic topology. The topological method in combinatorics connects these two, which leads us to define the relative version of a phantom map: a map $f\colon X\to Y$ is called a relative phantom map to a map $φ\colon B\to Y$ if the restriction of $f$ to any finite subcomplex of $X$ lifts to $B$ through $φ$, up to homotopy. There are two kinds of maps which are obviously relative phantom maps: (1) the composite of a map $X\to B$ with $φ$; (2) a usual phantom map $X\to Y$. A relative phantom map of type (1) is called trivial, and a relative phantom map out of a suspension which is a sum of (1) and (2) is called relatively trivial. We study the (relative) triviality of relative phantom maps and in particular, we give rational homology conditions for the (relative) triviality.
The matching complex $M(G)$ of a simple graph $G$ is the simplicial complex consisting of the matchings on $G$. The matching complex $M(G)$ is isomorphic to the independence complex of the line graph $L(G)$. Braun and Hough introduced a family of graphs $Δ^m_n$, which is a generalization of the line graph of the $(n \times 2)$-grid graph. In this paper, we show that the independence complex of $Δ^m_n$ is a wedge of spheres. This gives an answer to a problem suggested by Braun and Hough.
The $\mathbb{Z}_2$-index ${\rm ind}(X)$ of a $\mathbb{Z}_2$-CW-complex $X$ is the smallest number $n$ such that there is a $\mathbb{Z}_2$-map from $X$ to $S^n$. Here we consider $S^n$ as a $\mathbb{Z}_2$-space by the antipodal map. Hedetniemi's conjecture is a long standing conjecture in graph theory concerning the graph coloring problem of tensor products of finite graphs. We show that if Hedetniemi's conjecture is true, then ${\rm ind}(X \times Y) = \min \{ {\rm ind}(X) , {\rm ind}(Y)\}$ for every pair $X$ and $Y$ of finite $\mathbb{Z}_2$-complexes.
We prove that a graph whose chromatic number is 2 is a homotopy test graph. We also prove that there is a graph $K$ with two involutions $γ_1$ and $γ_2$ such that $(K,γ_1)$ is a Stiefel-Whitney test graph, but $(K,γ_2)$ is not. These are answers to some of the problems suggested by Kozlov.
The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the chromatic number of $G$. For a fixed finite graph $T$, we show that there is no homotopy invariant of ${\rm Hom}(T,G)$ which gives an upper bound for the chromatic number of $G$. More precisely, for a non-bipartite graph $G$, we construct a graph $H$ such that ${\rm Hom}(T,G)$ and ${\rm Hom}(T,H)$ are homotopy equivalent but $χ(H)$ is much larger than $χ(G)$. The equivariant homotopy type of ${\rm Hom}(T,G)$ is also considered.