Computing in matrix groups without memory

DOI10.4086/cjtcs.2014.008zbMath1319.68091arXiv1310.6009OpenAlexW2126703024MaRDI QIDQ5173198

Maxmilien Gadouleau, Peter J. Cameron, Ben T. Fairbairn

Publication date: 9 February 2015

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.6009

zbMATH Keywords

generating setsmatrix groupsgeneral linear groupspecial linear grouplinear functionsmemoryless computationsequential updates

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Linear algebraic groups and related topics (20G99)

Related Items (2)

Memoryless computation: new results, constructions, and extensions ⋮ Complete simulation of automata networks

Cites Work

• Some groups generated by transvection subgroups
• Closed iterative calculus
• Elementary decompositions of arbitrary maps over finite sets
• Unnamed Item

This page was built for publication: Computing in matrix groups without memory