{"id":"fc452e08-0ef0-4041-8085-d1be013bd6d6","arxiv_id":"2608.09078","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The generating functions for Av(4123,4231,4312) and Av(4123,4312) are shown to be non-D-finite, with proven exponential and n^{-3/2} coefficient asymptotics.","lead":"This paper proves two conjectured growth formulas for permutations that avoid certain four-term patterns, showing their counting sequences are not governed by linear recurrences. A generalist might read it because it turns a difficult combinatorial enumeration problem into solvable q-difference equations.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the reader's Theorem 3.5 concern inverts the kth-root limit, so the quotient formula's analyticity contradiction is valid as written.","rationale":"The reader's REJECT rests entirely on the claim that Theorem 3.5's kth-root growth is reversed. That claim is mistaken: the prefactor is m^{-k(k+3)}, so its kth root is |m|^{-(k+3)} and grows without bound for every fixed 0<|m|<1. The analyticity contradiction therefore works as published, and the quotient formula g^(3) = -S/R is not invalidated. I examined the main proof chain for other soft spots: the local uniform convergence of R_k and S_k, the Wronskian-based non-cancellation, the meromorphic continuation to the unit disc, and the use of infinitely many singularities to rule out D-finiteness. No load-bearing gap emerged. Because the single identified objection does not land, the rejection should be lifted and the claims accepted as internally coherent.","tokens_in":21113,"tokens_out":20072,"duration_ms":182031,"concrete_test":"Recompute the growth of (3.11): for 0<|m|<1, the kth root of |m^{-k(k+3)}| is |m|^{-(k+3)}, which diverges to infinity. If a direct re-derivation of the coefficient formula confirms this prefactor is in the denominator, then Theorem 3.5's contradiction is legitimate and the quotient formula stands.","verdict_should_be":"ACCEPT","load_bearing_attack":"No load-bearing concern survives re-derivation. The reader's weakest assumption concerns Theorem 3.5, but the computation there is opposite to the objection. The coefficient of (-w)^k in Phi_m is ((1+m)(1-m)^2)^k / m^{k(k+3)} times (bg R_k + S_k), with the denominator m^{k(k+3)} explicit. For 0<|m|<1, the kth root of the prefactor is |1+m||1-m|^2 |m|^{-(k+3)}, which tends to infinity, not to 0. Hence, if bg R + S were nonzero, the coefficients would violate the positive radius of convergence of the analytic function Phi_m, and the conclusion bg = -S/R follows exactly as stated. I checked the surrounding steps of Theorem 3.5, including Proposition 3.4's convergence, Theorem 3.12's non-cancellation argument, and Theorem 3.16's dominant-pole analysis, and found no internal inconsistency that would support a rejection. The two-pattern proof in Section 4 likewise does not depend on the contested step. The paper's central claims are not invalidated by any concern I can identify.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper studies the nested permutation classes D^(3) = Av(4123,4231,4312) and D^(2) = Av(4123,4312). Using a succession-rule decomposition and the kernel method, the author derives trivariate generating-function equations whose common kernel, after z = m/(1+m)^2, becomes a q-difference equation with dilation w -> m^2 w. The three-pattern case is solved by coefficientwise iteration into a quotient formula D^(3)(z) = 1 - z S(m)/R(m); analytic and asymptotic analysis shows that R has infinitely many zeros in (0,1), none cancelled by S, so D^(3) is meromorphic in |z| < 1/4 with infinitely many poles, is not D-finite, and its coefficients satisfy d_n^(3) ~ C^(3)(rho^(3))^{-n}. The two-pattern case gives a product-sum representation whose first obstruction is a collision of roots of a quadratic at m^(2) = 0.281971680061..., leading to a square-root singularity at z = 3-2√2 and d_n^(2) ~ C^(2)(3+2√2)^n n^{-3/2}; continuation on a two-sheeted Riemann surface produces infinitely many poles and proves non-D-finiteness. The paper thus proves, rigorously, the experimental asymptotics and non-P-recursive nature conjectured by Albert, Homberger, Pantone, Shar, and Vatter.","tokens_in":21311,"tokens_out":14207,"duration_ms":146748,"significance":"The paper's main contribution is a rigorous resolution of two long-standing test cases at the boundary of exact and experimental enumeration. It gives compact, explicit permutation classes whose counting sequences are provably non-P-recursive, adding to the Garrabrant-Pak phenomenon with much smaller and more natural classes. A particular strength is that the constants in Theorems 1.1 and 1.2 are not fitted to data: they are defined as limits of explicit recurrences or roots of explicit algebraic equations, and the known initial terms are used only as consistency checks. The paper also contains a nontrivial interval-arithmetic certification of the sign of a derivative in Proposition 4.5, and the analytic-continuation argument for the two-pattern class is careful and inventive. I have checked the critical kth-root argument in Theorem 3.5: the prefactor contributes |m|^{-(k+3)} to the kth root, which diverges when 0 < |m| < 1, so the quotient formula g^(3) = -S/R is justified as written. I find no load-bearing error in the manuscript.","major_comments":[],"minor_comments":[{"comment":"The abstract and the first paragraph of the Introduction contain the typo 'generation functions'; this should be 'generating functions'.","section":"Abstract"},{"comment":"In the proof of Theorem 4.6 and in Corollary 4.11, sum closure of D^(2) is asserted without proof, although the analogous statement for D^(3) is proved in Lemma 3.15; the same short pattern-occurrence argument applies to the two sum-indecomposable basis elements and should be stated for completeness.","section":"Section 4"},{"comment":"The remark contains the unproved statement that asymptotically there is only one zero of R per interval; since this assertion is not used in the main theorems, it should be explicitly labelled as an unproved observation or removed.","section":"Remark 3.17"},{"comment":"The decimal constants are asserted to many digits without explicit error bounds or certification of all displayed digits; the paper should state the certified precision or provide interval enclosures, especially since the numerical values appear in the theorems.","section":"Theorems 1.1-1.2, (3.29), (4.20)"},{"comment":"Diacritics are missing in 'Möbius' and 'Schrödinger'; also, the title capitalizes 'q-Difference' while the body uses 'q-difference'.","section":"Throughout"}],"recommendation":"minor_revision","confidential_remarks":"I do not support the rejection suggested by the earlier reading. The alleged flaw in Theorem 3.5 stems from a miscomputation of the kth root of the coefficient in (3.11): the denominator m^{k(k+3)} makes the kth root behave as |m|^{-(k+3)}, which diverges for 0 < |m| < 1. The quotient formula is therefore valid. The paper is scientifically sound and well within the scope of the journal; only local clarifications and presentation fixes are needed."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The rejection recommendation rests on a misreading. The reader's weakest assumption inverts the kth-root computation in Theorem 3.5. The coefficient of (-w)^k in Phi_m is ((1+m)(1-m)^2)^k / m^{k(k+3)} times (bg R_k + S_k). For 0<|m|<1, the kth root of the prefactor is |1+m||1-m|^2 |m|^{-(k+3)}, which tends to infinity, not zero. So nonzero bg R + S really would force coefficients growing faster than any exponential, contradicting the analyticity of Phi_m. The quotient formula stands, and the stress-test note is correct.\n\nWhat is new: the paper supplies rigorous q-difference derivations of the experimentally conjectured asymptotics and non-D-finiteness for two nested permutation classes, Av(4123,4231,4312) and Av(4123,4312). That resolves open problems from Albert et al. and Pantone. The common kernel and the two quite different analytic regimes (theta-type oscillation vs. root collision) are significant pieces of work. The constants are limits of explicit recurrences, not fits. The interval-arithmetic certification of the derivative sign in Proposition 4.5 is responsible. The probabilistic corollaries are a welcome extra.\n\nSoft spots: the paper is dense and will be heavy going for non-specialists. Some numerical evaluations are certified only by interval arithmetic; that is acceptable but warrants referee attention. A few remarks (e.g., 3.17) skip proofs, but they are not load-bearing. The paper does not prove differential transcendence, only non-D-finiteness, and says so. The connection to the Bousquet-Melou-Bouvel-Pantone work is left as a remark, which is honest.\n\nI found no load-bearing flaw. The central arguments are checkable and the results are important. This paper should go to a serious referee.\n\nWho it is for: specialists in enumerative and analytic combinatorics, particularly permutation patterns and q-difference equations. I would bring it to a reading group and cite it.","headline":"The rejection signal rests on a misread kth-root limit in Theorem 3.5; the paper's central claims hold up and it deserves serious refereeing.","tokens_in":21840,"tokens_out":2899,"would_cite":true,"duration_ms":100800,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05A05","05A15","05A16","39A13"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that the generating functions of two nested pattern-avoiding permutation classes are not D-finite, hence their counting sequences are not P-recursive, and it gives exact exponential growth rates for both.","keywords":["pattern-avoiding permutations","q-difference equations","D-finite generating functions","P-recursive sequences","kernel method","permutation classes","analytic combinatorics"],"falsifier":"Check the growth assertion in Theorem 3.5 directly: for fixed $m$ with $0<|m|<1$, the factor $|m|^{k(k+3)}$ in the coefficient formula has $k$-th root $|m|^{k+3}$, which tends to $0$, so the claimed contradiction requires the remaining factors $R_k(m)$ and $S_k(m)$ to grow faster than $|m|^{-k(k+3)}$; verifying whether they do is the decisive calculation.","tokens_in":20903,"feed_emoji":"🧩","tokens_out":13706,"duration_ms":110980,"temperature":0.7,"pith_summary":"Two pattern-avoiding permutation classes, $\\operatorname{Av}(4123,4312)$ and its subclass $\\operatorname{Av}(4123,4231,4312)$, have counting sequences that were known experimentally but not rigorously controlled. The paper constructs a common trivariate generating function that tracks the distinguished suffix of each permutation by two state parameters, and shows both classes obey the same kernel equation. After a change of variables the kernel root acts as the dilation $w\\mapsto m^{2}w$, turning the equations into $q$-difference equations, which are then solved by coefficientwise iteration. The paper's conclusions are that neither generating function is D-finite, so neither coefficient sequence is P-recursive (satisfies a linear recurrence with polynomial coefficients), and that the two growth regimes are distinct: pure exponential growth for the three-pattern class, and a square-root singularity giving an $n^{-3/2}$ factor for the two-pattern class. These are compact, explicit examples where the boundary between exact and experimental enumeration is crossed.","feed_headline":"Two permutation classes escape every polynomial recurrence","feed_subtitle":"Solving q-difference equations pins down both growth rates and rules out polynomial recurrences.","key_machinery":"The load-bearing object is the trivariate generating function $G^{(j)}(z;x,y)=\\sum_{n\\ge1}B_{n}^{(j)}(x,y)z^{n-1}$, where $B_{n}^{(j)}$ records two integers $(k,\\ell)$ attached to the longest terminal suffix of each permutation whose standardization lies in the container class. The common kernel is $(1-y)(1-zx)+zy$; setting $y$ equal to its root and changing variables to $m$ and $w$ turns kernel cancellation into a $q$-difference equation relating $f(w)$ to $f(m^{2}w)$. The remainder of the proof is coefficientwise iteration of that equation: a second-order recurrence for the limits $R_{k}(m)$, $S_{k}(m)$ in the three-pattern case, and a convergent infinite product and sum in the two-pattern case, with the first exceptional event being the collision of two roots of $H_{m}$.","core_discovery":"On the paper's own terms, the central discovery is that the two generating functions $D^{(2)}(z)$ and $D^{(3)}(z)$ obey the same affine kernel equation with root $Y(x)$, and the substitution $z=m/(1+m)^{2}$, $w=(1+m-x)/(1+m-mx)$ sends $Y(x)$ to the dilation $w\\mapsto m^{2}w$. For the three-pattern class, iteration of the resulting $q$-difference equation away from the attracting fixed point produces analytic functions $R(m)$ and $S(m)$ with $D^{(3)}(z)=1-z S(m)/R(m)$; $R(m)$ has infinitely many sign-changing zeros in $(0,1)$ that are not cancelled by $S(m)$, giving infinitely many finite singularities and non-D-finiteness. For the two-pattern class, iteration toward the attracting fixed point yields a convergent product and sum whose first obstruction is the collision of two roots of $H_{m}$ at $m^{(2)}=0.28197\\ldots$; this produces the square-root singularity at $z=3-2\\sqrt{2}$ and $d_{n}^{(2)}\\sim C^{(2)}(3+2\\sqrt{2})^{n}n^{-3/2}$ with $C^{(2)}=0.084983363\\ldots$, while analytic continuation around that branch point creates infinitely many poles, again proving non-D-finiteness. The numerical values in the three-pattern case are $\\rho^{(3)}=0.223793301\\ldots$, $C^{(3)}=0.018967232\\ldots$.","pith_inferences":["The same kernel-and-dilation framework should apply to other pairs of pattern-avoiding classes whose generating functions are suspected to be non-D-finite, with the two regimes here suggesting that the first obstruction of the $q$-difference iteration fixes the singularity type.","The pole positions for $D^{(3)}$ computed from zeros of $R(m)$ match numerically the singularities already observed experimentally; a proof that each oscillation interval of $R$ contains exactly one zero would complete the description of the singularity set accumulating at $1/4$.","The probabilistic limit laws give a testable extension: sampling uniformly random members of these classes should show the stated mean, variance, and limiting distribution for the number of sum-indecomposable components."],"forward_implications":["No linear recurrence with polynomial coefficients can reproduce the counting sequences of either class.","The three-pattern sequence grows purely exponentially, $d_{n}^{(3)}=C^{(3)}(\\rho^{(3)})^{-n}+O((r^{(3)})^{-n})$, certifying the earlier experimental suggestion of pure exponential growth.","The two-pattern sequence has the form $d_{n}^{(2)}\\sim C^{(2)}(3+2\\sqrt{2})^{n}n^{-3/2}$, with a unique dominant square-root singularity at $z=3-2\\sqrt{2}$.","The singularities of $D^{(3)}$ accumulate at $z=1/4$, while the analytic continuation of $D^{(2)}$ has infinitely many poles approaching $z=1/2$.","The probabilistic corollaries hold: the number of sum-indecomposable components in the three-pattern class is asymptotically Gaussian, and in the two-pattern class the limiting component-count distribution is given explicitly by a parameter $\\theta^{(2)}$."],"supporting_citations":[{"why":"Supplies the restricted-container machine whose output is identified with the two pattern-avoiding classes, grounding the succession-rule setup.","marker":"[1]"},{"why":"Supplies the singularity transfer theorems and the quasi-powers theorem used to convert local expansions into coefficient asymptotics and limit laws.","marker":"[4]"},{"why":"Provides the exponential growth bound used to justify convergence of the trivariate generating series near the origin.","marker":"[6]"},{"why":"Gives the equivalence between D-finiteness of an ordinary generating function and P-recursiveness of its coefficients, used to conclude non-P-recursiveness.","marker":"[8]"}],"fun_headline_variants":["q-difference equations crack two non-D-finite permutation classes","Pattern-avoiding classes evade polynomial recurrences","Exact growth rates for two permutation classes from q-differences","No D-finite generating function for these permutation classes","Solving q-difference equations yields sharp asymptotics for permutations"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The three-pattern result depends on the assertion that, if the denominator combination in the quotient formula did not vanish, the coefficients of the auxiliary series $\\Phi_m$ would grow faster than any exponential, contradicting its convergence; that growth assertion is the load-bearing point.","fun_headline_variants_meta":{"raw":{"variants":["q-difference equations crack two non-D-finite permutation classes","Pattern-avoiding classes evade polynomial recurrences","Exact growth rates for two permutation classes from q-differences","No D-finite generating function for these permutation classes","Solving q-difference equations yields sharp asymptotics for permutations"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00037,"raw_usage":{"total_tokens":2003,"prompt_tokens":988,"completion_tokens":1015,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":604,"completion_tokens_details":{"reasoning_tokens":934}},"tokens_in":604,"tokens_out":1015,"duration_ms":9329,"temperature":1.0,"reasoning_tokens":934,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T23:59:36.764753+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Check the growth assertion in Theorem 3.5 directly: for fixed $m$ with $0<|m|<1$, the factor $|m|^{k(k+3)}$ in the coefficient formula has $k$-th root $|m|^{k+3}$, which tends to $0$, so the claimed contradiction requires the remaining factors $R_k(m)$ and $S_k(m)$ to grow faster than $|m|^{-k(k+3)}$; verifying whether they do is the decisive calculation.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the restricted-container machine whose output is identified with the two pattern-avoiding classes, grounding the succession-rule setup."},{"cited_title":"Flajolet and R","cited_arxiv_id":null,"evidence_quote":"Supplies the singularity transfer theorems and the quasi-powers theorem used to convert local expansions into coefficient asymptotics and limit laws."},{"cited_title":"Marcus and G","cited_arxiv_id":null,"evidence_quote":"Provides the exponential growth bound used to justify convergence of the trivariate generating series near the origin."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the equivalence between D-finiteness of an ordinary generating function and P-recursiveness of its coefficients, used to conclude non-P-recursiveness."}],"review_version":1}