A Theoretical Review on Solving Algebra Problems

TL;DR

The paper tackles the lack of theoretical grounding in algebra problem-solving (AP) algorithms by introducing State Transform Theory (STT), which models solving processes as state–transform graphs to enable decomposability and cross-algorithm comparison. Building on STT, the authors formulate State Transform Analysis (STA) to depict 47 representative AP solvers since 2014, identifying 17 core states and 42 transforms, and they synthesize these into an aggregated state graph and a four-approach taxonomy. They further introduce Perspective Confusion Comparison (PCC) as a three-dimensional evaluation framework that examines transforms, algorithms, and approaches across problem types, revealing strengths and gaps beyond traditional ablation studies. The work also outlines six future research directions, including extending to compound objects and diagrams, integrating LLMs, and developing solving engines that combine multiple methods. Overall, the framework provides a theory-grounded foundation for evaluating, comparing, and guiding the development of AP-solving algorithms with potential impact on educational technology and AI-assisted math reasoning.

Abstract

Solving algebra problems (APs) continues to attract significant research interest as evidenced by the large number of algorithms and theories proposed over the past decade. Despite these important research contributions, however, the body of work remains incomplete in terms of theoretical justification and scope. The current contribution intends to fill the gap by developing a review framework that aims to lay a theoretical base, create an evaluation scheme, and extend the scope of the investigation. This paper first develops the State Transform Theory (STT), which emphasizes that the problem-solving algorithms are structured according to states and transforms unlike the understanding that underlies traditional surveys which merely emphasize the progress of transforms. The STT, thus, lays the theoretical basis for a new framework for reviewing algorithms. This new construct accommodates the relation-centric algorithms for solving both word and diagrammatic algebra problems. The latter not only highlights the necessity of introducing new states but also allows revelation of contributions of individual algorithms obscured in prior reviews without this approach.

Figures (6)

• Figure 2: Two representations of state transform graphs for $\mathcal{A}_{07}$: (a) using the terminology from the original paper, and (b) adopting the notations introduced in this paper.
• Figure 3: Two representations of state transform graphs for $\mathcal{A}_{27}$: (a) using the terminology from the original paper, and (b) adopting the notations introduced in this paper.
• Figure 4: The aggregated graph of the identified 47 algorithms.
• Figure 5: The state graph of the algorithm set $\mathcal{A}=\{\mathcal{A_{01}},\mathcal{A_{02}},\dots,\mathcal{A_{47}}\}$.
• Figure 6: Four graphs of depicting the identified four approaches from Figure \ref{['fig-state graph']}.

Theorems & Definitions (14)

• Definition 1: Corpus
• Definition 2: Solving Algorithm
• Definition 3: State
• Definition 4: Transform
• Definition 5: State Transform Graph
• Definition 6: Decomposable Algorithm
• Definition 7: State Transform Analysis (STA)
• Definition 8: Aggregated Graph
• Definition 9: State Graph
• Definition 10: Understood State