论文标题
在Lyndon-Word代表图上
On Lyndon-Word Representable Graphs
论文作者
论文摘要
在此简短说明中，我们首先将一个新的简单无向图与给定单词相关联，上面是$ n $ - 字母的订购字母。我们将其称为该单词的Lyndon图。然后，我们将Lyndon-Word代表图作为图的概念介绍给某个单词的Lyndon图。然后，我们将广义的stirl循环数字$ s（n; n，k）$作为长度$ n $的数字单词，其中$ k $ lydon lydon单词在其lyndon分解中，而不是$ n $ letters的订购字母。最后，我们以几个有趣的开放问题和猜想为感兴趣的受众结束了论文。
In this short note, we first associate a new simple undirected graph with a given word over an ordered alphabet of $n$-letters. We will call it the Lyndon graph of that word. Then, we introduce the concept of the Lyndon-word representable graph as a graph isomorphic to a Lyndon graph of some word. Then, we introduce the generalized Stirling cycle number $S(N;n,k)$ as the number words of length $N$ with $k$ distinct Lydon words in their Lyndon factorization over an ordered alphabet of $n$-letters . Finally, we conclude the paper with several interesting open questions and conjectures for interested audiences.
