ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let K(n,k,l)K(n,k,l) be the recursively defined array of integers associated with the pascalized coupled Young graph, with n≥3n\geq 3, k,lk,l satisfying 2k+l<n−22k+l<n-2 and 2k+l≡n(mod2)2k+l\equiv n\pmod 2. Monotonicity conjecture for KK. One has

K(n−2,k,l)K(n,k,l)≥max⁡(K(n−2,k+1,l)K(n,k+1,l),K(n−2,k,l+2)K(n,k,l+2)).\frac{K(n-2,k,l)}{K(n,k,l)}\geq\max\left(\frac{K(n-2,k+1,l)}{K(n,k+1,l)},\frac{K(n-2,k,l+2)}{K(n,k,l+2)}\right).

In particular,

max⁡2k+l<n2k+l≡n(mod2)K(n−2,k,l)K(n,k,l)=K(n−2,0,δ(n))K(n,0,δ(n)),\max_{\substack{2k+l<n\\2k+l\equiv n\pmod 2}}\frac{K(n-2,k,l)}{K(n,k,l)}=\frac{K(n-2,0,\delta(n))}{K(n,0,\delta(n))},

where δ(n)=0\delta(n)=0 if nn is even and δ(n)=1\delta(n)=1 if nn is odd. The paper reports verification for many cases but no proof, and presents this numerical claim as implying the preceding boundary-support conjecture.

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.