相关论文: Applications of closed models defined by counting …

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 continue our study of closed models defined in categories of graphs. We construct a closed model defined in the cat-egory of directed graphs which characterizes the strongly connected components. This last notion has many…

We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action. Examples include finite graphs, periodic graphs, graphings and…

Symbolic dynamics is partly the study of walks in a directed graph. By a walk, here we mean a morphism to the graph from the Cayley graph of the monoid of non-negative integers. Sets of these walks are also important in other areas, such as…

We present a homotopy theory for a weak version of modular operads whose compositions and contractions are only defined up to homotopy. This homotopy theory takes the form of a Quillen model structure on the collection of simplicial…

We introduce a ``non-orientable'' variation of Serre's definition of a graph, which we call an abstract isogeny graph. These objects capture the combinatorics of the graphs $G(p,\ell,H)$, the $\ell$-isogeny graphs of supersingular elliptic…

We construct a model category (in the sense of Quillen) for set theory, starting from two arbitrary, but natural, conventions. It is the simplest category satisfying our conventions and modelling the notions of finiteness, countability and…

Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…

We show that the quasicategory defined as the localization of the category of (simple) graphs at the class of A-homotopy equivalences does not admit colimits. In particular, we settle in the negative the question of whether the A-homotopy…

A cocycle category H(X,Y) is defined for objects X and Y in a model category, and it is shown that the set of morphisms [X,Y] is isomorphic to the set of path components of H(X,Y) provided the ambient model category is right proper and…

We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

In a previous article, we introduced notions of finiteness obstruction, Euler characteristic, and L^2-Euler characteristic for wide classes of categories. In this sequel, we prove the compatibility of those notions with homotopy colimits of…

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…

We present different ways of endowing a particular category of graphs with Quillen model structures. We show, among other things, that the core of a graph can be seen as its homotopy type in an appropriate Quillen model structure, and that…

We consider families of coded systems that contain the Dyck shifts and that are closed under topological conjugacy. We introduce a notion of hyposynchronization of subshifts. We introduce a notion of restricted complexity of…

Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…

We are checking the closed categories beginning with the category of sets and ending with the category of categories. The novelty is a generalizing the notion of adjoint functors to the joint pair of functors in the category of directed…

We make strict $n$-categories even stricter by requiring they satisfy higher exchange laws governed by Hadzihasanovic's theory of regular directed complexes. We study the first properties of stricter $n$-categories, in particular, we define…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…