arXiv 1503.017962015-03-05math.CO

A Meta-Algorithm for Creating Fast Algorithms for Counting ON Cells in Odd-Rule Cellular Automata

Shalosh B. Ekhad, N. J. A. Sloane, Doron Zeilberger

备注：: 8 pages, accompanied by a Maple package, and numerous input and output files that can be gotten from http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/CAcount.html

英文摘要：

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears as a coefficient when the polynomial is raised to the power n and the coefficients are read modulo p.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Subcritical monotone cellular automata

We study monotone cellular automata (also known as $\mathcal{U}$-bootstrap percolation) in $\mathbb{Z}^d$ with random initial configurations. Confirming a conjecture of Balister, Bollobás, Przykucki and Smith, who proved the corresponding result in two dimensions, we show that the critical probability is non-zero for all subcritical models.

2022-04-19math.COmath.PR

Signals for Cellular Automata in dimension 2 or higher

We investigate how increasing the dimension of the array can help to draw signals on cellular automata.We show the existence of a gap of constructible signals in any dimension. We exhibit two cellular automata in dimension 2 to show that increasing the dimension allows to reduce the number of states required for some constructions.

2004-12-03cs.CCcs.DCcs.DM

On number of nonzero cells in some two-dimensional reversible second-order cellular automata

Recursive equations for the number of cells with nonzero values at $n$-th step for some two-dimensional reversible second-order cellular automata are proved in this work. Initial configuration is a single cell with the value one and all others zero.

2014-07-24cs.DMmath.COnlin.CG

A uniform approach to soliton cellular automata using rigged configurations

For soliton cellular automata, we give a uniform description and proofs of the solitons, the scattering rule of two solitons, and the phase shift using rigged configurations in a number of special cases. In particular, we prove these properties for the soliton cellular automata using $B^{r,1}$ when $r$ is adjacent to $0$ in the Dynkin diagram or there is a Dynkin diagram automorphism sending $r$ to $0$.

2019-02-11math-phmath.COmath.MP

A converse to Moore's theorem on cellular automata

We prove a converse to Moore's ``Garden-of-Eden'' theorem: a group G is amenable if and only if all cellular automata living on G that admit mutually erasable patterns also admit gardens of Eden. It had already been conjectured in that amenability could be characterized by cellular automata. We prove the first part of that conjecture.

2007-09-26cs.ITmath.COmath.DS

Soliton cellular automata associated with infinite reduced words

We consider a family of cellular automata $Φ(n,k)$ associated with infinite reduced elements on the affine symmetric group $\hat S_n$, which is a tropicalization of the rational maps introduced by two of the authors. We study the soliton solutions for $Φ(n,k)$ and explore a `duality' with the $\mathfrak{sl}_n$-box-ball system.

2018-09-18math-phmath.COmath.MP

更多相关论文收起更多论文

Impartial games emulating one-dimensional cellular automata and undecidability

We study two-player \emph{take-away} games whose outcomes emulate two-state one-dimensional cellular automata, such as Wolfram's rules 60 and 110. Given an initial string consisting of a central data pattern and periodic left and right patterns, the rule 110 cellular automaton was recently proved Turing-complete by Matthew Cook. Hence, many questions regarding its behavior are algorithmically undecidable. We show that similar questions are undecidable for our \emph{rule 110} game.

2012-01-05cs.ITmath.COmath.IT