Lehnert’s conjecture
Lehnert’s conjecture
For every finitely generated group , has co-context-free word problem if and only if embeds into Thompson's group . Explicitly, for a finite generating set of , the complement of the word problem is a context-free language if and only if there exists an injective homomorphism .
Equivalent formulations 1
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
Lehnert's conjecture via the universal group
The conjecture is equivalently formulated by replacing Thompson's group with the universal group : a finitely generated group has co-context-free word problem if and only if it embeds into .
Sources & referencesView supporting material
Primary source
Additional references
- arXiv:2608.02111v1 — arXiv
Progress summary
Recent work supports Lehnert’s conjecture and rules out several proposed counterexamples, but it does not prove the conjecture.
Lehnert’s conjecture asserts that a finitely generated group is co-context-free exactly when it embeds into Thompson’s group . Earlier work reformulated the conjecture using the universal group .
Known results
- embeds into , giving an equivalent formulation of the conjecture (2013).
2026 embedding results
Two 2026 papers characterize embeddings into through finitely many context-free subgroups or faithful context-free actions. They unify all previously known co-context-free examples inside and exclude, among others, Grigorchuk’s group, the Basilica group, and the Hanoï Towers groups; an independent proof by Henry Jaspars is also reported. The authors explicitly present this as evidence, not a proof of Lehnert’s conjecture.
Current status (as of August 2026): Lehnert’s conjecture remains open; substantial embedding criteria and exclusions support it, but no proof or counterexample has been reported.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.