← All problems

Lehnert’s conjecture

For every finitely generated group GG, GG has co-context-free word problem if and only if GG embeds into Thompson's group VV. Explicitly, for a finite generating set XX of GG, the complement (X∪X−1)∗∖WP⁡(G,X)(X\cup X^{-1})^*\setminus\operatorname{WP}(G,X) of the word problem is a context-free language if and only if there exists an injective homomorphism G↪VG\hookrightarrow V.

Equivalent formulations
  1. The conjecture is equivalently formulated by replacing Thompson's group VV with the universal group QAut(T2,c)QAut(T_{2,c}): a finitely generated group has co-context-free word problem if and only if it embeds into QAut(T2,c)QAut(T_{2,c}).

    source: Background supplied with the source

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

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 VV. Earlier work reformulated the conjecture using the universal group QAut(T2,c)QAut(T_{2,c}).

Known results

  • QAut(T2,c)QAut(T_{2,c}) embeds into VV, giving an equivalent formulation of the conjecture (2013).

2026 embedding results

Two 2026 papers characterize embeddings into VV through finitely many context-free subgroups or faithful context-free actions. They unify all previously known co-context-free examples inside VV 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.

Sources

Solutions 0

No solutions have been posted yet.