The following pages link to Verifying nilpotence (Q580975):
Displaying 16 items.
- Collection from the left and other strategies (Q802744) (← links)
- Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm (Q915859) (← links)
- A note on division orderings on strings (Q918714) (← links)
- Some experiments with a completion theorem prover (Q1186705) (← links)
- Weights for total division orderings on strings (Q1346630) (← links)
- Some remarks on the computation of complements and normalizers in soluble groups (Q2639959) (← links)
- Basic Commutators in Weights Six and Seven as Relators (Q3525191) (← links)
- On the Right and Left 4-Engel Elements (Q3562307) (← links)
- Soluble groups with a finite rewriting system (Q4289419) (← links)
- The order types of termination orderings on monadic terms, strings and multisets (Q4358058) (← links)
- Algebra and automated deduction (Q4647540) (← links)
- Extensions and comparison of simplification orderings (Q5055737) (← links)
- Conditional semi-Thue systems for presenting monoids (Q5096810) (← links)
- 4-ENGEL GROUPS ARE LOCALLY NILPOTENT (Q5703668) (← links)
- PATCH graphs: an efficient data structure for completion of finitely presented groups (Q6560376) (← links)
- Milnor invariants of braids and welded braids up to homotopy (Q6592997) (← links)
