Open Research Index

Verified finite automata for finitely generated subgroups of F₂

Arthur Freitas Ramos

Palomar Registrypalomar/PALOMAR-2026-09-23-000004Sep 23, 2026math.GRscore 0

Source-based formalization of the classical Stallings finite-graph recognition theorem. It gives an executable finite folding construction for every finite list of words in the rank-two free group, with exact subgroup-membership correctness. The least deterministic fold congruence is computed by finite exhaustive search; there is no complexity claim or implementation of core trimming, subgroup bases, intersections, or index algorithms.

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-09-23-000004
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-23-000004/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-23-000004/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'