{"id":"7b4f8066-5a3a-4cfa-abde-9e5048ad4498","arxiv_id":"1908.06897","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For finite posets R and S, a strong G-scheme exists from R to S if and only if #S(P,R) ≤ #S(P,S) for every finite poset P.","lead":"This paper proves that, for finite posets, the existence of a strong G-scheme is exactly equivalent to an inequality between strict order homomorphism counts for every test poset. It also gives a finite checkable sufficient condition and a systematic construction for new examples.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the proof of Theorem 1 appears sound after a step-by-step check of the factorization argument and Lemma 5.","rationale":"The reader accepted the paper while flagging the self-cited lemmas from [5] as the weakest assumption. My stress-test focused on the same part of the argument, specifically Lemma 5 and the factorization through G(ξ), because that is where the equivalence (2)⇒(1) actually bears its weight. I checked the injectivity and surjectivity of ζ↦ι_ζ, the use of Lemma 2 to prevent merging of quotient blocks, and the antisymmetry argument in Lemma 3. Each step checks out. The two imported facts from [5] are simple enough to derive directly: strictness forces all fibers to be antichains, so G_ξ(x)={x}, and conversely; and Lemma 2 is just the observation that a proper inclusion of connected components in a fiber forces a comparable crossing edge with a strict ξ-increment. Thus I do not see a load-bearing defect in the central claim. I nevertheless suggest an independent computational check of Lemma 5 for small posets, because a single counterexample there would invalidate the theorem, and the paper provides no code or machine-checked proof. The minor gap in Lemma 4 regarding transfer from P_r to arbitrary P via isomorphism is easy to fill and does not affect the conclusion. Hence the ACCEPT verdict should stand unchanged.","tokens_in":19681,"tokens_out":31487,"duration_ms":314917,"concrete_test":"Write a brute-force checker over all unlabeled finite posets with at most 4 elements (24 posets). For every triple (P,Q,T) in this set and every homomorphism ξ:P→Q, compute the partition G(ξ), build the quotient poset (G(ξ),≼) as in Definition 6, and explicitly enumerate Γ_{P,T}(ξ)={ζ∈H(P,T): G(ζ)=G(ξ)} and S(G(ξ),T), comparing cardinalities. If any equality #Γ_{P,T}(ξ)=#S(G(ξ),T) fails, Lemma 5 and hence Theorem 1 would be refuted; if the check passes for all such triples, it materially corroborates the key step of the proof.","verdict_should_be":"UNCHANGED","load_bearing_attack":"No significant objection identified. I examined the central implication (2)⇒(1) of Theorem 1. The key identity is Lemma 5, which states #Γ_{P,T}(ξ)=#S(G(ξ),T). The bijection is valid: ζ↦ι_ζ is injective by Corollary 2(5); conversely, for any strict σ:G(ξ)→T, the composite ζ=σ∘π_ξ lies in Γ because if G_ξ(x) were a proper subset of G_ζ(x), Lemma 2 would yield a<b in G_ζ(x) with ξ(a)<ξ(b), hence G_ξ(a)≺G_ξ(b) in the quotient; strictness of σ would force ζ(a)<ζ(b), contradicting a,b lying in the same ζ-fiber. Lemma 3 (which ensures the quotient is a poset and ι_ξ is strict) is also correct: a cycle with equal ι-endpoints forces ξ to be constant on the connected union V, collapsing all blocks. The imported facts from [5] — that strict homomorphisms are exactly those with G_ξ(x)={x}, and Lemma 2 itself — are elementary consequences of connectedness of fibers, so the dependence on prior work is not a serious correctness risk. A minor unannotated step is that Lemma 4 transfers Γ-inequalities from representatives in P_r to arbitrary P by isomorphism; this is straightforward and not load-bearing. Overall, the central equivalence appears sound.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the preorder R ⊑_G S defined by the existence of a strong G-scheme from R to S. The main result, Theorem 1, characterizes R ⊑_G S by the strict-homomorphism-counting inequalities #S(P,R) ≤ #S(P,S) for all finite posets P, and equivalently for all connected finite posets P. The proof factorizes a homomorphism ξ through G(ξ), the partition of the carrier into connected components of the fibers of ξ. Corollary 1 shows G(ξ) is a poset with a strict natural map to the target; Lemma 5 identifies the fiber Γ_{P,T}(ξ) with the set S(G(ξ),T) of strict homomorphisms, which yields the hard direction (2)⇒(1) of Theorem 1. Corollary 3 deduces that equality of all strict-homomorphism counts forces isomorphism. Theorem 2 provides a sufficient condition for R ⊑_G S based on finitely many connected posets and distributors, and Section 5 applies it to two examples and develops Theorem 3, a construction for posets P+Q and T with P+Q ⊑_G P|A + T, where A is convex in P, plus a strong I-scheme strengthening when A is an antichain.","tokens_in":19987,"tokens_out":12472,"duration_ms":127847,"significance":"If Theorem 1 is correct, it is a clean structural characterization: the seemingly more complicated G-scheme preorder is equivalent to a monotonicity condition on strict homomorphism counts, and equality of those counts is a new proof that a finite poset is determined up to isomorphism by the cardinals #S(P,·). The reduction to connected posets and the finite criterion in Theorem 2 are useful tools. I checked the central proof carefully: the quotient construction in Corollary 1 is sound, the bijection in Lemma 5 is valid, and the use of Lemma 4 transfers the inequalities exactly as claimed. The paper is not fully self-contained, since two load-bearing facts are quoted from the author's earlier preprint [5], namely the strictness criterion Gξ(x)={x} and Lemma 2; these are elementary and are used consistently, so I do not regard the dependence as a correctness risk, only as a presentation issue.","major_comments":[],"minor_comments":[{"comment":"The criterion \"ξ is strict iff Gξ(x)={x}\" is quoted from [5, Corollary 3] and is used in the first step of the proof of Theorem 1; because this fact is load-bearing for the main equivalence, please include a short proof or at least a fully explicit statement so that the dependence on an external preprint is transparent.","section":"Section 2.2 / Definition 2 and Theorem 1"},{"comment":"Lemma 4 is stated for all P∈P, but the G-scheme in Definition 3 is defined only on the representation system P_r; the proof should explicitly invoke that every finite poset is isomorphic to a representative in P_r and that the sets Γ_{P,R}(ξ) and Γ_{P,S}(ξ) are invariant under such isomorphisms.","section":"Lemma 4"},{"comment":"In the embedding-counting inequality at the end of the proof, the step #Emb(E,A') + #(F1∪F2) ≥ #F1 + #F2 is compressed; it follows by inclusion-exclusion from the injection F1∩F2 → Emb(E,A') constructed in the preceding sentence, and that derivation should be written out explicitly.","section":"Theorem 3 proof"},{"comment":"The sentence \"the two outer ones in E(C3;0011)\" is not self-explanatory; please annotate Figure 6 or describe the two points explicitly so the claimed distinguishing property can be checked without reading the figure labels in a particular way.","section":"Section 5.1"},{"comment":"There are several typographical slips that should be corrected, including \"dubble-N\" for double-N in Section 2.1, \"poests\" in the introduction, \"fullfills\" in Section 5.1, and the German-size remnants \"Größe 60%\" and \"Größe 45%\" in the figure captions.","section":"Throughout"}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The main result is real. Theorem 1—that R ⊑_G S iff #S(P,R) ≤ #S(P,S) for every finite poset P, with the connected version equivalent—is a clean characterization and I don't see it in the cited literature. The corollary extending Lovász's counting theorem to strict homomorphisms is a natural and correct byproduct. The proof is also in better shape than I expected: the quotient construction on G(ξ), Lemma 5's bijection between the fibers and strict maps out of the quotient, and the use of Lemma 2 all check out. I walked through the key implication (2)⇒(1) step by step, including the factorization argument and the injectivity claim, and it holds. The self-citations to [5] for the strictness criterion and Lemma 2 are not a serious risk; as the stress-test note says, those facts are elementary once you have connectedness of the G-fibers.\n\nWhat the paper does well beyond the theorem: it gives a finite-checkable sufficient condition (Theorem 2) and a construction method (Theorem 3), and it tests both on worked examples. The two examples in Section 5.1 are genuinely illustrative, not decorative. This is a toolbox-oriented contribution, and the tools are nontrivial.\n\nSoft spots are real but mostly minor. The paper leans heavily on the author's prior work [5, 6], which are arXiv preprints; a reader without those in hand has to take several foundational definitions and results on faith. That is acceptable in a niche subfield, but an editor should ask for the imported lemmas to be stated clearly enough to be checked without constant cross-referencing. The presentation is dense, with a few typos and some notation that takes getting used to, especially the EV-system calculations. The significance is confined to finite poset theory and the author's research program; the impact is not broad. But that is not a flaw—it's just scope.\n\nThe citation pattern is honest. Lovász, Birkhoff, Hashimoto, McKenzie, Duffus, and Wille are cited in the right places. The author's self-citations are extensive but appropriate given the subject; the key novelty is the strict-homomorphism characterization, which is not in the earlier papers.\n\nWho is this for? Specialists in ordered sets and homomorphism-counting questions. It deserves a serious referee: the central theorem is correct, the proof is original, and the paper moves a longstanding question—what conditions on homomorphism sets force order-isomorphism—in a new direction. A competent referee can verify the main line without too much pain, and the added tools are checkable. Recommend sending it to peer review, with the caveat that the author should be asked to make the paper more self-contained with respect to [5, 6] before publication. I would cite the main theorem in future work on poset homomorphism counts.","headline":"A sound and genuine result in finite poset combinatorics: the equivalence between strong G-schemes and strict homomorphism inequalities is new and the proof survives scrutiny, though its significance is modest and its dependence on earlier arXiv preprints is a minor concern.","tokens_in":780,"tokens_out":876,"would_cite":true,"duration_ms":19942,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["06A07","06A06"],"pacs":[],"model":"deepseek-v4-flash","headline":"For finite posets, the strong G-scheme preorder is exactly the strict-homomorphism count preorder.","keywords":["finite posets","order homomorphisms","strict homomorphisms","G-schemes","Hom-schemes","poset preorder","EV-systems","cancellation of exponents"],"falsifier":"Enumerate all pairs of finite connected posets up to, say, eight points and compute #S(P,R) and #S(P,S) for all connected P up to the same size; a pair where the inequalities all hold but an explicit search for a strong G-scheme finds none would refute the theorem, while a reversed inequality would show R ⊑_G S fails.","tokens_in":19492,"feed_emoji":"🧩","tokens_out":7373,"duration_ms":74065,"temperature":0.7,"pith_summary":"The paper proves a characterization of the strong G-scheme preorder on finite posets: a strong G-scheme from R to S exists exactly when every finite poset P sends no more strict order homomorphisms to R than to S, and it is enough to check connected P. Strict homomorphisms are the maps that preserve strict comparabilities, so the result says that a regularity-preserving injective comparison of full homomorphism sets is controlled entirely by these stricter map counts. The characterization turns an infinite family of existence questions into cardinality comparisons, and it yields the corollary that two finite posets with equal strict-homomorphism counts for every finite P are isomorphic. The paper also supplies a finite sufficient condition for the relation and a construction producing new examples of the form P + Q ⊑_G P|A + T, where A is a convex subposet of P.","feed_headline":"Strict map counts decide the G-scheme preorder","feed_subtitle":"If every test poset sends no more strict maps to R than to S, a regular injection of all homomorphism sets exists.","key_machinery":"The load-bearing object is the quotient partition G(ξ) of a homomorphism ξ: P → Q: its blocks are the connected components Gξ(x) of the preimage $ξ^{{-1}}$(ξ(x)) containing x. Every homomorphism factors as ξ = ιξ ∘ πξ, with πξ collapsing each block to a point and ιξ a strict homomorphism from the quotient poset G(ξ) to Q. The key counting lemma states that for a fixed quotient G(ξ), the homomorphisms from P to T sharing that quotient are in bijection with the strict homomorphisms from G(ξ) to T, so #Γ_{P,T}(ξ) = #S(G(ξ),T). This identity converts the strict-count inequality for the arbitrary test poset G(ξ) into the fiberwise injectivity needed to build a strong G-scheme.","core_discovery":"The paper's main theorem states that for finite posets R and S the following are equivalent: a strong G-scheme from R to S exists; #S(P,R) ≤ #S(P,S) for every finite poset P; and #S(Q,R) ≤ #S(Q,S) for every connected finite poset Q. A strong G-scheme is a family of injective maps from the homomorphism sets H(P,R) into H(P,S), one family member for each isomorphism type P, that preserves the connected-component structure of each homomorphism's preimage fibers. The paper thereby reduces a regular injective comparison of all homomorphism sets to a plain numerical comparison of strict-homomorphism counts. An immediate consequence is that #S(P,R) = #S(P,S) for all finite P forces R ≅ S; the paper further derives a finite-check sufficient condition for the preorder and a construction method for posets T with P + Q ⊑_G P|A + T for convex A.","pith_inferences":["The quotient factorization suggests defining the strict-homomorphism profile of a poset as the vector of counts #S(P,·) over connected P; the paper shows this profile completely determines the G-scheme preorder, so it may serve as a complete invariant analogous to homomorphism-count profiles elsewhere.","Because Theorem 1 makes the G-scheme relation a cardinality comparison, finite-precision obstructions can be sought by computing strict counts only, which is plausible for computer enumeration; the paper does not address complexity or bounds.","A testable extension is to ask whether the same strict-count characterization holds for other relational structures whose fibers have a connectivity notion, such as graphs with zigzag-connected fibers under graph homomorphisms; the paper does not claim this."],"forward_implications":["The preorder on finite posets defined by strong G-schemes is the same as pointwise comparison of the sequences (#S(P,R))_P, so all structural facts about the G-scheme preorder can be read off strict-homomorphism counts.","To decide R ⊑_G S, only connected test posets need to be checked; disconnected P factor as products over components.","If all finite posets P give #S(P,R) = #S(P,S), then R and S are isomorphic; this refines the classical homomorphism-count cancellation result to strict maps.","A finite certificate suffices in many cases: Theorem 2 reduces the infinite check to a finite set of connected posets, embedding counts, and distributors.","Theorem 3 constructs new pairs P + Q ⊑_G P|A + T whenever A is convex in P, giving a systematic source of nontrivial strong G-schemes."],"supporting_citations":[{"why":"Supplies the characterization that a homomorphism is strict exactly when Gξ(x) = {x} for every x, used at the start of Theorem 1.","marker":"[5, Corollary 3]"},{"why":"Controls whether one preimage-component partition properly contains another, used inside Lemma 5 to prove the counting identity for Γ_{P,T}(ξ).","marker":"[5, Lemma 1]"},{"why":"Provides the factorization of strict homomorphisms into a surjective strict map followed by an embedding and the resulting count formula, used in Theorem 2 and its corollaries.","marker":"[18, Equation (7)]"},{"why":"Gives the EV-system criterion for strong G-schemes that Proposition 1 simplifies using strict-count data.","marker":"[5, Proposition 3]"},{"why":"Supplies calculation rules for EV-systems, in particular E(P + Q) = E(P) + E(Q), used in the construction part.","marker":"[6]"},{"why":"Gives the strong I-scheme criterion invoked when the constructed subposet A is an antichain.","marker":"[5, Theorem 5]"}],"fun_headline_variants":["Strict hom counts determine strong G-schemes","G-scheme existence is a counting problem","Finite counts replace infinite hom checks","Equal strict maps force poset isomorphism"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof imports from earlier work the fact that a homomorphism is strict exactly when every point is isolated within the connected component of its own preimage, together with a lemma on when those components grow; the equivalence between strong G-schemes and strict-homomorphism count inequalities breaks if these imported facts fail.","fun_headline_variants_meta":{"raw":{"variants":["Strict hom counts determine strong G-schemes","G-scheme existence is a counting problem","Finite counts replace infinite hom checks","Equal strict maps force poset isomorphism"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000345,"raw_usage":{"total_tokens":1935,"prompt_tokens":1030,"completion_tokens":905,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":646,"completion_tokens_details":{"reasoning_tokens":849}},"tokens_in":646,"tokens_out":905,"duration_ms":8919,"temperature":1.0,"reasoning_tokens":849,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:33:07.475088+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate all pairs of finite connected posets up to, say, eight points and compute #S(P,R) and #S(P,S) for all connected P up to the same size; a pair where the inequalities all hold but an explicit search for a strong G-scheme finds none would refute the theorem, while a reversed inequality would show R ⊑_G S fails.","supporting_citations":[{"cited_title":"Calculation Rules and Cancellation Rules for Strong Hom-Schemes","cited_arxiv_id":"1908.05681","evidence_quote":"Supplies calculation rules for EV-systems, in particular E(P + Q) = E(P) + E(Q), used in the construction part."}],"review_version":1}