Related papers: Brown functors of directed graphs
We observe that the process of associating an action to any Schreier extension of monoids with commutative and cancellative kernel is functorial. We show that this functor is a generalisation of the direction functor, used to give a…
We introduce pseudocubical objects with pseudoconnections in an arbitrary category, obtained from the Brown-Higgins structure of a cubical object with connections by suitably relaxing their identities, and construct a cubical analog of the…
We exploit a decomposition of graph traversals to give a novel characterization of depth-first and breadth-first traversals as universal constructions. Specifically, we introduce functors from two different categories of edge-ordered…
The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…
In this note we study umkehr maps in generalized (co)homology theories arising from the Pontrjagin-Thom construction, from integrating along fibers, pushforward homomorphisms, and other similar constructions. We consider the basic…
For any discrete group $\Gamma$ and any 2-dimensional complex representation $\rho$ of $\Gamma$, we introduce the notion of $\rho-$equivariant functions, and we show that they are parameterized by vector-valued modular forms. We also…
We prove a rank-one theorem \`a la G. Alberti for the derivatives of vector-valued maps with bounded variation in a class of Carnot groups that includes Heisenberg groups $\mathbb H^n$ for $n\geq 2$. The main tools are properties relating…
The chromatic functor of a simple graph is a functorization of the chromatic polynomial. M. Yoshinaga showed in \cite{Yoshinaga2015} that two finite graphs have isomorphic chromatic functors if and only if they have the same chromatic…
For groups of a topological origin, such as braid groups and mapping class groups, an important source of interesting and highly non-trivial representations is given by their actions on the twisted homology of associated spaces; these are…
We define exact weights on a triangulated category to be nonnegative functions on objects satisfying a subadditivity condition with respect to exact triangles. Such weights induce a metric on objects in the triangulated category, which we…
In a well generated triangulated category T, given a regular cardinal a, we consider the following problems: given a functor from the category of a-compact objects to abelian groups that preserves products of <a objects and takes exact…
The last decade has seen the development of path homology and magnitude homology -- two homology theories of directed graphs, each satisfying classic properties such as Kunneth and Mayer-Vietoris theorems. Recent work of Asao has shown that…
We prove two representability theorems, up to homotopy, for presheaves taking values in a closed symmetric combinatorial model category \cat V. The first theorem resembles the Freyd representability theorem, the second theorem is closer to…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
The complexity of graph homomorphism problems has been the subject of intense study. It is a long standing open problem to give a (decidable) complexity dichotomy theorem for the partition function of directed graph homomorphisms. In this…
For a covariant functor W. Fulton and R. MacPherson defined \emph{an operational bivariant theory} associated to this covariant functor. In this paper we will show that given a contravariant functor one can similarly construct a ``dual"…
We introduce two families of diagrammatic monoidal supercategories. The first family, depending on an associative superalgebra, generalizes the oriented Brauer category. The second, depending on an involutive superalgebra, generalizes the…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…