On the Radical of a Hecke–Kiselman Algebra

The Hecke-Kiselman algebra of a finite oriented graph Θ over a field K is studied. If Θ is an oriented cycle, it is shown that the algebra is semiprime and its central localization is a finite direct product of matrix algebras over the field of rational functions K(x). More generally, the radical is described in the case of PI-algebras, and it is shown that it comes from an explicitly described congruence on the underlying Hecke-Kiselman monoid. Moreover, the algebra modulo the radical is again a Hecke-Kiselman algebra and it is a finite module over its center.

Homomorphisms of Cayley graphs and Cycle Double Covers

We study the following conjecture of Matt DeVos: If there is a graph homomorphism from a Cayley graph $\mathrm{Cay}(M, B)$ to another Cayley graph $\mathrm{Cay}(M', B')$ then every graph with an $(M,B)$-flow has an $(M',B')$-flow. This conjecture was originally motivated by the flow-tension duality. We show that a natural strengthening of this conjecture does not hold in all cases but we conjecture that it still holds for an interesting subclass of them and we prove a partial result in this direction. We also show that the original conjecture implies the existence of an oriented cycle double cover with a small number of cycles.

Intrinsic linking and knotting in tournaments

A directed graph [Formula: see text] is intrinsically linked if every embedding of that graph contains a nonsplit link [Formula: see text], where each component of [Formula: see text] is a consistently oriented cycle in [Formula: see text]. A tournament is a directed graph where each pair of vertices is connected by exactly one directed edge. We consider intrinsic linking and knotting in tournaments, and study the minimum number of vertices required for a tournament to have various intrinsic linking or knotting properties. We produce the following bounds: intrinsically linked ([Formula: see text]), intrinsically knotted ([Formula: see text]), intrinsically 3-linked ([Formula: see text]), intrinsically 4-linked ([Formula: see text]), intrinsically 5-linked ([Formula: see text]), intrinsically [Formula: see text]-linked ([Formula: see text]), intrinsically linked with knotted components ([Formula: see text]), and the disjoint linking property ([Formula: see text]). We also introduce the consistency gap, which measures the difference in the order of a graph required for intrinsic [Formula: see text]-linking in tournaments versus undirected graphs. We conjecture the consistency gap to be nondecreasing in [Formula: see text], and provide an upper bound at each [Formula: see text].

A Cambrian Framework for the Oriented Cycle

This paper completes the project of constructing combinatorial models (called frameworks) for the exchange graph and $\mathbf{g}$-vector fan associated to any exchange matrix $B$ whose Cartan companion is of finite or affine type, using the combinatorics and geometry of Coxeter-sortable elements and Cambrian lattices/fans. Specifically, we construct a framework in the unique non-acyclic affine case, the cyclically oriented $n$-cycle. In the acyclic affine case, a framework was constructed by combining a copy of the Cambrian fan for $B$ with an antipodal copy of the Cambrian fan for $-B$. In this paper, we extend this "doubled Cambrian fan'' construction to the oriented $n$-cycle, using a more general notion of sortable elements for quivers with cycles.