ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be an even integer, possibly nonpositive, and let j>0j>0. Set

v=(n,−1).v=(n,-1).

Let tt be either the sequence (−1)vj−1(-1)v^{j-1} or the sequence vj−1nv^{j-1}n; both have length 2j−12j-1. The map C−1,n(−1,−)C_{-1,n}(-1,-) is defined using the extension of Cm,nC_{m,n} to distinct integer values of m,nm,n and finite sequences with entries in {m,n}\{m,n\}. Negative-alphabet maximal-orbit conjecture. The orbit of either such sequence tt under C−1,n(−1,−)C_{-1,n}(-1,-) has length 2j2^j. This generalizes the positive-alphabet maximal-orbit conjecture to the case m=−1m=-1.

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.