Query-complexity conjecture for amenable group presentations
Statement
Let be a finite generating set and let be a finite set of relators such that
is a finitely presented amenable group. Let the Følner function of measure the sizes of Følner sets needed to achieve prescribed invariance. Query-complexity conjecture. The relator set is testable with query complexity bounded above by a function of , , and the Følner function of . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.