关于词的强Bernoulli型截断对策的核位置的Enumeration
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
摘要：
我们找到了一类截断博弈的获胜策略。由于本作者最近的一些结果，这些游戏，我们获得新的公式的伯努利数和多项式的第二类和一个新的组合模型的数量连接排列给定的秩。对于连接的排列，分解用于找到获胜的策略被证明是双射等价于国王的分解，用于递归地生成一个换位格雷码的连接排列。
英文摘要：
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author's recent results on some of these games we obtain new formulas for Bernoulli numbers and polynomials of the second kind and a new combinatorial model for the number of connected permutations of given rank. For connected permutations, the decomposition used to find the winning strategy is shown to be bijectively equivalent to King's decomposition, used to recursively generate a transposition Gray code of the connected permutations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
