Almost all continued-fraction strings have no nontrivial symmetries
Statement
Let be a string of positive integers. A nontrivial symmetry of is a permutation of such that , , and . For , let denote the proportion of unordered -tuples of distinct positive integers at most that have a permutation with a nontrivial symmetry.
Almost-symmetry-free strings conjecture. For any integer ,
The conjecture generalizes the observed behavior for strings of lengths , , and , and would imply that nontrivial symmetries are rare among strings of every fixed length at least four. The paper presents numerical evidence but does not establish the limit in general.
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.