{"id":"c7f573f8-da57-4396-b235-ae1092977106","arxiv_id":"1908.04025","paper_version":4,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Nine classes of pattern-avoiding uniquely sorted permutations are enumerated via bijections with Dyck, S-Motzkin, and Schröder paths, confirming Defant's conjectures.","lead":"This combinatorics paper proves nine conjectures about the number of uniquely sorted permutations that avoid two specified patterns, by constructing bijections to lattice paths. The counts are known sequences such as binomial coefficients and 3-Catalan numbers, so the results give exact formulas for new classes of permutations.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 7.1 rests on an unproved functional equation: the reduction to Defant's Theorem 8.1 is asserted, not derived, for U(231,4312).","rationale":"I reviewed the bijective proofs in Sections 4-6 and found no internal contradiction; the decompositions (vee/modsvee, stair-svee, stair-layered, svee-increasing, vee-layered, vee-step) are coherent, and citations such as the swu bijection in Theorem 5.7 are to published work. The only load-bearing gap is Section 7: the paper derives a generating function for nice permutations but does not derive the functional equation that counts all permutations, deferring instead to Defant's Theorem 8.1 for a different class. That omitted derivation is the entire enumeration in Theorem 7.1, so the claim is not self-contained. I agree with the reader's identification of this weakness. The asserted equation is consistent with the low-order coefficients of C(xC(x)) (1,1,3,11,44), so the result is plausible, but the proof requires the missing step. No other concern rose to the same level; minor typos (e.g., “avoids 321” in Theorem 5.5 and “312,2431” in the proof of Theorem 5.4) do not affect the arguments.","tokens_in":17188,"tokens_out":21884,"duration_ms":213257,"concrete_test":"Independently re-derive the asserted equation B~(x)=x+xC(x^2)B~(x)^2 from the nice-permutation generating function x^2C(x^2)B~(x) by writing the generating function of all elements of U(231,4312) as the length-one term plus the non-nice elements, and by verifying that the non-nice decomposition is a bijection with nice × arbitrary U(231,4312). If this derivation cannot be completed without the exact argument in Defant [8, Thm. 8.1], Theorem 7.1 is unsupported.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Section 7 is the only place where the paper does not carry out its own enumeration. After the nice-permutation decomposition, the paper obtains only the generating function x^2 C(x^2) B~(x) for nice permutations in U(231,4312). It then states that “the rest of the proof is identical to that of Theorem 8.1 in Defant’s article [8]” and asserts B~(x) = x + xC(x^2) B~(x)^2, from which B(x)=C(xC(x)) follows. This equation is the entire counting step for Theorem 7.1; it is never derived, and the cited proof concerns the different class U(231,4132). To pass from the nice-permutation gf to the asserted equation one must show how non-nice permutations are recursively decomposed (e.g., that a non-nice element splits into a nice element and an arbitrary element), and that this decomposition preserves 231 and 4312 avoidance and unique sortedness. None of this is shown. Since Theorem 7.1 is one of the nine central claims, the unsupported equation makes that enumeration conditional. The other sections’ bijections are structured and checkable, but this section’s central identity is externally asserted.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies uniquely sorted permutations (permutations with fertility 1 under West's stack-sorting map) that avoid one pattern of length 3 and one of length 4. It proves nine of Defant's conjectures by establishing bijections between these classes and lattice paths (Dyck paths, S-Motzkin paths, and a subclass of Schröder paths) and by a generating function argument. The enumerations include binomial coefficients, 3-Catalan numbers, little Schröder numbers, and coefficients of C(xC(x)).","tokens_in":17412,"tokens_out":4326,"duration_ms":40406,"significance":"If the gap in Section 7 is repaired, the paper settles nine conjectures in the enumeration of pattern-avoiding uniquely sorted permutations. The bijections in Sections 4-6 are largely explicit and reversible, and they introduce useful structural notions (modsvee, modvee, stair-svee, stair-layered, svee-increasing, vee-layered, vee-step). The generating-function route in Section 7 is the only part that is not fully carried out in the manuscript.","major_comments":[{"comment":"The proof of Theorem 7.1 stops at the generating function for nice permutations, x^2 C(x^2) \\tilde B(x), and then asserts the functional equation \\tilde B(x) = x + x C(x^2) \\tilde B(x)^2, saying that the rest of the proof is identical to that of Theorem 8.1 in Defant's article [8]. This equation is not derived for the class U_{2k+1}(231,4312), and Theorem 8.1 of [8] concerns the different class U_{2k+1}(231,4132). The author must show how non-nice permutations are recursively decomposed (for example, that a non-nice element can be split into a nice element and an arbitrary element) and must verify that the decomposition preserves 231 and 4312 avoidance and unique sortedness. As written, the enumeration of this class is unsupported, and Theorem 7.1 is one of the paper's nine central claims.","section":"7, proof of Theorem 7.1"}],"minor_comments":[{"comment":"The proof begins \"Given π ∈ U_{2k+1}(132, 312)\", but the statement is about U_{2k+1}(231,312); the class name should be corrected.","section":"Lemma 3.3"},{"comment":"The proof says \"Consider some π ∈ U(312, 2431)\", but the theorem is about U_{2k+1}(312,3421); also the final equality omits the subscript 2k+1 and should read |U_{2k+1}(312,3421)|.","section":"Theorem 5.4"},{"comment":"The inverse of the described bijection is only implicit in the sentence about recovering the type of ascent; a precise reconstruction of a stair-svee permutation from an S-Motzkin path would make the bijection easier to verify.","section":"Theorem 5.3"},{"comment":"The notation for the generating function \\tilde B(x) alternates between \"B~(x)\" and \"~B(x)\", and the equality \\tilde B(x) = x + x C(x^2) \\tilde B(x)^2 is introduced without derivation; at minimum the notation should be made consistent.","section":"Section 7"},{"comment":"The preservation of the canonical hook configuration under the modvee/mod-svee inversion is argued in one sentence (\"by the logic in the lemmas\"); a few more details would make this central step easier to check.","section":"Theorem 4.2"}],"recommendation":"major_revision","confidential_remarks":"The gap in Section 7 is substantive but local: the rest of the paper is built on explicit bijections that appear checkable, and the author has a plausible route to completing the missing functional equation. I would not reject the manuscript, but the proof of Theorem 7.1 must be completed or clearly reduced to Defant's argument with all necessary checks spelled out."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The short version: this paper proves nine of Defant's eighteen open conjectures for two-pattern uniquely sorted permutation classes, mostly by explicit bijections with lattice paths. The main results are real: Theorem 4.1 and 4.2 for binomial coefficient classes, Theorems 5.3-5.7 for 3-Catalan classes via S-Motzkin paths, and Theorem 6.1 for little Schroder numbers. The S-Motzkin path bijections are a genuinely new tool in this area, and the structural decompositions of the pattern-avoiding classes (stair-svee, svee-increasing, vee-layered, etc.) are detailed and checkable.\n\nWhat the paper does well: the maps are mostly reversible and well illustrated, the enumeration is proven rather than assumed, and there are no fitted parameters anywhere. The dependence on Defant's earlier framework is transparent and appropriate.\n\nWhere the soft spots are: one section is not self-contained. Theorem 7.1, the (231,4312) enumeration, decomposes nice permutations and then states that the rest of the proof is \"identical\" to Defant's Theorem 8.1, asserting the functional equation B~(x) = x + xC(x^2)B~(x)^2 without deriving it. That equation is the counting step for the class; without it, the nice-permutation decomposition alone does not yield the result. I believe the equation is very likely true, given the similarity to Defant's class, but as written the proof leans on an external argument that is not shown to carry over. This is exactly what a referee should push on. The rest of the paper is in much better shape: the only issues I saw are minor typos (Lemma 3.3 says U(132,312) instead of U(231,312); Theorem 5.4 says 2431 where it should say 3421) and a compressed discussion of path ambiguity in Theorem 5.3 that is resolved correctly but quickly.\n\nNet: this is solid, useful work in permutation-pattern combinatorics. Eight theorems are fully proven; Theorem 7.1 is conditional on a plausible but unproved functional equation. If that gap is filled, the paper fully delivers on its promise.\n\nRecommendation: send it to a serious referee, not desk-reject. Ask the referee to check Section 7 closely, and suggest the author either derive the functional equation explicitly or provide a verified adaptation of Defant's argument to U(231,4312).","headline":"Nine conjectures settled by explicit bijections, but Theorem 7.1 rests on an under-derived functional equation that needs referee attention.","tokens_in":17906,"tokens_out":2252,"would_cite":true,"duration_ms":21509,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05A05","05A15","05A19"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves nine conjectured enumeration formulas for pattern-avoiding uniquely sorted permutations of odd length, using bijections to Dyck, S-Motzkin, and Schröder paths.","keywords":["uniquely sorted permutations","stack-sorting map","pattern avoidance","canonical hook configuration","Dyck paths","S-Motzkin paths","Schröder paths","3-Catalan numbers"],"falsifier":"Enumerate the permutations in $U_{2k+1}(231,4312)$ by brute force for $k=1,2,3,4$ and compare the counts with the coefficients of $C(xC(x))$; a single mismatch at small $k$ would disprove Theorem 7.1. Alternatively, deriving the functional equation $\\tilde{B}(x)=x+xC(x^2)\\tilde{B}(x)^2$ directly from the Section 7 decomposition would remove the only unsupported step.","tokens_in":16974,"feed_emoji":"🧮","tokens_out":9860,"duration_ms":86867,"temperature":0.7,"pith_summary":"This paper proves nine conjectured enumeration formulas for classes of uniquely sorted permutations that avoid one length-three pattern and one length-four pattern. Each class is shown to be equinumerous with a family of lattice paths, giving explicit counts: two classes are counted by the binomial coefficient $\\binom{2k-1}{k}$, five by the 3-Catalan numbers $\\frac{1}{2k+1}\\binom{3k}{k}$, one by the little Schröder numbers, and one by the coefficients of $C(xC(x))$. These results settle nine previously open conjectures and show that the descent structure of uniquely sorted permutations mirrors the prefix conditions of Dyck, S-Motzkin, and Schröder paths.","feed_headline":"Nine uniquely sorted permutation classes now counted exactly","feed_subtitle":"Bijections to Dyck, S-Motzkin, and Schröder paths settle nine open enumeration conjectures.","key_machinery":"The central mechanism is the canonical hook configuration (CHC), a tuple of hooks in the permutation plot that records, for each descent top, the leftmost available northeast endpoint. A known theorem says a permutation is sorted exactly when it has a CHC; together with the characterization that uniquely sorted permutations are exactly sorted permutations with $k$ descents in length $2k+1$, this turns unique sortedness into a concrete geometric condition. For each pattern pair, the paper uses pattern avoidance to force the permutation into a restricted shape (vee, svee, layered, stair-svee, stair-layered, modsvee, vee-step), then reads ascent tops and descent bottoms in a prescribed order to produce a lattice path—a Dyck path, an S-Motzkin path (a Motzkin path with $k$ up, $k$ down, and $k$ east steps, starting with an east step and with exactly one up step between consecutive east steps), or a Schröder path without horizontal steps on the axis. The path's prefix conditions are exactly the CHC conditions, so the map is reversible and gives the stated count.","core_discovery":"The central claim is that for each of the nine pattern pairs marked with an asterisk in Table 1, the set $U_{2k+1}(\\tau^{(1)},\\tau^{(2)})$ of uniquely sorted permutations of length $2k+1$ avoiding one length-three and one length-four pattern is enumerated exactly by the stated sequence. The proofs are constructive: for each class, a canonical decomposition of the permutation plot is described, and the decomposition is matched invertibly to a Dyck path, an S-Motzkin path, a Schröder path without horizontal steps on the axis, or to a recursive decomposition governed by a functional equation. In particular, the paper proves $|U_{2k+1}(132,4312)|=|U_{2k+1}(132,3421)|=\\binom{2k-1}{k}$, five classes have the 3-Catalan count $\\frac{1}{2k+1}\\binom{3k}{k}$, the class $U_{2k+1}(231,1432)$ is counted by the little Schröder numbers, and $\\sum_{k\\ge 0}|U_{2k+1}(231,4312)|x^k=C(xC(x))$, where $C(x)$ is the Catalan generating function.","pith_inferences":["For the nine still-open conjectures, the paper's own remarks suggest standard lattice-path bijections may fail because the relevant Motzkin model has the wrong length, so a generating-function approach may be more productive.","The Section 4 inverse bijection hints that inversion symmetry between pattern pairs could yield further equinumerosities among uniquely sorted classes; testing this on other inverse pairs is a natural next step.","The repeated 'descents become up steps, ascent tops become down steps' reading suggests a general dictionary between fertility conditions and path prefix conditions that could generate new path families for the remaining classes.","Deriving the quoted functional equation for $U_{2k+1}(231,4312)$ from the decomposition would not only complete Theorem 7.1 but may provide a template for enumerating other classes of the form $U_{2k+1}(231,4xxx)$."],"forward_implications":["The nine pattern pairs marked with an asterisk in Table 1 now have proven enumeration formulas, so those rows of the conjecture table are settled.","Five classes are placed in bijection with S-Motzkin paths, so their 3-Catalan counts identify them with ternary trees through a single path model.","Inversion gives an explicit bijection between $U_{2k+1}(132,3421)$ and $U_{2k+1}(132,4312)$, showing both are counted by $\\binom{2k-1}{k}$.","The bijection between $U_{2k+1}(231,1432)$ and Schröder paths without horizontal steps on the axis proves the little Schröder count for that class.","The generating function $B(x)=C(xC(x))$ for $U_{2k+1}(231,4312)$ places the class in the same enumerative family as previously counted uniquely sorted classes with the same generating function."],"supporting_citations":[{"why":"It supplies the nine conjectures being proved and the decomposition-and-generating-function template used for the last class.","marker":"[8]"},{"why":"It defines uniquely sorted permutations and proves the sorted-with-k-descents characterization used in every theorem.","marker":"[14]"},{"why":"It proves that a permutation is sorted exactly when it has a canonical hook configuration, the geometric criterion at the center of the proofs.","marker":"[13]"},{"why":"It establishes the 3-Catalan count of S-Motzkin paths, the target count for five classes.","marker":"[23]"},{"why":"It provides the postorder bijection that transfers the enumeration to the class $U_{2k+1}(132,3412)$.","marker":"[12]"},{"why":"It records the classical 3-Catalan count of ternary trees that underlies the S-Motzkin path enumeration.","marker":"[16]"}],"fun_headline_variants":["Bijections to lattice paths prove nine permutation conjectures","Lattice path bijections yield nine exact permutation counts","Nine conjectures on uniquely sorted permutations proven","Exact counts for nine pattern-avoiding permutation classes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The count for the class $U_{2k+1}(231,4312)$ rests on a generating-function equation $\\tilde{B}(x)=x+xC(x^2)\\tilde{B}(x)^2$ that the paper quotes from a previous proof rather than deriving, and if that equation or the copied argument does not carry over, the enumeration in Theorem 7.1 is unsupported.","fun_headline_variants_meta":{"raw":{"variants":["Bijections to lattice paths prove nine permutation conjectures","Lattice path bijections yield nine exact permutation counts","Nine conjectures on uniquely sorted permutations proven","Exact counts for nine pattern-avoiding permutation classes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000595,"raw_usage":{"total_tokens":2741,"prompt_tokens":855,"completion_tokens":1886,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":471,"completion_tokens_details":{"reasoning_tokens":1822}},"tokens_in":471,"tokens_out":1886,"duration_ms":13279,"temperature":1.0,"reasoning_tokens":1822,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:53:39.865820+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate the permutations in $U_{2k+1}(231,4312)$ by brute force for $k=1,2,3,4$ and compare the counts with the coefficients of $C(xC(x))$; a single mismatch at small $k$ would disprove Theorem 7.1. Alternatively, deriving the functional equation $\\tilde{B}(x)=x+xC(x^2)\\tilde{B}(x)^2$ directly from the Section 7 decomposition would remove the only unsupported step.","supporting_citations":[{"cited_title":"Defant, Catalan intervals and uniquely sorted permut ations","cited_arxiv_id":null,"evidence_quote":"It supplies the nine conjectures being proved and the decomposition-and-generating-function template used for the last class."},{"cited_title":"Defant, M","cited_arxiv_id":null,"evidence_quote":"It defines uniquely sorted permutations and proves the sorted-with-k-descents characterization used in every theorem."},{"cited_title":"Defant, Preimages under the stack-sorting algorith m","cited_arxiv_id":null,"evidence_quote":"It proves that a permutation is sorted exactly when it has a canonical hook configuration, the geometric criterion at the center of the proofs."},{"cited_title":"A bijection between ternary trees and a subclass of Motzkin paths","cited_arxiv_id":"1808.01907","evidence_quote":"It establishes the 3-Catalan count of S-Motzkin paths, the target count for five classes."},{"cited_title":"Defant, Fertility, strong fertility, and postorder Wilf equivalence","cited_arxiv_id":null,"evidence_quote":"It provides the postorder bijection that transfers the enumeration to the class $U_{2k+1}(132,3412)$."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"It records the classical 3-Catalan count of ternary trees that underlies the S-Motzkin path enumeration."}],"review_version":1}