Markus Redeker<p>Number-conserving cellular automata can be thought as simulating particle systems, like grains of sand or cars in a street.</p><p>I have just placed a text about one-dimensional number-conserving cellular automata into the arXiv (<a href="https://arxiv.org/abs/2308.00060" rel="nofollow noopener" target="_blank"><span class="invisible">https://</span><span class="">arxiv.org/abs/2308.00060</span><span class="invisible"></span></a>). It is a kind of sequel to an earlier paper, in which I had derived a general construction scheme for all such automata. But a lot of things are still unknown, and the theory of such automata looks quite interesting. In my new paper I prove some new theorems, describe how to simulate the automata on a computer and how to find interesting rules, and I show images of a few rules I have found this way. Comments are welcome!</p><p><a href="https://mathstodon.xyz/tags/CellularAutomata" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CellularAutomata</span></a> <a href="https://mathstodon.xyz/tags/NumberConservation" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>NumberConservation</span></a></p>