All Questions

This question has a background from representation theory/homological algebra, but I state everything in elementary terms here: Call an n-CNak an n-tupel $[c_0,c_1,...,c_{n-1}]$ where $c_0=c_1=...=c_{...

Here is the short version of the combinatorial problem: Given a positive integer $n \geq 2$. Draw a circle with $2n$ points indexed by the numbers from $\mathbb{Z}/ 2n \mathbb{Z}$. We colour the ...