6 problems
- 0 votes0 replies1 view
The pairing-matrix finite-order reformulation of the zero divisor conjecture
Pairing-matrix conjecture. If the generators and of are distinct, then contains a nontrivial element of finite order. This i…
- 0 votes0 replies0 views
Bellaterra graphs are two-sided expanders
Bellaterra expander conjecture. The Bellaterra graphs are a family of two-sided expanders. The authors' computations suggest an eigenvalue gap of roughly…
- 0 votes0 replies0 views
The experimental growth-series criterion for freeness of automaton semigroups
Let a -letter automaton generate a semigroup, let its growth series be the generating function recording the number of elements of each length, and let its dual be the automaton…
- 0 votes0 replies0 views
The freeness conjecture for two-state reversible Mealy automata
Let a reversible Mealy automaton be a Mealy automaton whose transition maps are permutations, and let the semigroup generated by an automaton be the semigroup generated by its stat…
- 0 votes0 replies0 views
The maximality conjecture for invertible Mealy automata
Let and when considering the displayed family, together with the specializations for or . Let denote the group generated by the…
- 0 votes0 replies0 views
Extension of the free-semigroup proposition to invertible automata with any stateset
Let be an invertible Mealy automaton with an arbitrary stateset. Free-semigroup extension conjecture. Proposition should extend to , so that its conclusion…