The following pages link to (Q4398784):
Displaying 11 items.
- The robot cleans up (Q849139) (← links)
- Complexity of Langton's ant (Q1348376) (← links)
- Fully packed \(O\) \((n=1)\) model on random Eulerian triangulations (Q1572121) (← links)
- Recognizing the repeatable configurations of time-reversible generalized Langton's ant is PSPACE-hard (Q1736474) (← links)
- An elementary approach to the study of Somos sequences (Q2285411) (← links)
- ReGale: some memorable results (Q2389290) (← links)
- On Somos-4 and Somos-5 sequences (Q2666617) (← links)
- The Robot Cleans Up (Q5505669) (← links)
- Shadow sequences of integers: from Fibonacci to Markov and back (Q6169825) (← links)
- On periodicity of the Somos sequences modulo \(m\) (Q6569612) (← links)
- Continued fractions for \(q\)-deformed real numbers, \(\{-1,0,1\}\)-Hankel determinants, and Somos-Gale-Robinson sequences (Q6632121) (← links)