A Universal Cellular Automaton on the Ternary Heptagrid

In this paper, we construct the first weakly universal cellular automaton on the ternary heptagrid. It requires six states only. It provides a universal automaton with less states than in the case of the pentagrid where the best result is nine states, a result also recently established by the authors.