Related papers: A combinatorial $K$-theory perspective on the Edge…
We formulate some conjectures about the K-theory of symplectic manifolds and their Fukaya categories, and prove some of them in very special cases.
Variations on the notions of Reedy model structures and projective model structures on categories of diagrams in a model category are introduced. These allow one to choose only a subset of the entries when defining weak equivalences, or to…
In this paper we introduce a new formalism for $K$-theory, called squares $K$-theory. This formalism allows us to simultaneously generalize the usual three-term relation $[B] = [A] + [C]$ for an exact sequence $A \hookrightarrow B…
In this paper, we study multiplicative structures on the K-theory of the core $A:=C^*(E)^{U(1)}$ of the C*-algebra $C^*(E)$ of a directed graph $E$. In the first part of the paper, we study embeddings $E\to E\times E$ that induce a…
A covering of k-graphs (in the sense of Pask-Quigg-Raeburn) induces an embedding of universal C*-algebras. We show how to build a (k+1)-graph whose universal algebra encodes this embedding. More generally we show how to realise a direct…
Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edge set by performing as few queries as possible. An algorithm…
Commutative K-theory, a cohomology theory built from spaces of commuting matrices, has been explored in recent work of Adem, G\'{o}mez, Gritschacher, Lind, and Tillman. In this article, we use unstable methods to construct explicit…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
In this paper, we combine group-theoretic and combinatorial techniques to study $\wedge$-transitive digraphs admitting a cartesian decomposition of their vertex set. In particular, our approach uncovers a new family of digraphs that may be…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
In this article we study the K-theory of endomorphisms using noncommutative motives. We start by extending the K-theory of endomorphisms functor from ordinary rings to (stable) infinity categories. We then prove that this extended functor…
A k-valuation is a special type of edge k-colouring of a medial graph. Various graph polynomials, such as the Tutte, Penrose, Bollob\'as-Riordan, and transition polynomials, admit combinatorial interpretations and evaluations as weighted…
Graphs are a powerful tool for analyzing large data sets, but many real-world phenomena involve interactions that go beyond the simple pairwise relationships captured by a graph. In this paper we introduce and study a simple combinatorial…
Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k-set agreement. Among all…
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop a theory of the fundamental groupoid of a k-graph, and relate it…
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…
The topic of this paper is a generalization of Tannaka duality to coclosed categories. As an application we prove reconstruction theorems for coalgebras (and bialgebras) in categories of topological vector spaces over a nonarchimedean field…
A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a…
Given a closed, convex and pointed cone K in R^n, we present a result which infers K-irreducibility of sets of K-quasipositive matrices from strong connectedness of certain bipartite digraphs. The matrix-sets are defined via products, and…