{"id":"903d0ff5-116b-4bb7-9c21-385f1c5d33ac","arxiv_id":"1909.01261","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"An explicit double-exponential upper bound on the regularity of OI-modules presented in finite degrees, together with a new inductive method for proving their structural properties.","lead":"Mathematicians studying representation stability found a new inductive method for OI-modules and used it to prove the first explicit upper bound on their Castelnuovo-Mumford regularity. Anyone who wants to know when a growing family of algebraic structures starts to behave like a polynomial can read this as a proof that such a threshold exists and is explicitly bounded.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified; Proposition 9 holds and the induction in Theorem 15 is sound once the missing bars on \\bar V are restored.","rationale":"The reader correctly identifies Proposition 9 as the engine of the paper. On close inspection, the proposition is correct: the downard induction on l is legitimate, the factorization through gamma is valid, and the generation statement is sufficient for Theorem 1. The only potential gap is a notational one in the proof of Theorem 15, where the distinction between V and \\bar V is obscured; once restored, the induction goes through because Lemma 13 applies to \\bar V with prd(\\bar V) <= r. I verified the key inequalities in Lemma 14 with the intended double-exponential exponent; the claimed bound on regularity follows. Thus the central claim survives scrutiny, and the reader's ACCEPT verdict remains appropriate.","tokens_in":17682,"tokens_out":28918,"duration_ms":261698,"concrete_test":"Recompute the induction step in Theorem 15 with explicit bars: for V with t0(V)=d and r >= prd(V), verify prd(\\bar V) <= r, then apply Lemma 13 and the induction hypothesis to Delta(\\bar V); if reg(\\bar V) <= C_{d-1}(r-1)+1 follows, the proof is complete. Also recompute C_d(r) for d=2,3,4 against 2^{2^d} r to confirm Lemma 14(c).","verdict_should_be":"UNCHANGED","load_bearing_attack":"I could not find a load-bearing flaw in the central claim. The key engine, Proposition 9, is valid: for w in W_s with s <= t0(W) and any beta, the projection eta(beta w) is shown to lie in the submodule generated by the \\hat w_l via the factorization gamma(h)=beta(h+l-1)-r, and the downward induction on l correctly proves \\hat w_l is in \\hat W. The proof of Theorem 15 is also sound; the only subtlety is typesetting: the induction hypothesis must be applied to Delta(\\bar V), not Delta V, using Lemma 13 after noting prd(\\bar V) <= r. This follows from 0 -> (Sigma^r V)_\\prec d -> Sigma^r V -> \\bar V -> 0, since t0((Sigma^r V)_\\prec d) <= d-1 and t1(Sigma^r V) <= r. Lemma 14's double-exponential bound is correct when read as 2^{2^d} r. No contradiction with the stated bound was found.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces an inductive method for studying OI-modules, i.e., representations of the category of finite totally ordered sets and strictly increasing maps, that are presented in finite degrees. The central result, Theorem 4, asserts that every nonzero OI-module V satisfies reg(V) ≤ 2^{2^{t0(V)}} prd(V), where t0(V) is the generation degree and prd(V) is the presentation degree; this is the first explicit upper bound of this kind for OI-modules. The proof combines a key combinatorial proposition (Proposition 9) identifying generators of the image of the kernel under the projection to the top-degree projective summand, a theorem on the vanishing of the kernel of the natural map for the truncated shift (Theorem 1), and an induction on t0(V) using the Δ construction and auxiliary estimates (Lemma 14). The paper also derives effective eventual polynomiality of Hilbert functions (Theorem 5), filtration stability (Theorem 3), and structural results on semi-induced modules and projective dimension.","tokens_in":17809,"tokens_out":10181,"duration_ms":92924,"significance":"If correct, the regularity bound is a substantial contribution to representation stability: it controls all higher homological degrees t_i(V) simultaneously and works for arbitrary coefficient rings and for modules presented in finite degrees, going beyond the finitely generated/Noetherian setting of earlier work. The proof is detailed and I found no load-bearing gap: the downward induction in Proposition 9 and the factorization γ(h)=β(h+ℓ−1)−r are valid, and the induction in Theorem 15 is sound once the notation is corrected. The potential concern about Proposition 9 does not land on close reading. The paper also provides a flexible inductive framework (Theorem 19) and explicit bounds for Hilbert-function stabilization, with clear statements of open questions. The main limitations are the acknowledged possible non-optimality of the double-exponential bound and some presentational issues in the typesetting of the induction step.","major_comments":[],"minor_comments":[{"comment":"The proof as printed applies the induction hypothesis to ∆V, but the intended module is ∆\\bar V, where \\bar V = Σ^rV/(Σ^rV)_{\\prec d}; as written, the step appears to invoke the induction hypothesis on the wrong module. The necessary bound prd(\\bar V) ≤ r follows from the short exact sequence 0 → (Σ^rV)_{\\prec d} → Σ^rV → \\bar V → 0 together with t0((Σ^rV)_{\\prec d}) ≤ d−1 and t1(Σ^rV) ≤ r, so the argument is sound after restoring the missing bars.","section":"Section 4.2, Theorem 15"},{"comment":"The displayed bound in Theorem 4 and in Lemma 14 should be typeset as 2^{2^{t0(V)}} and 2^{2^d}r; the current text shows ambiguous expressions such as '22t0(V)' and '22d', which can be misread as 2^{2t0(V)} or 2^{2d}.","section":"Throughout"},{"comment":"The abstract calls the morphisms of OI 'order-preserving injective maps' while Section 1.2 defines them as strictly increasing maps; these are equivalent for totally ordered finite sets, but the wording should be made consistent to avoid confusion.","section":"Abstract and Section 1.2"},{"comment":"The proof of Theorem 20 refers to the proof of 'Theorem 2' when the statement is restated as Theorem 19; the cross-reference should be updated for consistency.","section":"Section 4.4"},{"comment":"There are typographical errors in the first sentence of Section 4.5 ('fintely ge nerated') and elsewhere in the abstract ('an d'); a careful proofread is needed.","section":"Section 4.5"}],"recommendation":"minor_revision","confidential_remarks":"The paper's central arguments are sound and I did not find a load-bearing error. The proof of Proposition 9 and the induction in Theorem 15 check out once the missing bars on \\bar V are restored. The manuscript relies substantially on the authors' earlier papers [7,8], but those are published and the relevant results are quoted with proofs or references; the main new ingredients—Proposition 9 and the effective bounds—are clearly novel. I recommend minor revision to fix the notation and presentation issues noted in the report."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First thing you should know: this is the paper that finally gives an explicit upper bound for Castelnuovo–Mumford regularity of OI-modules presented in finite degrees, reg(V) ≤ 2^{2 t0(V)} prd(V), and a matching threshold for eventual polynomiality of Hilbert functions. The main new tool is Proposition 9, a combinatorial generation statement about the image of the kernel under a projection onto the top-degree projective summand. It is the engine that makes the induction go through, and it is the right thing to check.\n\nThe paper does what it claims. The proof of Proposition 9 is delicate—OI lacks the transitivity that FI and VI have—and I checked the downward induction on ℓ and the factorization γ(h)=β(h+ℓ-1)-r; both work. Theorem 4 follows from a straightforward induction on t0(V) with an auxiliary function C_d(r). The bound is derived, not fitted; the only external inputs are two self-cited lemmas from the authors' earlier published papers [7,8], which is fair when the citations are the actual machinery. The extension from finitely generated modules over Noetherian rings to all modules presented in finite degrees is real, and Corollary 16 (the category is abelian) is a useful byproduct. The paper is also honest about what it does not do: the bound is enormous, and the authors note they use reg(V) to bound t2(V), which amplifies the final number. That is a limitation in impact, not in correctness.\n\nSoft spots are minor and mostly cosmetic. There are a few typographical slips—missing bars on \\bar V in the proof of Theorem 15, and one place where the double-exponential bound is written as 2^{2d} r instead of 2^{2^d} r. The stress-test caught neither as load-bearing, and neither is. The eventual-polynomiality theorem is essentially a corollary of the same induction, so it adds less than it appears. You will need [7,8] on the table to verify Lemma 8 and Proposition 23, but those are published and independent. No formalization, no code, but that is normal for this area.\n\nIf you work on representation stability or combinatorial categories, you should read this. It is not a paradigm shift—the authors themselves frame it as an extension of their own inductive machinery—but it is the first quantitative handle on OI-regularity and it will be cited. I would send it to a serious referee; the central claim holds up. Accept with minor revisions.","headline":"Solid, correct extension of the authors' inductive machinery to OI-modules presented in finite degrees, giving the first explicit (if very large) regularity bound; the key combinatorial Proposition 9 checks out.","tokens_in":18405,"tokens_out":2988,"would_cite":true,"duration_ms":28490,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["18A25"],"pacs":[],"model":"deepseek-v4-flash","headline":"For any nonzero OI-module, regularity is bounded by $2^{2t_0(V)} \\operatorname{prd}(V)$.","keywords":["OI-modules","Castelnuovo-Mumford regularity","representation stability","shift functor","semi-induced modules","Hilbert functions","combinatorial categories","increasing maps"],"falsifier":"Compute the regularity of a small explicit OI-module, for instance $V_0 = 0$ and $V_n = k$ for $n \\ge 1$, with $V(\\alpha)$ equal to the identity only when $\\alpha(m) = n$ and zero otherwise, which has $t_0(V) = 1$ and $t_1(V) = 2$; Theorem 4 predicts $\\operatorname{reg}(V) \\le 8$, and a direct homological calculation yielding a larger value would refute the paper's central claim.","tokens_in":17410,"feed_emoji":"🧮","tokens_out":9955,"duration_ms":95007,"temperature":0.7,"pith_summary":"This paper develops an inductive method for OI-modules—functors from finite totally ordered sets with strictly increasing maps to $k$-modules—that are presented in finitely many degrees. The engine is a combinatorial proposition (Proposition 9) showing that, after shifting a presentation and projecting to its top-degree part, every relation in the image is generated by pieces cut from relations of degree at most the generation degree $t_0(W)$. From this the authors prove Theorem 1: the shifted quotient $\\overline{V} = \\Sigma^r V / (\\Sigma^r V)_{\\prec d}$ embeds into its own shift, giving a torsion-free replacement that supports induction on the generation degree. As the main application, they obtain the first explicit upper bound on Castelnuovo-Mumford regularity of OI-modules: $\\operatorname{reg}(V) \\le 2^{2t_0(V)} \\operatorname{prd}(V)$ for every nonzero $V$. A sympathetic reader would care because the bound is quantitative where only finiteness was known, and the same induction yields a starting point for eventual polynomiality of Hilbert functions and a classification of acyclic modules.","feed_headline":"First explicit regularity bound for OI-modules","feed_subtitle":"New induction controls all homological degrees: reg(V) ≤ 2^{2t0}prd(V).","key_machinery":"The load-bearing object is the combinatorial Proposition 9. Given a presentation $F = \\bigoplus M(d_j) \\to V$ of a module with $d = t_0(V)$ and kernel $W$, one shifts by $r \\ge \\operatorname{prd}(V)$ and projects $\\Sigma^r F$ onto the summand $P$ spanned by the top-degree projectives $M(d)$. The proposition asserts that the image $\\widehat{W} = \\eta(\\Sigma^r W)$ is generated by elements $\\widehat{w}_\\ell$, one for each relation $w \\in W_s$ with $s \\le t_0(W)$, obtained by deleting the first $\\ell - 1$ entries of the increasing maps appearing in $w$. This generation statement is what forces $\\kappa_{\\overline{V}} = 0$ in Theorem 1, and it is delicate because OI lacks transitivity: endomorphism groups of objects are trivial, so morphism sets have no symmetry group acting transitively on them. The supporting structure is the shift functor $\\Sigma = V \\circ \\sigma$, where $\\sigma$ adds a new minimum element to each ordered set, with kernel $\\kappa_V$ and cokernel $\\Delta V$ of the natural map $V \\to \\Sigma V$.","core_discovery":"The central claim is Theorem 4: for any nonzero OI-module $V$, $\\operatorname{reg}(V) \\le 2^{2t_0(V)} \\operatorname{prd}(V)$, where $t_0$ is the generation degree and $\\operatorname{prd}$ the presentation degree. The authors establish it by induction on $d = t_0(V)$ using the module $\\overline{V} = \\Sigma^r V / (\\Sigma^r V)_{\\prec d}$ with $r \\ge \\operatorname{prd}(V)$. Theorem 1 says $\\kappa_{\\overline{V}} = 0$: the natural map $\\overline{V} \\to \\Sigma \\overline{V}$ is injective. Because the cokernel $\\Delta(\\overline{V})$ has generation degree strictly smaller than $d$, and because the submodule $(\\Sigma^r V)_{\\prec d}$ is itself presented in lower degree, a property that is glueable, $\\Sigma$-dominant, and $\\Delta$-predominant propagates from the zero module to every module presented in finite degrees (Theorems 2 and 19). Theorem 4 is the quantitative output of this formal induction, with auxiliary functions $C_d(r)$ tracking how many times regularity is amplified at each generation degree.","pith_inferences":["The double-exponential form of the bound is an artifact of the proof, which uses $\\operatorname{reg}(\\overline{V})$ to control $t_2(V)$; a direct bound on $t_2$ in terms of $\\operatorname{prd}(V)$, matching what exists for FI- and VI-modules, would likely lower Theorem 4 to a much smaller function.","Because the method never invokes Noetherianity of the coefficient ring, it should transfer to other categories with trivial automorphism groups and non-transitive morphism sets, provided one can prove the analogue of Proposition 9.","The explicit bound on polynomial growth of Hilbert functions makes it possible, in principle, to compute stable ranges for concrete families of homology groups once a presentation of the associated OI-module is known, a step the paper does not carry out.","The identification of OI with the increasing monoid and the semisimplicial category is ring-independent, so the same regularity and Hilbert-polynomial bounds apply there; Theorem 4 also settles, in explicit form, the conjecture that regularity is controlled by finitely many $t_i$."],"forward_implications":["Every nonzero OI-module has finite Castelnuovo-Mumford regularity bounded by $2^{2t_0(V)} \\operatorname{prd}(V)$, so all higher homological degrees $t_i(V)$ are simultaneously controlled by the first two invariants.","The category of OI-modules presented in finite degrees is abelian, so kernels and cokernels of maps between such modules remain in the category and homological algebra can be done without Noetherian assumptions on the coefficient ring.","A finitely generated OI-module over a field has Hilbert function $\\dim_k V_n$ equal to a rational polynomial of degree at most $t_0(V)$ for all $n \\ge 2^{2t_0(V)} \\operatorname{prd}(V)$, giving an explicit bound on where polynomial growth begins.","Every OI-module presented in finite degrees is filtration stable: finitely many modules of generation degree at most $t_0(V)$ exist such that every large shift $\\Sigma^n V$ has a filtration whose successive quotients lie among them, with the family size at most $2^{t_0(V)+1} - 1$.","An OI-module presented in finite degrees is semi-induced exactly when its OI-homology vanishes in degree 1 (equivalently, in any single positive degree), extending the FI-module acyclicity criterion."],"supporting_citations":[{"why":"Supplies the shift-functor framework: definitions of $\\Sigma$, $\\kappa$, $\\Delta$, the invariants $t_i$, and Lemma 8's inequalities $\\operatorname{reg}(V) \\le \\operatorname{reg}(\\Sigma V) + 1$ and the $\\kappa_V = 0$ variant used at every inductive step.","marker":"[7]"},{"why":"Provides the FI-module upper-bound scheme, including the $C_d(r)$ induction, that Theorem 15 adapts to OI-modules.","marker":"[11]"},{"why":"Provides the VI-module analogue of the same inductive bounding method and the generalized Koszul-type consequence reused in Corollary 17.","marker":"[9]"},{"why":"Introduces the semi-induced (relative projective) modules and the acyclicity criterion that Theorem 6 extends to modules presented in finite degrees.","marker":"[8]"},{"why":"Supplies the FI-module filtration and finite-projective-dimension results whose arguments are adapted in Section 4.6.","marker":"[13]"}],"fun_headline_variants":["Inductive method yields explicit OI-module regularity bound","New bound for OI-module regularity: reg(V) ≤ 2^{2t0}prd(V)","Explicit bound: reg(V) ≤ 2^{2t0}prd(V) for OI-modules","Induction on generation degree bounds OI-module regularity","Explicit regularity bound via induction on OI-modules"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof rests on a single combinatorial generation statement: every element of the submodule $\\widehat{W}$ produced by shifting a presentation is generated by the pieces $\\widehat{w}_\\ell$ indexed by relations $w$ of degree at most $t_0(W)$; if that statement failed, the induction step that makes the shifted quotient torsion-free would break, and the regularity bound would not follow.","fun_headline_variants_meta":{"raw":{"variants":["Inductive method yields explicit OI-module regularity bound","New bound for OI-module regularity: reg(V) ≤ 2^{2t0}prd(V)","Explicit bound: reg(V) ≤ 2^{2t0}prd(V) for OI-modules","Induction on generation degree bounds OI-module regularity","Explicit regularity bound via induction on OI-modules"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001418,"raw_usage":{"total_tokens":5678,"prompt_tokens":851,"completion_tokens":4827,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":467,"completion_tokens_details":{"reasoning_tokens":4721}},"tokens_in":467,"tokens_out":4827,"duration_ms":35217,"temperature":1.0,"reasoning_tokens":4721,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T05:24:23.829898+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the regularity of a small explicit OI-module, for instance $V_0 = 0$ and $V_n = k$ for $n \\ge 1$, with $V(\\alpha)$ equal to the identity only when $\\alpha(m) = n$ and zero otherwise, which has $t_0(V) = 1$ and $t_1(V) = 2$; Theorem 4 predicts $\\operatorname{reg}(V) \\le 8$, and a direct homological calculation yielding a larger value would refute the paper's central claim.","supporting_citations":[{"cited_title":"An inductive machinery for representations of categories with shift functors","cited_arxiv_id":"1610.09081","evidence_quote":"Supplies the shift-functor framework: definitions of $\\Sigma$, $\\kappa$, $\\Delta$, the invariants $t_i$, and Lemma 8's inequalities $\\operatorname{reg}(V) \\le \\operatorname{reg}(\\Sigma V) + 1$ and the $\\kappa_V = 0$ variant used at every inductive step."},{"cited_title":"Upper bounds of homological invariants of $FI_G$-modules","cited_arxiv_id":"1512.05879","evidence_quote":"Provides the FI-module upper-bound scheme, including the $C_d(r)$ induction, that Theorem 15 adapts to OI-modules."},{"cited_title":"Spectroscopy and Biosensing with Optically Resonant Dielectric Nanostructures","cited_arxiv_id":"1710.10233","evidence_quote":"Provides the VI-module analogue of the same inductive bounding method and the generalized Koszul-type consequence reused in Corollary 17."},{"cited_title":"Asymptotic behavior of repre sentations of graded categories with inductive functors","cited_arxiv_id":null,"evidence_quote":"Introduces the semi-induced (relative projective) modules and the acyclicity criterion that Theorem 6 extends to modules presented in finite degrees."}],"review_version":1}