New Andrews–Curtis trivializations for Miller–Schupp group presentations

We present recent developments in the applications of automated theorem proving in the investigation of the Andrews–Curtis conjecture. We demonstrate previously unknown trivializations of group presentations from a parametric family M S n ( w ∗ ) of trivial group presentations for n = 3 , 4 , 5 , 6 , 7 , 8 (subset of well-known Miller–Schupp family). Based on the human analysis of these trivializations we formulate two conjectures on the structure of simplifications for the infinite family M S n ( w ∗ ) , n ≥ 3 . • New examples of Andrews–Curtis trivilaizations are demonstrated. • Two conjectures on structural properties of trivializations sequences are presented. • The strength of generic automated reasoning methods in group theory is demonstrated.

Authors

Institutions

Publication Details

Journal
Examples and Counterexamples
Published
2024-11-06
DOI
https://doi.org/10.1016/j.exco.2024.100168
Citations
2
Primary Topic
Advanced Topics in Algebra
Type
article
Field-Weighted Citation Impact
2.54
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

New Andrews–Curtis trivializations for Miller–Schupp group presentations

Alexei Lisitsa
2 citations
Examples and Counterexamples
Advanced Topics in Algebra
2.54
article

New Andrews–Curtis trivializations for Miller–Schupp group presentations

Alexei Lisitsa
article en
2 citations

Abstract

We present recent developments in the applications of automated theorem proving in the investigation of the Andrews–Curtis conjecture. We demonstrate previously unknown trivializations of group presentations from a parametric family M S n ( w ∗ ) of trivial group presentations for n = 3 , 4 , 5 , 6 , 7 , 8 (subset of well-known Miller–Schupp family). Based on the human analysis of these trivializations we formulate two conjectures on the structure of simplifications for the infinite family M S n ( w ∗ ) , n ≥ 3 . • New examples of Andrews–Curtis trivilaizations are demonstrated. • Two conjectures on structural properties of trivializations sequences are presented. • The strength of generic automated reasoning methods in group theory is demonstrated.

Examples and CounterexamplesVol. 6
University of Liverpool (GB)
Openalex Percentile: Top 10%
Advanced Topics in Algebra
2.54
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.