Knight's limiting-density conjecture for one-relator groups
Statement
For a fixed integer , consider groups given by presentations with a fixed -tuple of generators and one relator, in the Kapovich–Schupp model. For an elementary first-order sentence , let its limiting density be the limit, when it exists, of the proportion of such presentations with relators of length at most whose resulting group satisfies as . Knight's conjecture. For every elementary first-order sentence , this limiting density exists, and it equals if is true in the non-abelian free groups and otherwise. The conjecture says that, in the limiting-density sense, the typical one-relator group has the same elementary first-order theory as the non-abelian free groups. Sela's theorem, also known through work of Kharlampovich and Miasnikov, shows that all non-abelian free groups have the same elementary first-order theory; the limiting-density assertion for one-relator groups remains open.
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.