ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m≥3m\geq 3 be an integer, let V={1,2,…,m−1}V=\{1,2,\dots,m-1\}, and let D(m,V)D^{(m,V)} denote the generating series for Dyck paths whose peaks avoid the heights in the congruence classes specified by (m,V)(m,V). Write H(D(m,V))H(D^{(m,V)}) for the sequence of Hankel determinants of this series.

Extremal-set periodicity conjecture. The sequence H(D(m,V))H(D^{(m,V)}) is periodic and has the form

H(D(m,V))={(1,0,…,0⏟m−2,1,1)∗if m≡1,2(mod4),(1,0,…,0⏟m−2,−1,−1,−1,0,…,0⏟m−2,1,1)∗if m≡0,3(mod4).H\big(D^{(m,V)}\big)=\begin{cases} (1,\underbrace{0,\dots,0}_{m-2},1,1)^* & \text{if }m\equiv 1,2\pmod{4},\\ (1,\underbrace{0,\dots,0}_{m-2},-1,-1,-1,\underbrace{0,\dots,0}_{m-2},1,1)^* & \text{if }m\equiv 0,3\pmod{4}. \end{cases}

This gives an explicit periodic sequence for the extremal avoiding set. The paper presents this as part of its investigation of periodicity; the concluding remarks state that many periodic cases remain outside the sufficient condition and pose broader questions about characterizing all pairs (m,V)(m,V) with periodic H(D(m,V))H(D^{(m,V)}).

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.