THE BINARY ADDING MACHINE AND SOLVABLE GROUPS (Q3043632): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: The Generation of GL(n, Z) by Finite State Automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Wreath operations in the group of automorphisms of the binary tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A just-nonsolvable torsion-free group defined on the binary tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4779046 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity. / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1142/s0218196703001328 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2078259496 / rank | |||
Normal rank |
Latest revision as of 09:42, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | THE BINARY ADDING MACHINE AND SOLVABLE GROUPS |
scientific article |
Statements
THE BINARY ADDING MACHINE AND SOLVABLE GROUPS (English)
0 references
6 August 2004
0 references
solvable groups
0 references
automorphism groups
0 references
binary trees
0 references