{"id":"a193bbe3-bd60-4617-ab0e-af2c890ba589","arxiv_id":"1908.06885","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For line arrangements, the minimal degree of a logarithmic derivation changes predictably under adding or deleting one line, yielding new maximal Tjurina arrangements and a sharp n3≤5 combinatoriality threshold.","lead":"This paper finds rules for how a key number associated with line arrangements changes when one line is added or removed, and uses them to build many new arrangements with extremal properties. It also shows that for arrangements with only double and triple crossing points, this number is determined by the combinatorics exactly up to five triple points, and fails from six onward.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The defining equations for A_d and B_d in Theorems 4.10–4.11 are not products of linear forms, so the extremal Tjurina-maximality claims currently rest on objects that are not line arrangements.","rationale":"The reader's weakest assumption identifies exactly the problem I would flag: the displayed equations for the extremal Tjurina maximal arrangements are not line arrangements. I agree that this is load-bearing because Theorems 4.10 and 4.11 are stated as proofs of existence for maximal Tjurina line arrangements of types (d,d-4) and (d,d-3), and their proofs invoke the line-arrangement addition theorem 3.3. Without corrected linear equations, those two theorems are not established. The rest of the paper, especially the addition-deletion theorem itself, appears mathematically credible: Theorem 2.14 has a short and essentially sound proof using Terao's polynomial B-theory and Lemma 2.13, and the Ziegler-based constructions in Section 4 are plausible and explicitly stated with linear equations in Remark 3.9. The unverified SINGULAR computation in Theorem 4.18 is a secondary concern, but it is the kind of computational check that can be readily supplied. Because the flaw is localized to the extremal examples and does not undermine the main addition-deletion calculus, the appropriate verdict remains CONDITIONAL rather than REJECT; the authors should correct the equations and supply the promised computations. My conclusion therefore leaves the reader's verdict unchanged.","tokens_in":19700,"tokens_out":10467,"duration_ms":106528,"concrete_test":"Check every displayed factor in the definitions of A_d and B_d in Theorems 4.10 and 4.11 for degree one. If, as printed, factors like x^{2j}+y^{3j}-z occur, obtain the intended linear defining equations from the authors or from the reference [18]; then recompute r(A_d) and r(B_d) for the smallest cases d=8 and d=9 using SINGULAR or another Gröbner basis tool, and verify that r(A_d)=d-4 and r(B_d)=d-3 and that the corrected polynomials factor completely into linear forms.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 4.1, immediately before Theorem 4.10, defines A_{3p+2} as xy(x^{2p+1}+y^{3p+1}-z) times products of factors such as x^{2j}+y^{3j}-z, and similarly defines B_d before Theorem 4.11. For every j≥1, these factors have degree at least 2, so their zero sets are not hyperplanes and the product does not define a line arrangement. The proof of Theorem 4.10 says that Theorem 3.3 is applied repeatedly and that an elementary counting of intersection points completes the proof; Theorem 4.11 refers to the same proof. Both Theorem 3.3 and the claimed counting are valid only for line arrangements. As printed, the extremal claims r(A_d)=d-4 for d≥8 and r(B_d)=d-3 for d≥7 are unsupported: the objects are not arrangements, and no corrected defining equations are supplied in the paper. These extremal cases are central to the abstract's claim of Tjurina maximal arrangements in new situations and to the discussion of Conjecture 1.6, so this is a load-bearing gap. The core addition-deletion Theorem 2.14 appears sound; the problem is in the presentation of the applications in Theorems 4.10 and 4.11.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the invariant r(A), the minimal degree of a non-Eulerian logarithmic derivation, under the addition or deletion of a hyperplane. The main theorem (Theorem 2.14) gives r(A)=r(A\\{H})+1 whenever r(A\\{H}) < r(A^H). Section 3 specializes the result to line arrangements, deriving addition and deletion criteria and a weak-combinatorial determination of r when 2m≥d. Section 4 applies these tools to maximal Tjurina line arrangements: explicit families in Theorem 4.4 and Proposition 4.6, extremal families A_d and B_d in Theorems 4.10 and 4.11, and a sharp statement (Theorem 4.18 and Corollary 4.20) that for line arrangements with only double and triple points, r is combinatorially determined exactly when n3≤5, with Ziegler-type counterexamples for every n3≥6.","tokens_in":19888,"tokens_out":11346,"duration_ms":105458,"significance":"The addition-deletion theorem is a genuinely useful tool: its proof is short, clean, and relies on established ingredients such as Terao's polynomial B-theory and Lemma 2.13 rather than assuming its own conclusion. If the Section 4 applications are valid, the paper would establish many new maximal Tjurina line arrangements and a sharp combinatorial-determinacy result for double/triple line arrangements. The explicit grid constructions in Theorem 4.4 are a particular strength. However, the extremal applications in Theorems 4.10 and 4.11 currently depend on displayed equations that are not products of linear forms, so those specific claims are not yet supported. The results on n3≤5 and the Ziegler-based non-determinacy for n3≥6 appear independent of this defect.","major_comments":[{"comment":"The objects A_{3p+2}, A_{3p+3}, and A_{3p+4} are defined by products containing factors such as x^{2j}+y^{3j}-z, x^{2j}+y^{3j+1}-z, and x^{2j}+y^{3j+2}-z. For every j≥1 each such factor has degree at least 3, so its zero set is not a hyperplane; consequently the product is not the defining polynomial of a line arrangement, and the integer d used to name A_d is not the degree of the product. The same problem occurs in the formulas for B_{2p} and B_{2p+1} before Theorem 4.11. The proofs of Theorems 4.10 and 4.11 invoke Theorem 3.3 and the maximal-Tjurina criterion from [18], both of which are statements about line arrangements. As printed, the conclusions r(A_d)=d-4 and r(B_d)=d-3 are unsupported. Correct linear defining equations, or a different proof for the corresponding curves, must be supplied.","section":"4.1, displayed equations before Theorem 4.10"},{"comment":"Even if the defining equations are repaired, the proof of Theorem 4.10 is only a sketch: it states that Theorem 3.3 is applied repeatedly in three addition steps and that an elementary counting of intersection points completes the proof, without giving the restriction data |A^H|, the values of r' and r'', or the counts at any intermediate step. Theorem 4.11 is dismissed by the phrase 'by the same proof'. These counts are load-bearing because the extremal values r=d-4 and r=d-3 are sensitive to the exact multiplicities and to the condition |A^H|≥r'+2 at every intermediate arrangement. The counting must be written out fully, or replaced by a verification covering all d in the claimed ranges, before Theorems 4.10 and 4.11 can be accepted.","section":"4.1, proof of Theorem 4.10 (and Theorem 4.11)"}],"minor_comments":[{"comment":"The displayed formula for B_{2p+1} uses an unsubscripted d in the factor x^{2d}+y^{3d}-z and in the product range j=1,...,d-1, while the family is indexed by p; this is internally inconsistent and should be restated with matching indices.","section":"4.1, definition of B_{2p+1}"},{"comment":"There are spacing errors in the title and abstract ('Deriv ations', 'T jurina'); please proofread the manuscript carefully.","section":"Abstract and title"}],"recommendation":"major_revision","confidential_remarks":"The main reason for major_revision rather than reject is that the non-linear defining equations appear to be a localized defect in Section 4.1; Theorem 2.14, Section 3, Theorem 4.4/Proposition 4.6, and Theorem 4.18/Corollary 4.20 are independent of that defect and seem sound. If corrected equations cannot be supplied, the authors should remove the extremal claims from the abstract and introduction and resubmit the remaining results."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThe core of this paper is Theorem 2.14, an addition-deletion rule for the minimal degree r(A) of logarithmic derivations: if you delete a hyperplane H and the restriction has r'' larger than r', then r = r' + 1. The proof is short, clean, and uses established tools (Terao's B-theory, Yoshinaga's restriction theorem), with no circularity. This is genuinely new and useful. It yields the Ziegler-extension construction for any d ≥ 9, n3 ≥ 6, and the n3 ≤ 5 classification (Theorem 4.18) is a real result, apart from one SINGULAR computation that is standard and easily checked.\n\nThe problem is Theorems 4.10 and 4.11. The displayed equations for A_d and B_d contain factors such as x^{2j} + y^{3j} - z, which are not linear forms. Their zero sets are not lines, so the product does not define a line arrangement. The proofs then say to apply Theorem 3.3 repeatedly and finish by \"an elementary counting of intersection points,\" but that counting only makes sense for line arrangements. As printed, the extremal claims r(A_d) = d-4 and r(B_d) = d-3 are unsupported. These claims are what the abstract advertises as \"Tjurina maximal line arrangements in a lot of new situations,\" so this is a load-bearing gap, not a typo in a footnote.\n\nThe core theorem survives, so the paper is repairable. A corrected version needs explicit linear equations for the arrangements and a complete count, or the extremal claims should be removed from the abstract. There is also an indexing typo in the definition of B_{2p+1} (\"x^{2d}\" rather than a j-dependent exponent), which suggests that section was not checked carefully.\n\nWho is this for? Arrangement and singularity theorists. The main addition-deletion result is a solid contribution and I would cite it. The Tjurina-maximality examples need verification before I would trust them.\n\nRecommendation: send to a serious referee, conditional on the authors fixing or removing the extremal constructions. The paper deserves referee time because the central tool and the n3 ≤ 5 classification are meaningful. I would not desk-reject it, but I would make the fix a condition of acceptance.\n\nBest,\n[Name]","headline":"Useful addition-deletion result for r(A), but the extremal Tjurina-maximality theorems as printed define non-linear curves, not line arrangements.","tokens_in":20516,"tokens_out":3355,"would_cite":true,"duration_ms":31165,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["14H50","14B05","13D02","32S22","52S35"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves a single rule for when deleting or adding a hyperplane changes the minimal logarithmic derivation degree by one.","keywords":["logarithmic derivations","minimal degree","hyperplane arrangements","line arrangements","Jacobian relations","Tjurina number","addition-deletion theorem","combinatorial determination"],"falsifier":"Look at the defining equations for $A_d$ and $B_d$: for $j\\ge 1$ each factor $x^{2j}+y^{3j}-z$ has degree at least two, so its zero set is not a line; the claimed line arrangement does not exist as written. A corrected construction would need genuine linear factors, and a direct computation of $r(A_d)$ or $r(B_d)$ from the Jacobian syzygies of any corrected family would settle whether the asserted values $r=d-4$ and $r=d-3$ can be achieved.","tokens_in":19420,"feed_emoji":"📐","tokens_out":16617,"duration_ms":149231,"temperature":0.7,"pith_summary":"The paper establishes an addition-deletion theorem for $r(A)$, the smallest degree of a nonzero logarithmic derivation of a hyperplane arrangement (equivalently, the smallest degree of a Jacobian relation). For $H\\in A$ and $A'=A\\setminus\\{H\\}$, it proves that $r(A)=r(A')+1$ whenever $r(A')<r(A^H)$, where $A^H$ is the restriction of $A$ to $H$. In the rank-three line-arrangement case this becomes a concrete count: adding a line $H$ to $A'$ forces $r$ to rise by one if $H$ meets $A'$ in at least $r(A')+2$ points. The authors use this to show that for line arrangements with only double and triple points, $r(A)$ is combinatorially determined exactly when the number of triple points is at most five, and to construct Tjurina maximal line arrangements — arrangements attaining the maximal global Tjurina number for their degree and $r$ — in new ranges.","feed_headline":"One inequality controls the minimal degree when lines are added","feed_subtitle":"For double-and-triple line arrangements, r(A) is combinatorial exactly up to five triple points.","key_machinery":"The carrying object is the comparison of logarithmic derivation modules via the polynomial $B$-theorem: for $H\\in A$, any derivation of $A'$ of degree less than $|A'|-|A^H|$ automatically extends to a derivation of $A$. The proof of the addition-deletion theorem also uses the Euler restriction map $\\rho:D(A)\\to D(A^H)$; because $r(A^H)>r(A')$, the image of a minimal derivation under $\\rho$ must be a scalar multiple of the Euler derivation, and subtracting that multiple produces a derivation that vanishes on $H$ and factors through $\\alpha_H$, giving a lower-degree derivation of $A'$. In the rank-three line case this mechanism reduces to the simple intersection count $|A_H|\\ge r'+2$.","core_discovery":"The central claim is that the minimal degree of a logarithmic derivation behaves predictably under a single hyperplane deletion. Concretely, let $A$ be an essential hyperplane arrangement, $H\\in A$, $A'=A\\setminus\\{H\\}$, and let $r,r',r''$ denote the minimal degrees for $A$, $A'$, and the restriction $A^H$. Theorem 2.14 asserts that $r=r'+1$ whenever $r'<r''$. The proof takes a minimal derivation of $A'$ that also lies in $D_H(A)$, uses the Euler restriction to $A^H$ to eliminate the part proportional to the Euler derivation, and then factors the remainder by $\\alpha_H$ to obtain a derivation of $A'$ of degree $r'-1$, a contradiction. In rank three the criterion reads: if the new line $H$ meets $A'$ in at least $r'+2$ points, then $r(A'\\cup\\{H\\})=r'+1$. From this the paper derives that for line arrangements with only double and triple points, $r(A)$ is determined by the intersection lattice if and only if $n_3\\le 5$, with counterexamples for every $n_3\\ge 6$, and it constructs Tjurina maximal line arrangements in several ranges where existence was open.","pith_inferences":["The criterion suggests an inductive algorithm for $r(A)$: repeatedly delete a line whose intersection count with the rest exceeds $r+2$; in arrangements with very few triple points such a line is guaranteed, turning the computation into a purely combinatorial recursion. This is my inference, not a claim in the paper.","If the extremal families $A_d$ and $B_d$ can be repaired by replacing the non-linear factors with genuine linear forms, the same addition-deletion induction would prove the existence of maximal Tjurina line arrangements of types $(d,d-4)$ and $(d,d-3)$; as printed those existence theorems are not established.","The sharp cutoff $n_3=5$ likely reflects the incidence structure of triple points: with at most five triple points some line must contain a triple point that is alone on that line, which makes the deletion step applicable, whereas six triple points allow configurations in which every triple point shares its lines with others.","Because $r(A)$ and the generic splitting type of the logarithmic bundle determine each other when $r(A)<d/2$, the $n_3\\le 5$ result transfers to a combinatorial statement about those bundles; one can read the paper's Remark 4.21 as saying the bundle invariant is non-combinatorial exactly beyond that threshold."],"forward_implications":["For line arrangements with only double and triple points, $r(A)$ is determined by the combinatorics if and only if $n_3\\le 5$; for every $n_3\\ge 6$ there are pairs with the same intersection lattice and different $r(A)$.","Adding a generic line to any line arrangement raises $r$ by exactly one; adding a generic line through a point of maximal multiplicity raises $r$ by one unless $r'=d'-m'$, in which case $r$ stays equal to $r'$.","Tjurina maximal line arrangements exist for all pairs $(d,r)$ with $d\\ge 4$ and $d/2\\le r\\le 2(d-1)/3$, and in the odd case $d-r$ odd up to $3(d-1)/4$; in particular every odd degree $d=2r-1\\ge 7$ admits such an arrangement.","For free arrangements, deleting a hyperplane $H$ with $|A|-|A^H|$ equal to the second exponent $d_2$ lowers the second exponent by one, while otherwise it stays $d_2$.","Pairs of arrangements with identical combinatorics but different $r(A)$ can be constructed for any $d\\ge 9$ and any number $n_3\\ge 6$ of triple points."],"supporting_citations":[{"why":"supplies the identification $D_0(A)\\simeq D_H(A)$ and the basic facts about logarithmic derivations used throughout","marker":"[28]"},{"why":"provides the polynomial $B$-theorem that lets derivations of $A'$ of low degree extend to $A$","marker":"[25]"},{"why":"gives the multiple deletion theorem used to describe $r$ after deleting from a free arrangement","marker":"[6]"},{"why":"supplies plus-one generated arrangements, used in the non-free deletion case of Theorem 2.17","marker":"[4]"},{"why":"supplies the original 9-line pair with $n_3=6$, same combinatorics, and distinct $r$-values that Corollary 4.20 builds on","marker":"[30]"},{"why":"gives the upper bound $\\tau(d,r)_{\\max}$ defining Tjurina maximal curves, the target for the existence results","marker":"[19]"},{"why":"provides the primitive syzygy construction and the case analysis used in Corollary 3.8 and Propositions 4.14","marker":"[9]"},{"why":"supplies the conjectures and small-degree base cases for maximal Tjurina line arrangements that Theorems 4.10 and 4.11 aim to prove","marker":"[18]"}],"fun_headline_variants":["r(A) combinatorial iff at most five triple points","Minimal degree determined by lattice up to five triples","Addition-deletion theorem yields new Tjurina maximal lines","For lines, r(A) is combinatorial exactly up to n3=5"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The extremal Tjurina-maximality results for $r=d-4$ and $r=d-3$ assume that the printed equations define line arrangements, but as printed the factors such as $x^{2j}+y^{3j}-z$ are not linear forms, so those constructions do not define line arrangements and those two theorems are unsupported as stated.","fun_headline_variants_meta":{"raw":{"variants":["r(A) combinatorial iff at most five triple points","Minimal degree determined by lattice up to five triples","Addition-deletion theorem yields new Tjurina maximal lines","For lines, r(A) is combinatorial exactly up to n3=5"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000371,"raw_usage":{"total_tokens":1995,"prompt_tokens":966,"completion_tokens":1029,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":582,"completion_tokens_details":{"reasoning_tokens":959}},"tokens_in":582,"tokens_out":1029,"duration_ms":12186,"temperature":1.0,"reasoning_tokens":959,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:33:17.430323+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Look at the defining equations for $A_d$ and $B_d$: for $j\\ge 1$ each factor $x^{2j}+y^{3j}-z$ has degree at least two, so its zero set is not a line; the claimed line arrangement does not exist as written. A corrected construction would need genuine linear factors, and a direct computation of $r(A_d)$ or $r(B_d)$ from the Jacobian syzygies of any corrected family would settle whether the asserted values $r=d-4$ and $r=d-3$ can be achieved.","supporting_citations":[{"cited_title":"Yoshinaga, Freeness of hyperplane arrangements and rela ted topics","cited_arxiv_id":null,"evidence_quote":"supplies the identification $D_0(A)\\simeq D_H(A)$ and the basic facts about logarithmic derivations used throughout"},{"cited_title":"Terao, Arrangements of hyperplanes and their freeness I , II","cited_arxiv_id":null,"evidence_quote":"provides the polynomial $B$-theorem that lets derivations of $A'$ of low degree extend to $A$"},{"cited_title":"Abe and H","cited_arxiv_id":null,"evidence_quote":"gives the multiple deletion theorem used to describe $r$ after deleting from a free arrangement"},{"cited_title":"Ziegler, Combinatorial construction of logarithmic differentia l forms, Adv","cited_arxiv_id":null,"evidence_quote":"supplies the original 9-line pair with $n_3=6$, same combinatorics, and distinct $r$-values that Corollary 4.20 builds on"},{"cited_title":"du Plessis, C.T.C","cited_arxiv_id":null,"evidence_quote":"gives the upper bound $\\tau(d,r)_{\\max}$ defining Tjurina maximal curves, the target for the existence results"},{"cited_title":"Dimca, Curve arrangements, pencils, and Jacobian syzygies, Michigan Math","cited_arxiv_id":null,"evidence_quote":"provides the primitive syzygy construction and the case analysis used in Corollary 3.8 and Propositions 4.14"},{"cited_title":"Jacobian syzygies and plane curves with maximal global Tjurina numbers","cited_arxiv_id":"1901.05915","evidence_quote":"supplies the conjectures and small-degree base cases for maximal Tjurina line arrangements that Theorems 4.10 and 4.11 aim to prove"}],"review_version":1}