Related papers: A combinatorial $K$-theory perspective on the Edge…
Let $G=(V,E)$ be a simple connected graph. A connected edge cover of $G$ is a subset $S\subseteq E$ such that every vertex of $G$ is incident with at least one edge in $S$ and the subgraph induced by $S$ is connected. The connected edge…
The Farrell-Jones Fibered Isomorphism Conjecture for the stable topological pseudoisotopy theory has been proved for several classes of groups. For example for discrete subgroups of Lie groups, virtually poly-infinite cyclic groups, Artin…
The Akbari-Cameron-Khosrovshahi (ACK) conjecture, which appears to be unresolved, states that for any simple graph $G$ with at least one edge, there exists a nonzero {$\{0,1\}$}-vector in the row space of its adjacency matrix that is not a…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
We prove the Categorified Wrapping Number Conjecture for large classes of annular links, including alternating annular links and tangle closures exhibiting plumbed link phenomena. We do so by characterizing when a resolution is sufficient…
We provide a general framework for wall-crossing of equivariant K-theoretic enumerative invariants of appropriate moduli stacks $\mathfrak{M}$, by lifting Joyce's homological universal wall-crossing arXiv:2111.04694 to K-theory and to…
A kind of motivic algebra of spectral categories and modules over them is developed to introduce K-motives of algebraic varieties. As an application, bivariant algebraic K-theory as well as bivariant motivic kohomology groups are defined…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…
The aim of this paper is to construct the Poincare isomorphism in K-theory on manifolds with edges. We show that the Poincare isomorphism can naturally be constructed in the framework of noncommutative geometry. More precisely, to a…
Bivariant (equivariant) K-theory is the standard setting for non-commutative topology. We may carry over various techniques from homotopy theory and homological algebra to this setting. Here we do this for some basic notions from…
In the example of complex grassmannians, we demonstrate various techniques available for computing genus-0 K-theoretic GW-invariants of flag manifolds and more general quiver varieties. In particular, we address explicit reconstruction of…
In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…
Covering theory is an important tool in representation theory of algebras, however, the results and the proofs are scattered in the literature. We give an introduction to covering theory at a level as elementary as possible.
We construct a combinatorially defined involution on the algebraic $K$-theory of the ring spectrum associated to a bimonoidal category with anti-involution. Particular examples of such are braided bimonoidal categories. We investigate…
The aim of this survey is to present applications of covering techniques in the theory of Krull-Gabriel dimension. We start with recalling fundamental facts of the classical covering theory of quivers and locally bounded categories. Then we…
We introduce a formalism based on a combinatorial notion of cell complex subject to an inclusion-reversing duality operation. Our main goal is to open the way for a functorial definition of field theories in a context where no manifold or…
Covering problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination problem), covering the vertex set by cliques (clique covering…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We compute the algebraic $K$-theory of some classes of surfaces defined over finite fields. We achieve this by first calculating the motivic cohomology groups and then studying the motivic Atiyah-Hirzebruch spectral sequence. In an…