Related papers: A Homotopy Theory for Graphs

In this note on coarse geometry we revisit coarse homotopy. We prove that coarse homotopy indeed is an equivalence relation, and this in the most general context of abstract coarse structures. We introduce (in a geometric way) coarse…

In this note, I study a comparison map between a motivic and \'{e}tale cohomology group of an elliptic curve over $\mathbb{Q}$ just outside the range of Voevodsky's isomorphism theorem. I show that the property of an appropriate version of…

We show that there are homotopy equivalences $h:N\to M$ between closed manifolds which are induced by cell-like maps $p:N\to X$ and $q:M\to X$ but which are not homotopic to homeomorphisms. The phenomenon is based on construction of…

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…

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

This is a survey. The main subject of this survey is the homotopical or homological nature of certain structures which appear in classical problems about groups, Lie rings and group rings. It is well known that the (generalized) dimension…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We study the problem of counting the number of homomorphisms from an input graph $G$ to a fixed (quantum) graph $\bar{H}$ in any finite field of prime order $\mathbb{Z}_p$. The subproblem with graph $H$ was introduced by Faben and Jerrum…

Given a diagram of Pi-algebras (graded groups equipped with an action of the primary homotopy operations), we ask whether it can be realized as the homotopy groups of a diagram of spaces. The answer given here is in the form of an…

The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…

The purpose of this paper is to develop a homotopical algebra for graphs, relevant to zeta series and spectra of finite graphs. More precisely, we define a Quillen model structure in a category of graphs (directed and possibly infinite,…

In this paper we develop homotopy theoretical methods for studying diagrams. In particular we explain how to construct homotopy colimits and limits in an arbitrary model category. The key concept we introduce is that of a model…

Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…

Discrete homotopy theory or A-homotopy theory is a combinatorial homotopy theory defined on graphs, simplicial complexes, and metric spaces, reflecting information about their connectivity. The present paper aims to further understand the…

This paper presents a discrete homotopy theory and a discrete homology theory for finite posets. In particular, the discrete and classical homotopy groups of finite posets are always isomorphic. Moreover, this discrete homology theory is…

We continue our investigation of spaces of long embeddings (long embeddings are high-dimensional analogues of long knots). In previous work we showed that when the dimensions are in the stable range, the rational homology groups of these…

In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

For $r\geq 1$, the $r$-independence complex of a graph $G$ is a simplicial complex whose faces are subset $I \subseteq V(G)$ such that each component of the induced subgraph $G[I]$ has at most $r$ vertices. In this article, we determine the…

This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…