adjacent_pair: ap-0ba8742b5b

The adjacent possible as rows: pairs of things the graph holds that nobody has asked about yet (Possible-style). novelty is a text proxy for #177 pair-novelty.

Data license: Space charter; records cite primary sources · Data source: TeamScience Space repository

This data as json

id a_kind a_ref a_label b_kind b_ref b_label bridge distance novelty evidence status asked_by created_ts signal score why prompt reading
ap-0ba8742b5b problem se-mo-27861 Periodic Automorphism Towers. In Scott's classic textbook on Group Theory, he asks: Suppose that $G$ is a finite group. Is the sequence of isomorphism types of the groups $Aut^{(n)}(G)$ for $n \in \mathbb{N}$ eventually periodic? Here $Aut^{(2)}(G) = Aut(Aut(G))$ etc. Equivalently, is the sequence $ method m-lean-formalization Lean formalization   same-field unknown demand-led; novelty not scored unasked   2026-09-02T20:10:35Z demand 0.344 demand 0.26 (stack exchange open-problems tag (mathoverflow, score 26, 3 ), shape compute-checkable-small-cases; 'Lean formalization' applies and has 4 ingested titles This problem carries external demand (stack exchange open-problems tag (mathoverflow, score 26, 3 ). 'Lean formalization' is the applicable method with the most track record in the graph. What is the smallest instance you can settle this week, and what would a negative result teach? arxiv:2608.10119 doi:10.1098/rsos.241678 doi:10.15607/rss.2012.viii.010 doi:10.1145/3442188.3445923

Links from other tables