ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S10S_{10} be the number of odd descent-tops, S12S_{12} the number of (odd,odd)(\text{odd},\text{odd}) pairs, and S17S_{17} the maximal subsequence of the form 12…i1 2\ldots i in a permutation. Let T1T_1 count occurrences of S10S_{10} but not S12S_{12}, let T2T_2 count occurrences of S12S_{12} but not S10S_{10}, and let T3T_3 count occurrences of both S10S_{10} and S12S_{12}. Write (A1,…,Ak)∼(B1,…,Bk)(A_1,\ldots,A_k)\sim(B_1,\ldots,B_k) when the two tuples are equidistributed. Refined joint equidistribution conjecture.

(T1,T2,T3,S17)∼(T2,T1,T3,S17).(T_1,T_2,T_3,S_{17})\sim(T_2,T_1,T_3,S_{17}).

This refinement is intended to preserve the statistic counting pairs that are simultaneously S10S_{10} and S12S_{12} while exchanging the two individual statistics; the source presents it as a likely consequence of the preceding 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.