Related papers: Siblings of countable cographs
We describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…
A graph in which every connected induced subgraph has a disconnected complement is called a cograph. Such graphs are precisely the graphs that do not have the 4-vertex path as an induced subgraph. We define a $2$-cograph to be a graph in…
We consider cohomology of diagrams of algebras by Beck's approach, using comonads. We then apply this theory to computing the cohomology of $\Psi$-rings. Our main result is that there is a spectral sequence connecting the cohomology of the…
The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…
We extend the the combinatorics of tableaux to the study of diagram algebras and give a uniform construction of their quasi-hereditary covers.
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
In this paper we study the (co)homology of Tanabe algebras, which are a family of subalgebras of the partition algebras exhibiting a Schur-Weyl duality with certain complex reflection groups. The homology of the partition algebras has been…
We study alternating strand diagrams on the disk with an orbifold point. These are quotients by rotation of Postnikov diagrams on the disk, and we call them orbifold diagrams. We associate a quiver with potential to each orbifold diagram,…
We prove that the problem of counting the number of colourings of the vertices of a graph with at most two colours, such that the colour classes induce connected subgraphs is #P-complete. We also show that the closely related problem of…
Building on recent work by Thomassen, we show that Nash-Williams' orientation theorem, that every finite $2k$-edge-connected multigraph has a $k$-arc-connected orientation, also holds for all infinite multigraphs.
We prove that, for each fixed genus, the portion of semigroups of that genus belonging to infinite chains in the semigroup tree approaches 0 as the genus grows to infinite. This means that most numerical semigroups have a finite number of…
Given a quandle, we can construct a symmetric quandle called the symmetric double of the quandle. We show that the (co)homology groups of a given quandle are isomorphic to those of its symmetric double. Moreover, quandle coloring numbers…
We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…
In this note we prove that the constant and equivariant cyclic cohomology of algebras coincide. This shows that constant cyclic cohomology is rich and computable.
The goal of this paper is to show the following result: For every integer $n\geq 2$ there is a countable orderable group such that its space of orders is countable and has Cantor-Bendixson rank $n$. We show this by explicitly constructing a…
We prove that the epimorphism relation is a complete analytic quasi-order on the space of countable groups. In the process, we obtain the result of independent interest that the epimorphism relation on pointed reflexive graphs is complete.
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…
We classify the countable linear orders $X$ for which there is an order $A$ with at least two points such that the lexicographic product $AX$ is isomorphic to $X$. Given such an $X$, we determine every corresponding order $A$, and identify…
We prove the following conjecture of S. Thomass\'e: for every (potentially infinite) digraph $ D $ it is possible to iteratively reverse directed cycles in such a way that the dichromatic number of the final reorientation $ D^{*} $ of $ D $…