Asymptotic ratio of late-growing permutations

Prove or disprove that the ratio \(|\Phi_p|/(2p-2)!\), where \(\Phi_p\) is the set of late-growing permutations contributing to the monomial evaluation of \(\consta(p)\), converges from above to \(1\) as \(p\to\infty\).

Background

The monomial specialization reduces the computation of $\consta(p)$ to a signed sum over the contributing set Φp\Phi_p of late-growing permutations. The paper tabulates the first several values of ∣Φp∣|\Phi_p| and observes that the normalized ratio ∣Φp∣/(2p−2)!|\Phi_p|/(2p-2)! appears to decrease toward one.

The stated conjecture concerns the limiting behavior of the odd-indexed subsequence of late-growing permutation counts. It remains unresolved in the paper.

References

As p\to +\infty, the ratio |\Phi_p| \big/ (2p-2)! converges from above to~1+0.

— New integer sequence OEIS A392714 counts Wronskians: fast evaluation via late-growing permutations  (2610.08636 - Shah et al., 6 Oct 2026) in Section 3, immediately following Remark 3.3, Conjecture