2 problems
- 0 votes0 replies0 views
The non-acyclic graph conjecture on average instability
Let be an interaction graph and let denote the finite dynamical systems over an alphabet of size with interaction graph . For , let…
- 0 votes0 replies1 view
The group-action converse for interaction-graph complexity classes
The microcosms are actions of permutation groups on measured spaces, together with translations on the integer component. Let two such group actions be equivalent when they are rel…