ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a finite generating set and let EE be a finite set of relators such that

Γ=⟨S∣E⟩\Gamma=\langle S\mid E\rangle

is a finitely presented amenable group. Let the Følner function of Γ\Gamma measure the sizes of Følner sets needed to achieve prescribed invariance. Query-complexity conjecture. The relator set EE is testable with query complexity bounded above by a function of ∣S∣|S|, ∑w∈E∣w∣\sum_{w\in E}|w|, and the Følner function of Γ\Gamma. This conjecture concerns quantitative testability for amenable group presentations; the supplied source presents it as an open conjecture and gives no resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.