Pages that link to "Item:Q2456603"

The following pages link to Computing polycyclic presentations for polycyclic rational matrix groups. (Q2456603):

Displaying 16 items.

• The automorphism group of a finitely generated virtually abelian group. (Q285908) (← links)
• The construction of finite solvable groups revisited. (Q402704) (← links)
• Irreducibility testing of finite nilpotent linear groups. (Q606660) (← links)
• Algorithms for the Tits alternative and related problems. (Q765725) (← links)
• Orbit-stabilizer problems and computing normalizers for polycyclic groups. (Q1864872) (← links)
• Practical algorithms for polycyclic matrix groups (Q1974695) (← links)
• Computation of orders and cycle lengths of automorphisms of finite solvable groups (Q2048160) (← links)
• Linear groups and computation (Q2292421) (← links)
• Algorithms for linear groups of finite rank. (Q2438392) (← links)
• Computing conjugacy classes of elements in matrix groups. (Q2438900) (← links)
• Computing polycyclic presentations for polycyclic rational matrix groups. (Q2456603) (← links)
• Algorithms for computing with nilpotent matrix groups over infinite domains. (Q2481472) (← links)
• Special polycyclic generating sequences for finite soluble groups. (Q2643571) (← links)
• On the Frattini subgroup of a polycyclic group (Q2664510) (← links)
• The constructive membership problem for discrete free subgroups of rank 2 of \(\mathrm{SL}_2(\mathbb R)\). (Q2878809) (← links)
• Testing polycyclicity of finitely generated rational matrix groups (Q3433778) (← links)