加载中…
We study frieze patterns over the integers that are allowed to have wild entries. We introduce the quiddity number as a new invariant. The quiddity number is then used to classify strongly connected components of the directed graph . Furthermore, we show that every finite simple directed graph arises as an induced subgraph of a directed graph for sufficiently large.

生成讲解博客的中文版本

生成AI智能校验的中文版本