ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a=(a1,…,an)\mathbf{a}=(a_1,\dots,a_n) be a string of positive integers. A nontrivial symmetry of a\mathbf{a} is a permutation σ\sigma of 1,…,n1,\dots,n such that σ(a)≠a\sigma(\mathbf{a})\ne\mathbf{a}, σ(a)≠a←\sigma(\mathbf{a})\ne\overleftarrow{\mathbf{a}}, and PGK(σ(a))=PGK(a)P_{GK}(\sigma(\mathbf{a}))=P_{GK}(\mathbf{a}). For n≥4n\ge4, let δ(N,n)\delta(N,n) denote the proportion of unordered nn-tuples of distinct positive integers at most NN that have a permutation with a nontrivial symmetry.

Almost-symmetry-free strings conjecture. For any integer n≥4n\ge4,

lim⁡N→∞δ(N,n)=0.\lim_{N\to\infty}\delta(N,n)=0.

The conjecture generalizes the observed behavior for strings of lengths 44, 55, and 66, 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 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.