{"id":"44ce9564-b7be-4f32-942a-61ca5b7935f5","arxiv_id":"2508.01606","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For rooted and unstarred increasing trees, the ornamentation lattice is a lattice quotient of the acyclic reorientation lattice and is realized by the path hypergraphic polytope, answering an open question of Defant and Sack.","lead":"This paper proves that for rooted and certain other increasing trees, the \"ornamentation lattice\" formed by nested path decorations is both a quotient of the tree's reorientation lattice and visible as the skeleton of a known polytope. It also gives a complete test for when the acyclic sourcing poset of a collection of paths in an increasing tree is a lattice.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1.4(4) is not self-contained: it depends on the unpublished [Gél25] source characterization; if that result is wrong or unavailable, the polytopal realization of O(T) is unsupported.","rationale":"The reader's conditional verdict correctly focuses on [Gél25]. I read the full proof of Theorem 1.4: items (1)–(3) are supported by Propositions 5.3, 5.5, 5.8 and internal arguments. Item (4) is the only point at which an external, unpublished result is load-bearing. Since the paper itself identifies the 'source characterization' as proved elsewhere (Remark 3.8) and lists [Gél25] as 'In preparation', the geometric result is not verifiable from the arXiv submission. This does not make me suspect fraud or even error; the risk is exactly a verification dependence. A public proof or an independent derivation restricted to path hypergraphs would lift the conditionality. The combinatorial sections (MacNeille completions, unstarred quotient structure, intreeval characterization) are detailed and internally consistent; I do not see a more serious internal gap. Hence I keep the reader's CONDITIONAL verdict rather than rejecting or accepting outright.","tokens_in":42688,"tokens_out":6980,"duration_ms":78867,"concrete_test":"As an analytical check, write out a complete proof of the Remark 3.8 identification for H = P(T) with T unstarred, starting from the face-lattice description of △H in [BBM19] and the acyclicity criterion in Definition 3.7, and confirm that no hypothesis beyond H ⊆ P(T) is needed. If the proof cannot be supplied, or if it fails for some unstarred tree, Theorem 1.4(4) is not established. As a supporting computational sanity check, enumerate AS(P(T)) and compute the ω-oriented graph of △P(T) for every unstarred increasing tree on n ≤ 7 to confirm that the transitive closures are isomorphic.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central geometric claim (Theorem 1.4(4), Corollary 5.9) asserts that for unstarred increasing trees, O(T) is the transitive closure of the graph of the path hypergraphic polytope △P(T) oriented by ω. This is obtained by combining AS(P(T)) ≅ O(T) (Proposition 3.31 and Proposition 5.5) with the statement in Remark 3.8 that AS(H) is the transitive closure of the ω-oriented graph of △H, attributed to the in-preparation preprint [Gél25]. The paper contains no proof of that characterization, and Remark 3.8 itself notes that the oriented graph need not be transitively reduced, so the identification is a substantial theorem rather than a formality. If [Gél25] is not publicly available or its proof does not cover path hypergraphs of unstarred trees, Corollary 5.9 and Theorem 1.4(4) do not follow from the material in this paper, and the claimed answer to the Defant–Sack question is not established by this work alone. The lattice-theoretic parts of Theorem 1.4 appear to have self-contained proofs; the vulnerability is specifically the geometric bridge.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies three families of posets attached to a directed graph D: the acyclic reorientation poset of its transitive closure tc(D), the acyclic sourcing poset of its path hypergraph P(D), and the (acyclic) ornamentation poset of D. The authors establish order-preserving surjections among these posets and then specialize to increasing trees. For an increasing tree T they prove that the ornamentation lattice O(T) is semidistributive, describe its join and meet irreducibles, and show that O(T) is the MacNeille completion of AS(P(T)) and that the transitively biclosed reorientation lattice is the MacNeille completion of AR(tc(T)). For unstarred trees (which include rooted trees) they prove that all ornamentations are acyclic, that AS(P(T)) is isomorphic to O(T) and is a lattice quotient of AR(tc(T)), and that O(T) is isomorphic to the transitive closure of the graph of the path hypergraphic polytope P(P(T)) oriented in a linear direction, thereby answering a question of Defant and Sack for that family. The final section characterizes the subhypergraphs of P(T) whose acyclic sourcing poset is a lattice in terms of path intersection closedness and star sparsity, generalizing the interval hypergraph results of Bergeron–Pilaud.","tokens_in":42900,"tokens_out":7178,"duration_ms":81083,"significance":"If the results hold, the paper gives a clean conceptual unification of three Tamari-like hierarchies and answers the Defant–Sack polytopal realization question for rooted and unstarred trees. The combinatorial parts are detailed and self-contained: the semidistributivity proof, the MacNeille completion arguments, the lattice-quotient statement, and the Section 6 characterization are all argued from explicit definitions with full proofs. The paper also provides concrete enumerative results for brooms and combs, with generating functions and bijections. The main weakness is that the geometric bridge used for the headline polytopal realization is not established in this manuscript but is cited to an in-preparation coauthor preprint [Gél25]; the stress-test concern on this point is valid and is the only load-bearing gap I found. For the non-geometric results, the paper is convincing and well within the standards of the field.","major_comments":[{"comment":"The polytopal realization of O(T) is not established by the present paper alone. The identification of AS(H) with the transitive closure of the graph of the hypergraphic polytope oriented in direction ω is attributed to [Gél25], an in-preparation preprint by a coauthor, and no proof appears in the manuscript. Since this identification is exactly the step that converts the combinatorial isomorphism AS(P(T)) ≅ O(T) into the claimed isomorphism between O(T) and the oriented graph of △P(T), the answer to the Defant–Sack question is conditional on an unpublished external result. Please either include a proof of the needed source characterization (at least for path hypergraphs of unstarred trees, which is all that Theorem 1.4(4) requires) or cite a publicly available complete source. Without this, Theorem 1.4(4) and Corollary 5.9 should be rephrased as conditional on [Gél25].","section":"§3.2 (Remark 3.8), §5.2 (Theorem 1.4(4), Corollary 5.9)"}],"minor_comments":[{"comment":"The acyclicity of SO is only asserted with \"the proof is similar\", but prop. 5.5 is load-bearing for Theorem 1.4(2). A short argument would be useful: since RO = RSO by Lemma 2.42 and RO is acyclic, a directed cycle in SO would yield a directed cycle in rev(RSO), contradicting the acyclicity already established.","section":"§5.2, Proposition 5.5"},{"comment":"The notation AOS and AOR is easy to confuse with OS and OR, especially because the subscript can be a reorientation or a sourcing. Consider a typographic distinction or a clearer naming convention, for instance using a bar or a superscript.","section":"§3.3, Definition 3.30"},{"comment":"The proof jumps from S1(J) ≤ S2(J) < S1(I) ≤ S2(I) to the assertion that min(J) ≤ S1(J) < min(I ∩ J) and max(I) ≥ S2(I) > max(I ∩ J). This is correct when S1 and S2 are acyclic, but a one-sentence justification would help the reader.","section":"§6.4, Lemma 6.26"},{"comment":"The dependence on [Gél25] and [Sac25], both in-preparation and both by coauthors, should be resolved before publication. If they remain unavailable, the statements that rely on them should be restricted to results proved in this paper.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The central geometric theorem depends on an in-preparation preprint by one of the authors, which is a novelty and corroboration concern. I recommend asking the authors to provide a complete proof of the source characterization for the specific hypergraphs used in Theorem 1.4(4), or to restrict the claim accordingly. The combinatorial core of the paper appears sound and is a good fit for the journal."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the paper's core lattice-theoretic results are new, well-proved, and worth publishing; the polytopal realization theorem is not self-contained because it leans on an unpublished coauthor preprint.\n\nThe genuinely new material: Theorem 1.3 identifies the transitively biclosed reorientation lattice and the ornamentation lattice as MacNeille completions of the respective acyclic posets for any increasing tree. Theorem 1.4 shows that for unstarred trees, acyclic reorientation, sourcing, and ornamentation posets are lattices, all ornamentations are acyclic, and the ornamentation lattice is a lattice quotient of AR(tc(T)). Theorem 1.6 gives a clean characterization of intreeval hypergraphs whose acyclic sourcing poset is a lattice, extending [BP24]. The proofs of these parts are detailed and internally consistent; the semidistributivity analysis for tree ornamentation lattices is well done, and the broom/comb enumerations are a nice extra.\n\nThe soft spot is exactly Theorem 1.4(4) / Corollary 5.9, the answer to the Defant–Sack question. The identification AS(H) = transitive closure of the ω-oriented graph of △H is only cited to [Gél25], an in-preparation coauthor preprint. Remark 3.8 even notes the oriented graph is not transitively reduced, so the cited result is doing real work. If it is unavailable or wrong, the geometric half of Theorem 1.4 does not follow from this paper. That does not undermine the lattice-theoretic theorems, which have self-contained proofs. But a serious referee should demand that dependency be resolved—either prove the source characterization here, or cite a public version.\n\nThe citation pattern is fine: [Pil24], [BP24], [DS24] are used appropriately. The [Gél25] dependency is a genuine gap in the paper as submitted, not misconduct.\n\nVerdict: accept for peer review. The paper is important for algebraic combinatorics and the combinatorial results deserve to be in the literature; the geometric claim needs either support or explicit conditional status. This is a revise-and-resubmit situation, not a desk reject.","headline":"Solid lattice-theoretic paper with a polytopal realization claim that depends on an unpublished coauthor preprint.","tokens_in":43484,"tokens_out":1955,"would_cite":true,"duration_ms":24106,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C65","06B05","52B11"],"pacs":[],"model":"deepseek-v4-flash","headline":"For unstarred increasing trees, the acyclic reorientation, sourcing, and ornamentation posets converge into a single lattice, and the ornamentation lattice is realized by the path hypergraphic polytope.","keywords":["ornamentation lattices","acyclic reorientation posets","acyclic sourcing posets","hypergraphic polytopes","path hypergraphs","increasing trees","MacNeille completion","lattice quotients"],"falsifier":"Enumerate all ornamentations of the $(2,3)$-broom (a rooted tree) and compare the resulting Hasse diagram with the graph of $\\Delta_{\\mathbb{P}(T)}$ oriented in direction $\\omega$; any mismatch in order or in cardinality would falsify the claimed polytopal realization.","tokens_in":42467,"feed_emoji":"🌳","tokens_out":8934,"duration_ms":92009,"temperature":0.7,"pith_summary":"This paper connects three generalizations of the Tamari lattice: reorientations of a graph's transitive closure, sourcings of its path hypergraph, and ornamentations of the graph. For an unstarred increasing tree, the acyclic versions of all three collapse into a single lattice, and that lattice is a quotient of the acyclic reorientation lattice of the transitive closure. Geometrically, the ornamentation lattice is shown to be the transitive closure of the graph of the path hypergraphic polytope oriented in a fixed linear direction, giving the first polytopal realizations and answering a question from [DS24]. Beyond unstarred trees, the paper proves that the ornamentation lattice of any increasing tree is the MacNeille completion of the acyclic sourcing poset, and it characterizes exactly which subhypergraphs of a path hypergraph have acyclic sourcing posets that are lattices.","feed_headline":"Polytopes realize ornamentation lattices for unstarred trees","feed_subtitle":"Rooted-tree ornamentation orders gain a geometric model, unifying reorientation and sourcing lattices.","key_machinery":"The machinery is a chain of order-preserving surjections between the acyclic reorientation poset of $\\operatorname{tc}(D)$, the acyclic sourcing poset of the path hypergraph $\\mathbb{P}(D)$, and the acyclic ornamentation poset $\\operatorname{AO}(D)$ for a directed graph $D$. For unstarred trees these maps become isomorphisms and lattice quotients. The key geometric device is the hypergraphic polytope $\\Delta_{\\mathbb{H}} = \\sum_{H \\in \\mathbb{H}} \\Delta_H$, a Minkowski sum of standard simplices; its graph, oriented in the direction $\\omega = (n-1, n-3, \\dots, 3-n, 1-n)$, is identified with the acyclic sourcing poset via the source characterization of [Gél25]. The lattice-theoretic engine is semidistributivity: join- and meet-irreducible ornamentations of a directed tree are exactly the path ornaments $J_P$ and $M_P$, and all of these are acyclic, which drives the MacNeille completion statement.","core_discovery":"The central result is Theorem 1.4. For an unstarred increasing tree $T$ (rooted trees with edges oriented toward the root are the main example), the acyclic reorientation poset $\\operatorname{AR}(\\operatorname{tc}(T))$, the acyclic sourcing poset $\\operatorname{AS}(\\mathbb{P}(T))$, and the acyclic ornamentation poset $\\operatorname{AO}(T)$ are all lattices; every ornamentation of $T$ is acyclic, so $\\operatorname{AS}(\\mathbb{P}(T)) \\simeq \\operatorname{AO}(T) = O(T)$; the map sending a reorientation to its induced ornamentation is a surjective lattice map, making $O(T)$ a lattice quotient of $\\operatorname{AR}(\\operatorname{tc}(T))$; and $O(T)$ is isomorphic to the transitive closure of the graph of the path hypergraphic polytope $\\Delta_{\\mathbb{P}(T)}$ oriented in direction $\\omega$. The polytopal part settles the open question of finding geometric realizations for ornamentation lattices of rooted trees. A second theorem characterizes, for an increasing tree $T$, which subhypergraphs $I$ of $\\mathbb{P}(T)$ have $\\operatorname{AS}(I)$ a lattice: exactly the path-intersection-closed and star-sparse ones.","pith_inferences":["I would test Conjecture 1.5 (a polytopal realization for every directed graph) on small starred trees, where cyclic ornamentations exist and the MacNeille completion is strictly larger than the acyclic poset; a counterexample there would delimit the conjecture.","The quasi-lattice map from the ornamentation lattice to the acyclic sourcing poset of Section 6 gives a general sufficient condition for acyclic sourcing posets to be lattices; the same template may apply to hypergraphs beyond path hypergraphs, such as those from graph associahedra.","The bijection between comb ornamentations and labeled Dyck paths suggests that ornamentation lattices of other rooted families might be indexed by variations of Dyck paths, hinting at an unlabeled statistic that could appear in other lattice quotients.","Because path-intersection-closedness and star-sparsity are decidable conditions, Theorem 1.6 yields an efficient recognition algorithm for intreeval hypergraphs with lattice acyclic sourcing posets, not just a structural characterization."],"forward_implications":["For rooted and unstarred increasing trees, ornamentation lattices now come with explicit polytopal models, so questions about their order, congruences, and enumeration can be attacked geometrically.","The ornamentation lattice being a quotient of the acyclic reorientation lattice of the transitive closure transfers the theory of lattice congruences and quotient lattices to ornamentations.","All ornamentations of an unstarred tree are acyclic; cyclic ornamentations exist only beyond this class, so the acyclic ornamentation poset equals the full ornamentation lattice exactly in the unstarred case.","For any increasing tree, the ornamentation lattice is the MacNeille completion of the acyclic sourcing poset, making the two objects equivalent at the level of lattice completions.","Subhypergraphs of a path hypergraph whose acyclic sourcing poset is a lattice are fully characterized by path-intersection-closedness and star-sparsity, extending the interval hypergraph classification."],"supporting_citations":[{"why":"introduced ornamentations of rooted trees and posed the problem of polytopal realizations that Theorem 1.4 answers.","marker":"[DS24]"},{"why":"supplies the source characterization relating acyclic sourcing posets to oriented graphs of hypergraphic polytopes, on which the polytopal realization rests.","marker":"[Gél25]"},{"why":"develops acyclic reorientation lattices, their lattice quotients, and the description of meets/joins used in the quotient argument.","marker":"[Pil24]"},{"why":"characterized interval hypergraphic lattices and introduced the quasi-lattice map technique extended in Theorem 1.6.","marker":"[BP24]"},{"why":"describes the face lattice of hypergraphic polytopes in terms of acyclic orientations, grounding the geometric interpretation of sourcings.","marker":"[BBM19]"},{"why":"gives the bracket-vector realization of the Tamari lattice, used to identify ornamentations of a path with binary trees.","marker":"[HT72]"}],"fun_headline_variants":["Ornamentation lattices realized by hypergraphic polytopes","Polytope model for unstarred tree ornamentation lattices","Unstarred trees: ornamentation lattices are polytopal","Answering open question: ornamentation lattices polytopal","Path hypergraphic polytope builds ornamentation lattice"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The geometric statement of Theorem 1.4(4) depends on a source characterization from [Gél25]—that the acyclic sourcing poset of any hypergraph is the transitive closure of the graph of its hypergraphic polytope oriented in direction $\\omega$—which is not proved in this paper, so the polytopal realization is established only conditional on that external result.","fun_headline_variants_meta":{"raw":{"variants":["Ornamentation lattices realized by hypergraphic polytopes","Polytope model for unstarred tree ornamentation lattices","Unstarred trees: ornamentation lattices are polytopal","Answering open question: ornamentation lattices polytopal","Path hypergraphic polytope builds ornamentation lattice"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000277,"raw_usage":{"total_tokens":1751,"prompt_tokens":1146,"completion_tokens":605,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":762,"completion_tokens_details":{"reasoning_tokens":517}},"tokens_in":762,"tokens_out":605,"duration_ms":7020,"temperature":1.0,"reasoning_tokens":517,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T05:29:54.608075+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate all ornamentations of the $(2,3)$-broom (a rooted tree) and compare the resulting Hasse diagram with the graph of $\\Delta_{\\mathbb{P}(T)}$ oriented in direction $\\omega$; any mismatch in order or in cardinality would falsify the claimed polytopal realization.","supporting_citations":[],"review_version":1}