{"id":"e09fc233-c095-4f50-956e-41410b2d6286","arxiv_id":"2607.19457","paper_version":1,"verdict":"CONDITIONAL","confidence":"LOW","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The classification of floatless quartic-plus-three-lines arrangements is completed: exactly one arrangement is pseudoholomorphically realizable but not algebraically realizable, and it yields the first combinatorial patchworking with an algebraically unrealizable PL arrangement.","lead":"This paper finishes a classification of how a smooth quartic curve and three lines can be arranged in the real projective plane, when every oval of the curve crosses one of the lines. One arrangement can only be built with pseudoholomorphic curves, not with ordinary algebraic curves, and it is the first such example produced by a combinatorial patchworking.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"§4's algebraic non-realizability proof depends on an unproved claim that the first singular pencil member Ct0 is irreducible with a single node; the omitted auxiliary-line argument is load-bearing.","rationale":"The reader's weakest-assumption box already identifies the same step, and my independent reading agrees: Theorem 2(a) is the only argument separating algebraic from pseudoholomorphic realizability, and the Hilbert–Rohn–Gudkov pencil proof in §4 hinges on the unproved irreducibility/single-node claim. The pseudoholomorphic side is comparatively well supported: the braids in (3) are explicit and the quasipositive factorizations are checkable by hand or computer, so I would not put the main risk there. The non-realizability side, however, contains at least two 'easy to see' steps; the one about Ct0 is load-bearing because a reducible member would invalidate the dichotomy. I also note that the classification statements rely on tables and figures from [4]/[10] not reproduced, but that is a reproducibility issue rather than the sharpest logical gap. Because the missing argument is plausibly fillable and the surrounding framework (braid obstructions, Murasugi–Tristram, auxiliary conics) gives some support, a conditional verdict is right; the paper should be accepted only if the §4 step is either proved or replaced.","tokens_in":7137,"tokens_out":10150,"duration_ms":101771,"concrete_test":"Supply the missing auxiliary-line argument: for each of the two Figure 6 configurations, apply Bezout's theorem to the intersections of Ct with the four component lines of L and with one auxiliary line chosen in each white/gray region, tracking these intersections as t approaches t0. Show that a reducible Ct0 (line + cubic or two conics) or a non-nodal singularity would force one of these intersection counts to change before the first singular member can be a single node, contradicting the fixed isotopy for t < t0. If the argument cannot be completed, the dichotomy in §4 is unsupported.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The proof of Theorem 2(a) in §4 is the only place where the paper separates algebraic from pseudoholomorphic realizability. It forms the pencil f + tl = 0 with l = 0 the union of Lx, Ly, Lz and a moved-off line L0, and needs the first singular member Ct0 to be an irreducible quartic with one node. The text says only: \"It is easy to see that Ct0 cannot be reducible: it is enough to look at the evolution of the intersection of Ct with some auxiliary lines.\" No auxiliary lines or evolution are specified. This is not a routine consequence: pencils of quartics can have reducible singular members (line + cubic or two conics) whose singularities are not a single node, and the preceding isotopy condition Ct ∪ L fixed for 0 ≤ t < t0 does not by itself rule them out. The subsequent dichotomy—(i) real node in white region giving arrangement no. 29 or (ii) imaginary node in gray region giving an impossible free oval—and the conclusion that these are the only possibilities depend entirely on irreducibility/single-node. If Ct0 were reducible or had a tacnode/cusp, the contradiction would not follow. Because Theorem 2(a) supports the headline that the patchworking is the first algebraically unrealizable combinatorial patchworking, this omitted argument is load-bearing.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper completes the classification of mutual arrangements of a smooth real algebraic (or pseudoholomorphic) quartic and two or three lines under the floatless condition. Building on Maletto's computational classification, the author proves that all remaining open floatless arrangements except one are not pseudoholomorphically realizable, and that the exceptional arrangement is pseudoholomorphically realizable but not algebraically realizable. The algebraic non-realizability proof uses a Hilbert-Rohn-Gudkov pencil argument; the pseudoholomorphic realizability is established both via braid-quasipositivity and via a combinatorial patchworking on an irregular triangulation. The paper claims the first example of a combinatorial patchworking producing a PL curve whose coordinate-line arrangement is algebraically unrealizable.","tokens_in":7469,"tokens_out":11582,"duration_ms":105182,"significance":"If the proofs are correct, this is a significant contribution to the topology of real algebraic and pseudoholomorphic curves. It closes the open cases of a recent classification and provides a sharp algebraic-versus-pseudoholomorphic separation, with a novel combinatorial patchworking example. The paper uses established tools (Orevkov's braid method, Viro patchworking, Hilbert-Rohn-Gudkov) and extends them to a new setting. The author also gives explicit quasipositive decompositions for the key braids, which is a concrete, checkable contribution. The main caveat is the heavy reliance on external computer-assisted lists from Maletto's work, but this is a natural dependency for this type of classification.","major_comments":[{"comment":"The proof depends on the sentence 'It is easy to see that Ct0 cannot be reducible: it is enough to look at the evolution of the intersection of Ct with some auxiliary lines.' No auxiliary lines are specified and the evolution argument is not given. The first singular member of a pencil of quartics can be reducible (line plus cubic or two conics) even when the preceding members are nonsingular and isotopic, so the claim is not a routine consequence. The subsequent dichotomy—real node in the white region versus imaginary node in the gray region—and the contradictions with arrangement no. 29 and with the free-oval argument rely on Ct0 being irreducible with a single node. Please provide a complete proof of irreducibility and the single-node assertion, or replace the argument.","section":"§4 (proof of Theorem 2(a))"},{"comment":"Theorem 2(b) asserts a completeness classification, but for the entries marked MT and Lk the paper only states that the arrangements are excluded by the Murasugi-Tristram inequality or by linking numbers as in [7]. The braid words, Lp-schemes, and the computed invariants for these cases are not given. The same holds for the claim in the discussion of no. 44 that 'a computation of the linking numbers shows that b+1 is not [quasipositive].' Since these exclusions are essential to the 'only' part of Theorem 2(b), the supporting computational data should be included in an appendix, a supplementary file, or a repository so that the case analysis can be verified.","section":"§3 (Table (2), proof of Theorem 2(b))"}],"minor_comments":[{"comment":"Typo: '49 floatless arrangements (C4, Lx, Lx, Lz)' should read '(C4, Lx, Ly, Lz)'.","section":"§1, paragraph 4"},{"comment":"The braid expressions are difficult to parse because superscripts and subscripts are easily confused. Please ensure the typesetting clearly distinguishes exponents (e.g., σ3^4) from generator indices.","section":"§3, Equation (3)"},{"comment":"The proof that 'any irregular lattice triangulation' of the triangle is the one in Figure 7 (up to edge removals) is stated as 'well-known' without reference, and the final sign-distribution check is left as 'straightforward.' A citation or a short argument would make the uniqueness claim more credible, especially since it is used in the remark about the first non-algebraic patchworking.","section":"§5, Proposition 1 proof"}],"recommendation":"major_revision","confidential_remarks":"The paper addresses an interesting and timely problem, and the main result is likely correct, but the missing justification in the Hilbert-Rohn-Gudkov argument (§4) is a genuine load-bearing gap that must be fixed. The completeness claim in Theorem 2(b) also needs a clear way to access the case-check computations. These are fixable within the manuscript's scope, so I recommend major revision rather than rejection. The author is clearly an expert and the external dependencies on Maletto's list are acceptable in this area, though the journal should consider whether the computational data should be archived permanently."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The headline: this paper very likely completes the classification started by Maletto and gives the first combinatorial patchworking that outputs an algebraically unrealizable PL arrangement. The pseudoholomorphic half is convincingly done; the algebraic half has a real gap at a load-bearing point.\n\nWhat is genuinely new: the exclusions in Theorem 1 and Theorem 2(b), the explicit quasipositive factorizations for the two Lp-schemes realizing the exceptional arrangement, and the observation that the irregular triangulation patchworks produce exactly that arrangement. The braid computations are explicit and checkable—that is solid evidence. The writing is economical and mostly clear.\n\nThe soft spot is in §4. The Hilbert–Rohn–Gudkov pencil argument needs the first singular member Ct0 to be irreducible with a single node. The text says \"It is easy to see that Ct0 cannot be reducible\" and points to \"the evolution of the intersection of Ct with some auxiliary lines,\" but the lines and the evolution are never specified. This is not a routine detail: if Ct0 were reducible (line + cubic or two conics) or had a worse singularity, the dichotomy between a real node in the white region and an imaginary node in the gray region collapses, and the contradiction with arrangement no. 29 and the free-oval argument would not go through. Because Theorem 2(a) is what separates algebraic from pseudoholomorphic realizability, this missing argument is load-bearing, not a cosmetic omission.\n\nThere is also a broader verification difficulty: many cases are delegated to figures and tables in [4] and [10] that are not reproduced. That reliance may be legitimate, but the paper is hard to check without those documents at hand. The \"straightforward to check\" sign-distribution count in Proposition 1 is minor by comparison.\n\nI think the central claim is probably right—the rest of the proof structure is coherent and the braid side is solid—but the §4 gap is exactly the kind of thing that needs referee attention. If the irreducibility claim can be proven, the paper will be a strong contribution.\n\nRecommendation: send to peer review. The editor should ask for a proof, or at least a detailed sketch, of the auxiliary-line argument in §4, and for the relevant data from [4]/[10] to be available. This paper is worth the referee time.","headline":"Plausibly completes the classification and offers the first algebraically unrealizable combinatorial patchworking, but the algebraic non-realizability proof has a load-bearing gap.","tokens_in":7927,"tokens_out":2499,"would_cite":true,"duration_ms":24133,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["14P25","14H50"],"pacs":[],"model":"deepseek-v4-flash","headline":"Exactly one arrangement of a real quartic and three lines is realizable pseudoholomorphically but not algebraically, completing the classification.","keywords":["real algebraic curves","real pseudoholomorphic curves","quartic curves","line arrangements","combinatorial patchworking","braid quasipositivity","Hilbert's 16th problem","oval arrangements"],"falsifier":"The cleanest way to test the central non-realizability claim is to attempt an explicit algebraic construction: find a real quartic and three real lines whose arrangement matches Figure 2. The paper predicts no such curve exists, so any concrete example would refute Theorem 2(a); running the deformation pencil on such an example would show precisely where the single-node assumption would fail.","tokens_in":7023,"feed_emoji":"📐","tokens_out":9816,"duration_ms":86970,"temperature":0.7,"pith_summary":"The paper completes the classification of arrangements of a smooth real quartic curve and three lines, under the condition that every oval of the quartic meets at least one of the lines (the 'floatless' case). It shows that, among the floatless arrangements left open by earlier work, all but one are not realizable even by pseudoholomorphic curves, while the single remaining arrangement is realizable by pseudoholomorphic curves but not by algebraic curves. The algebraic obstruction is obtained from a Hilbert–Rohn–Gudkov pencil argument; the pseudoholomorphic realization is certified by explicit quasipositive factorizations of the braids associated with the arrangement. The paper further shows that this exceptional arrangement arises from a combinatorial patchworking on an irregular triangulation, the first such patchworking whose output is algebraically unrealizable.","feed_headline":"One quartic arrangement is realizable only pseudoholomorphically","feed_subtitle":"Closes the last open case and gives the first patchworking that is algebraically unrealizable.","key_machinery":"The proof has three load-bearing components. For realizability, it uses braid theory: an arrangement is converted, via a pencil of lines through a chosen point, into one or more L_p-schemes (fiberwise arrangements relative to the pencil), and each scheme yields a 6-braid; the arrangement is pseudoholomorphically realizable exactly when all such braids are quasipositive, meaning they factor into conjugates of positive half-twists. For algebraic non-realizability, it uses a Hilbert–Rohn–Gudkov pencil: deforming the quartic by f + t l = 0 until the first singular member appears, then constraining that member's singularity and the resulting oval evolution by Bezout and genus considerations. For","core_discovery":"The central discovery is a genuine gap between algebraic and pseudoholomorphic realizability in degree four. The two arrangements shown in the paper's Figure 2 — one floatless, one obtained by adding a free oval — are pseudoholomorphically realizable: the paper encodes the possible fiberwise schemes as 6-braids, writes both braids as explicit products of conjugates of positive half-twists, and applies the known criterion that such quasipositive braids correspond to pseudoholomorphic curves. The same arrangements are not algebraically realizable: assuming an algebraic quartic exists and choosing an auxiliary line, the paper forms the pencil f + t l = 0 and argues that its first singular membe","pith_inferences":["Because the pencil argument is the only algebraic obstruction, one could automate the Hilbert–Rohn–Gudkov step and apply it to the remaining 8198 open cases, turning a large part of the classification into a computational check.","The existence of a degree-four gap suggests that algebraic and pseudoholomorphic classifications of real plane curves diverge much earlier than previously expected; higher-degree analogues may produce further gaps relevant to Hilbert's 16th problem.","The explicit quasipositive braid factorizations provide a concrete certificate that could be used to identify all pseudoholomorphic realizations of the same arrangement, since any two such realizations should be related by standard braid moves.","The paper's conjecture that the patchworking construction is not rigidly isotopic to the pencil construction could be tested by comparing invariants of the two curves; a positive answer would show the pseudoholomorphic category is not unique even when realizability holds."],"forward_implications":["The earlier classification lists now become complete: algebraically realizable arrangements of a quartic with two lines and floatless arrangements with three lines are fully enumerated, and the pseudoholomorphic classification is obtained by adding exactly one floatless arrangement.","The exceptional example is the first combinatorial patchworking that produces a piecewise-linear curve in the real projective plane whose arrangement relative to the coordinate axes is not realizable by an algebraic curve of the same degree.","Perturbing the three lines into a cubic yields the corollary that the corresponding arrangement of a cubic curve and four lines is pseudoholomorphically realizable but algebraically unrealizable.","Up to symmetry, the only combinatorial patchworkings of degree 4 realizing the exceptional arrangement are the two given in the paper, so the construction is essentially unique.","The same methods, possibly automated, are expected to advance the much larger classification of all arrangements (not only floatless), where 8198 cases remain open."],"fun_headline_variants":["Pseudoholomorphic quartic defies algebraic realization","First algebraically impossible patchworking found","Quartic arrangement: only pseudoholomorphic, not algebraic","Algebraic gap in quartic arrangements closed"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The algebraic non-realizability proof hinges on the unshown claim that the first singular curve in the pencil f + t l = 0 has a single node and cannot be reducible; if that singular member could instead be reducible or have a worse singularity, the contradictions that rule out the arrangement would not follow.","fun_headline_variants_meta":{"raw":{"variants":["Pseudoholomorphic quartic defies algebraic realization","First algebraically impossible patchworking found","Quartic arrangement: only pseudoholomorphic, not algebraic","Algebraic gap in quartic arrangements closed"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000191,"raw_usage":{"total_tokens":1120,"prompt_tokens":622,"completion_tokens":498,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":366,"completion_tokens_details":{"reasoning_tokens":440}},"tokens_in":366,"tokens_out":498,"duration_ms":7738,"temperature":1.0,"reasoning_tokens":440,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T12:43:27.798406+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"The cleanest way to test the central non-realizability claim is to attempt an explicit algebraic construction: find a real quartic and three real lines whose arrangement matches Figure 2. The paper predicts no such curve exists, so any concrete example would refute Theorem 2(a); running the deformation pencil on such an example would show precisely where the single-node assumption would fail.","supporting_citations":[],"review_version":1}