Homomorphisms and algorithmic problems in projective planes
DOI10.1007/BF00971195zbMATH Open0778.51001MaRDI QIDQ684698FDOQ684698
Publication date: 27 September 1993
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Generators, relations, and presentations of groups (20F05) General theory of linear incidence geometry and projective geometries (51A05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Homomorphism, automorphism and dualities in linear incidence geometry (51A10) Word problems, etc. in computability and recursion theory (03D40)
Cites Work
Cited In (5)
- Complexity of the isomorphism problem for computable free projective planes of finite rank
- Some algorithmic problems for projective planes
- On closure of configurations in freely generated projective planes
- Discrete planes, \({\mathbb Z}^2\)-actions, Jacobi-Perron algorithm and substitutions
- On the \(\forall \exists \)-theories of free projective planes
This page was built for publication: Homomorphisms and algorithmic problems in projective planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684698)