Related papers: A combinatorial $K$-theory perspective on the Edge…
We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…
We study the topological K-theory spectrum of the dg singularity category associated to a weighted projective complete intersection. We calculate the topological K-theory of the dg singularity category of a weighted projective hypersurface…
We present news proofs of the additivity, resolution and cofinality theorems for the algebraic $K$-theory of exact categories. These proofs are entirely algebraic, based on Grayson's presentation of higher algebraic $K$-groups via binary…
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…
The graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs. Kocay's Lemma is an important tool…
The additivity theorem for derivateurs associated to complicial biWaldhausen categories is proved. Also, to any exact category in the sense of Quillen a K-theory space is associated. This K-theory is shown to satisfy the additivity,…
We show that the K-theory spectra of many assemblers, such as the assembler of polytopes in euclidean, hyperbolic or spherical geometry, as well as the assembler of definable sets, are equivalent to the K-theory spectrum of a squares…
We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
We introduce and study a $K$-theory of twisted bundles for associative algebras $A(\mathfrak g)$ of formal series with an infinite-Lie algebra coefficients over arbitrary compact topological spaces. Fibers of such bundles are given by…
This survey deals with the construction of a category of spectral triples that is compatible with the Kasparov product in $KK$-theory. These notes serve as an intuitive guide to these results, avoiding the necessary technical proofs. We…
A modified $k$-deck of a graph is obtained by removing $k$ edges in all possible ways and adding $k$ (not necessarily new) edges in all possible ways. Krasikov and Roditty used these decks to give an independent proof of M\"uller's result…
We survey the relationship between the combinatorics and geometry of graphs and the algebraic structure of right-angled Artin groups. We concentrate on the defining graph of the right-angled Artin group and on the extension graph associated…
We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…
The article gives the second part of the treatise on Regular Algebraic $K$-theory (Sections V & VI) of the author. Regular algebraic $K$-theory for groups is a homology theory for discrete groups closely connected to (but different from)…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our…
We introduce the notion of a diagram category and discuss its application to the invariant theory of classical groups and super groups, with some indications concerning extensions to quantum groups and quantum super groups. Tensor functors…
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…
We give a brief introduction to the geometric and combinatorial group theory of Artin groups. In particular we introduce the $K(\pi,1)$ conjecture for Artin groups and survey known results as of January 2024. These notes were written as…