Asymptotic count of length-four continued-fraction strings with nontrivial symmetries
Statement
For a string of positive integers, call a permutation-induced equality nontrivial when and . Let be the number of unordered -tuples of distinct positive integers at most having a permutation with a nontrivial symmetry, and let .
Length-four symmetry-count conjecture.
and
The second assertion is stronger than the first and predicts that the number of exceptional -tuples has polynomial growth of exponent one, while the observed proportion tends to zero. The paper notes that its construction already gives the corresponding lower-bound exponent, but the upper bound 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.