Related papers: Lov\'asz-Type Theorems and Game Comonads

Game comonads have brought forth a new approach to studying finite model theory categorically. By representing model comparison games semantically as comonads, they allow important logical and combinatorial properties to be exressed in…

In the way of proving Kneser's conjecture, L\'{a}szl\'{o} Lov\'{a}sz settled out a new lower bound for the chromatic number of graphs. He showed that if the hom complex $||Hom(\mathcal{K}_2, H)||$ of a graph $H$ is topologically…

We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological…

Our starting point is the observation that if graphs in a class C have low descriptive complexity in first order logic, then the isomorphism problem for C is solvable by a fast parallel algorithm (essentially, by a simple combinatorial…

Using the general notions of finitely presentable and finitely generated object introduced by Gabriel and Ulmer in 1971, we prove that, in any (locally small) category, two sequences of finitely presentable objects and morphisms (or two…

Two graphs $G_1,G_2$ are distinguished by the Weisfeiler--Leman isomorphism test if and only if there is a tree $T$ that has a different number of homomorphisms to $G_1$ and to $G_2$. There are two known proofs of this fact -- a logical…

Game comonads offer a categorical view of a number of model-comparison games central to model theory, such as pebble and Ehrenfeucht-Fra\"iss\'e games. Remarkably, the categories of coalgebras for these comonads capture preservation of…

Game comonads, introduced by Abramsky, Dawar and Wang and developed by Abramsky and Shah, give an interesting categorical semantics to some Spoiler-Duplicator games that are common in finite model theory. In particular they expose…

Finite digraphs $R$ and $S$ are studied with $\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for every finite digraph $G \in \mathfrak{ D }'$, where ${\cal H}(G,H)$ is the set of order homomorphisms from $G$ to $H$ and $\mathfrak{ D }'$ is a class…

We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…

The main result of this work is a new proof and generalization of Lazard's comparison theorem of locally analytic group cohomology with Lie algebra cohomology for K-Lie groups, where K is a finite extension of the p-adic numbers. We show…

Lov\'{a}sz and Cherkassky discovered independently that, if $G$ is a finite graph and $T\subseteq V(G)$ such that the degree $d_G(v)$ is even for every vertex $v\in V(G)\setminus T$, then the maximum number of edge-disjoint paths which are…

Two graphs $G$ and $H$ are homomorphism indistinguishable over a family of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphism from $F$ to $H$. Many…

Let ($\mathfrak{g},\mathsf{g})$ be a pair of complex finite-dimensional simple Lie algebras whose Dynkin diagrams are related by (un)folding, with $\mathsf{g}$ being of simply-laced type. We construct a collection of ring isomorphisms…

We prove an algebraic version of the Gauge-Invariant Uniqueness Theorem, a result which gives information about the injectivity of certain homomorphisms between ${\mathbb Z}$-graded algebras. As our main application of this theorem, we…

Game comonads, introduced by Abramsky, Dawar and Wang, and developed by Abramsky and Shah, give a categorical semantics for model comparison games. We present an axiomatic account of Feferman-Vaught-Mostowski (FVM) composition theorems…

We prove that if two nonzero homomorphisms from the Cuntz algebra O_infinity to a purely infinite simple C*-algebra have the same class in KK-theory, and if either both are unital or both are nonunital, then they are approximately unitarily…

We call a bipartite graph {\it homogeneous} if every finite partial automorphism which respects left and right can be extended to a total automorphism. A $(\kappa,{\lambda} )$ bipartite graph is a bipartite graph with left side of size…

We prove Csorba's conjecture that the Lov\'asz complex Hom(C_5,K_n) of graph multimorphisms from the 5-cycle C_5 to the complete graph K_n is Z/2Z-equivariantly homeomorphic to the Stiefel manifold, V(n-1,2), the space of (ordered)…

Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph $F \in \mathcal{F}$. Many graph isomorphism relaxations such as (quantum) isomorphism…