Pages that link to "Item:Q1097350"
From MaRDI portal
The following pages link to Towards a soluble quotient algorithm (Q1097350):
Displaying 18 items.
- An \(L_2\)-quotient algorithm for finitely presented groups on arbitrarily many generators. (Q479797) (← links)
- Generating fast Fourier transforms of solvable groups (Q597054) (← links)
- Existence and efficient construction of fast Fourier transforms on supersolvable groups (Q685713) (← links)
- Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm (Q915859) (← links)
- Computing with Abelian sections of finitely presented groups (Q1291087) (← links)
- A polycyclic quotient algorithm (Q1382042) (← links)
- Computing subgroups by exhibition in finite solvable groups (Q1599538) (← links)
- An algorithm to prove algebraic relations involving eta quotients (Q1653317) (← links)
- Computing stable epimorphisms onto finite groups (Q1757001) (← links)
- A finite soluble quotient algorithm (Q1897565) (← links)
- Universal covers of finite groups (Q2216564) (← links)
- Algorithms determining finite simple images of finitely presented groups (Q2326469) (← links)
- Some remarks on the computation of complements and normalizers in soluble groups (Q2639959) (← links)
- Algorithms for finite soluble groups and applications (Q2762217) (← links)
- Representing Subgroups of Finitely Presented Groups by Quotient Subgroups (Q2775765) (← links)
- Approximating the Schur multiplier of certain infinitely presented groups via nilpotent quotients (Q3092001) (← links)
- A presentation for a crossed embedding of finite solvable groups (Q4290589) (← links)
- A method for building permutation representations of finitely presented groups (Q5138285) (← links)
