$p$-Linear schemes for sequences modulo $p^r$

arxiv(2023)

引用 0|浏览0
暂无评分
摘要
We construct finite $p$-automata for the computation of interesting combinatorial sequences modulo $p^r$. They are presented in the form of so-called $p$-linear schemes.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要