Related papers: A combinatorial $K$-theory perspective on the Edge…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
Reliability evaluation and fault tolerance of an interconnection network of some parallel and distributed systems are discussed separately under various link-faulty hypotheses in terms of different $\mathcal{P}$-conditional…
In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…
We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
In an earlier paper, the authors introduced partial translation algebras as a generalisation of group C*-algebras. Here we establish an extension of partial translation algebras, which may be viewed as an excision theorem in this context.…
Edwards, van den Heuvel, Kang, and Sereni conjectured the following strengthening of Vizing's Theorem: let $G$ be a simple graph, and let $K = \Delta(G) + 1$. For any matching $M$ in $G$ and any precoloring of the edges in $M$ using the…
We introduce an axiomatic theory of spherical diagrams as a tool to study certain combinatorial properties of polyhedra in $\mathbb R^3$, which are of central interest in the context of Art Gallery problems for polyhedra and other…
We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…
We define $k$-dimensional digraphs and initiate a study of their spectral theory. The $k$-dimensional digraphs can be viewed as generating graphs for small categories called $k$-graphs. Guided by geometric insight, we obtain several new…
We apply the degree formula for connective $K$-theory to study rational contractions of algebraic varieties. Examples include rationally connected varieties and complete intersections.
We use correspondences to define a purely topological equivariant bivariant K-theory for spaces with a proper groupoid action. Our notion of correspondence differs slightly from that of Connes and Skandalis. We replace smooth K-oriented…
In this work we show that given a connectivity graph $G$ of a $[[n,k,d]]$ quantum code, there exists $\{K_i\}_i, K_i \subset G$, such that $\sum_i |K_i|\in \Omega(k), \ |K_i| \in \Omega(d)$, and the $K_i$'s are $\tilde{\Omega}(…
We give a K-theory proof of the invariance under cobordism of the family index. We consider elliptic pseudodifferential families on a continuous fibre bundle with smooth fibres over a compact base space B, and define a notion of cobordant…
A central question in equivariant algebraic K-theory asks whether there exists an equivariant K-theory machine from genuine symmetric monoidal G-categories to orthogonal G-spectra that preserves equivariant algebraic structures. We answer…
A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-vertex-deleted subgraphs, known as the deck of G. The Reconstruction Conjecture (RC) posits that every finite simple graph with at least…
The paper gives a short account of the contents of "Regular Algebraic K-Theory For Groups" by the author and its connections with other homology and K-theories.
We present proofs of the basic isopermetric structure theory, obtaining some new simplified proofs. As an application, we obtain simple descriptions for subsets $S$ of an abelian group with $|kS|\le k|S|-k+1$ or $|kS-rS|- (k+r)|S|,$ where…
Let G denote a graph and let K be a subset of vertices that are a set of target vertices of G. The K-terminal reliability of G is defined as the probability that all target vertices in K are connected, considering the possible failures of…
We define KK-theory spectra associated to C*-categories and look at certain instances of the Kasparov product at this level. This machinery is used to give a description of the analytic assembly map as a natural map of spectra.