{"id":"7c3006e9-d71e-4741-b55f-dbea92aa12af","arxiv_id":"2502.06013","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A graph is expelling, sending every billiard loop around the torus non-contractibly, exactly when it is bipartite; ensnaring graphs have a partial structural theory.","lead":"Mathematicians here study beams of light moving through a torus built from a graph, and ask which graphs force every beam to trace a loop that can be shrunk to a point versus a loop that wraps around the torus. The main theorem says a graph expels all beams into wrapping loops exactly when it is bipartite, and the paper gives many construction rules for graphs that trap all beams in shrinkable loops.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proof of Proposition 3.2 rests on a false monotonicity claim, so the central theorem (expelling iff bipartite) is not established as written.","rationale":"The reader's weakest assumption concerned the faithfulness of the discrete winding-vector model (Proposition 2.4). My review found a more direct and concrete problem inside the proof of the central classification: Proposition 3.2, which proves the 'bipartite ⇒ expelling' direction of Theorem 3.1, relies on an assertion about the direction of edge swaps that is demonstrably false for an explicit bipartite orbit. This is an internal inconsistency in the proof, not a disagreement with consensus. Since Theorem 3.1 is the paper's strongest claimed result and all later expelling/ensnaring results build on it, the proof gap is load-bearing. I do not claim the theorem is false: the explicit counterexample orbit has nonzero winding, and the theorem may well be correct. But the manuscript as written does not rigorously establish the theorem, so acceptance should be conditional on a corrected proof of Proposition 3.2 or an independent verification of the classification. The proposed computational check would settle whether the theorem itself fails; if it passes, the proof still needs repair.","tokens_in":20307,"tokens_out":27226,"duration_ms":252728,"concrete_test":"Implement ΘG and exhaustively enumerate all orbits for all bipartite graphs with n ≤ 6, computing the winding vector of each orbit. If any orbit has zero winding vector, Theorem 3.1 is false. If none does, the theorem survives, but Proposition 3.2 must still be rewritten because its stated monotonicity claim is contradicted by the explicit n=3 orbit above.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Proposition 3.2 claims that in a bipartite graph with bipartition X ⊔ Y, 'whenever the replicas x and y swap places, x must move clockwise while y moves counterclockwise,' and uses this to conclude that x and y have different winding numbers. The asserted direction is false. Consider the bipartite graph on {1,2,3} with edge {1,2}, X={1}, Y={2,3}. In the four-state orbit of ΘG with replica positions (0,1,2) → (2,1,0) → (1,2,0) → (1,0,2) → (0,1,2) on Cyclen (with the corresponding i,ϵ values described in the proof of Proposition 3.2), the two edge swaps between 1∈X and 2∈Y both have vertex 1 moving counterclockwise and vertex 2 moving clockwise, directly contradicting the claim. The winding vector of this orbit is nonzero, so it is not a counterexample to the theorem, but the proof's only stated mechanism for proving unequal winding numbers is invalid. A zero-winding orbit is not exhibited, so the theorem may be true, but the proof as written does not establish it.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces a topological perspective on the toric combinatorial refraction billiards of Adams, Defant, and Striker. For a graph G, trajectories are periodic loops in an (n−1)-torus, and the paper defines G to be ensnaring if all such loops are contractible and expelling if none is contractible. The central result is Theorem 3.1, which characterizes expelling graphs as exactly the bipartite graphs. The paper then studies ensnaring graphs: complete graphs and odd cycles are ensnaring, wedges of ensnaring graphs are ensnaring, disjoint unions are governed by a new notion of revolutionary graphs, certain wedges of complete graphs with trees are ensnaring, and several necessary and sufficient conditions are given in terms of complements. The final section collects conjectures and a generalization to graphs with both reflection and refraction edges.","tokens_in":20523,"tokens_out":44142,"duration_ms":397858,"significance":"The bipartite characterization in Theorem 3.1 is a crisp and attractive result: it reduces a topological property of all toric refraction billiard trajectories of a graph to a single standard graph invariant. Proposition 2.4, which reduces contractibility to vanishing of the winding vector in the stone-diagram model, is a useful bridge between the continuous and combinatorial settings. The paper also provides explicit orbit-level constructions for many ensnaring and non-ensnaring examples, and the later complement theorems give a substantial family of dense ensnaring graphs. The proofs are largely self-contained, and the main theorem is supported by a clear geometric mechanism. The stress-test concern about Proposition 3.2 does not land: the proposed counterexample is obtained by traversing the orbit in the reverse direction and therefore does not contradict the forward-time monotonicity claim used in the proof.","major_comments":[{"comment":"The proof's final implication, 'This immediately implies that x and y have different winding numbers,' is terse. It is mathematically correct, but it relies on the standard fact that the difference of the winding numbers of two replicas equals the net number of times one passes the other; I recommend stating this explicitly. I also checked the alleged counterexample in the stress test. For the graph with edge {1,2}, bipartition X={1}, Y={2,3}, and the starting state (0,1,2) with the stone pointing clockwise and coexisting with replica 1, the forward orbit under Θ_G is (0,1,2) → (1,0,2) → (1,2,0) → (2,1,0) → (0,1,2), not the reversed sequence (0,1,2) → (2,1,0) → (1,2,0) → (1,0,2) → (0,1,2). In the forward orbit, both swaps of replicas 1 and 2 move replica 1 clockwise and replica 2 counterclockwise. Thus the proposed counterexample does not invalidate the proof.","section":"§3, Proposition 3.2"}],"minor_comments":[{"comment":"The invariant that the stone points clockwise when the coin is on a vertex in X and counterclockwise when the coin is on a vertex in Y would be clearer if the authors noted that non-adjacent swaps preserve the coin vertex and the stone orientation, while adjacent swaps change both; this is the whole content of the claim 'This implies...'.","section":"§3, Proposition 3.2"},{"comment":"There is a typo in the proof: 'we may asssume n1 > 1' should read 'we may assume n1 > 1'.","section":"§5, Theorem 5.5"},{"comment":"The case analysis in the proof of Theorem 8.6 is quite dense, especially the m-odd case; a table or figure tracking the bridged-edge orientations and the positions of a1 and a2 would improve readability.","section":"§8, Theorem 8.6"},{"comment":"The footnote attached to 'metalenses' is numbered with a stray '1' in the displayed text; the formatting should be cleaned up.","section":"§2"},{"comment":"The proof of Theorem 6.3 is compressed, particularly the sentence 'similar to the proof of Proposition 6.1, we know D′ can be obtained from taking D, swapping va and vc, and then taking a rotation'; adding a short justification or an illustrative figure would help the reader verify this key symmetry step.","section":"§6, Theorem 6.3"}],"recommendation":"minor_revision","confidential_remarks":"The paper is a good fit for a combinatorics journal. The reliance on the authors' earlier article [1] for the underlying billiard model is appropriate and does not create a circularity, since the present classification theorem is proved from the model rather than assumed. The main theorem appears correct and the proof is repairable with a clarification of the crossing-number argument; the other results are plausible and supported by explicit orbit constructions."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The headline is that this paper gives a genuinely new classification: a graph is expelling if and only if it is bipartite. The ensnaring/expelling dichotomy is a real addition to the combinatorial billiards literature, and the stone-diagram model reduces a topological question about loop contractibility to a purely combinatorial winding vector condition. That reduction (Proposition 2.4) is clearly argued. The complement-component theorem and the wedge and disjoint-union constructions give the ensnaring family enough structure to be worth studying.\n\nI checked the stress-test note about Proposition 3.2. It doesn't hold up. The alleged counterexample lists a four-state orbit in reverse order. In the forward dynamics, both edge swaps between the X-vertex and the Y-vertex have the X-vertex moving clockwise, exactly as the proof claims. More generally, the proof's monotonicity claim is correct: when the coin is on an X-vertex, the stone points clockwise; when on a Y-vertex, it points counterclockwise; and in either case the X-replica moves clockwise during a swap with a Y-replica, while the Y-replica moves counterclockwise. So the proof mechanism is valid. The stress-test's own admission that the winding vector is nonzero shows it isn't a counterexample to the theorem.\n\nThe real soft spots are later. Theorem 5.5, Proposition 6.1, Theorem 6.3, and Theorem 8.6 all lean on phrases like \"straightforward,\" \"similar to the proof of Lemma 5.1,\" or \"the same argument.\" I don't see an actual error, but these are places where a referee should demand details. The paper is honest about this: Section 9.2 labels its generalizations as sketches and conjectures, and the open problems are clearly separated from proven results.\n\nThe citation pattern is fine. The paper depends on [1] for the billiard model and one tree lemma, but that's the natural predecessor, not a hidden assumption. Self-citation here is appropriate since the prior paper actually does the heavy lifting for the model.\n\nWho is this for? People working in dynamical algebraic combinatorics and anyone who likes clean graph invariants controlling a dynamical system. The main theorem is memorable and the proof of the main theorem is self-contained enough. I would send it to a serious referee. If I were the referee, my main request would be to expand the compressed proofs in Sections 5, 6, and 8.","headline":"Clean new classification — expelling iff bipartite — with a correct proof; later sections are sketchier but the core is solid.","tokens_in":21031,"tokens_out":19247,"would_cite":true,"duration_ms":162994,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C75","20F55","52C35"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves a torus billiard system built from a graph expels every trajectory exactly when the graph is bipartite, and gives a partial classification of the opposite, ensnaring case.","keywords":["combinatorial billiards","toric hyperplane arrangements","affine symmetric group","ensnaring graphs","expelling graphs","bipartite graphs","winding vectors","stone diagrams"],"falsifier":"Run the orbit of $\\Theta_G$ for the triangle graph $K_3$ starting from the identity stone diagram $(\\mathrm{id},1,1)$; the paper predicts the orbit has zero winding vector. Alternatively, run any orbit for an even cycle such as $C_4$, which the paper predicts always has nonzero winding vector; a single counterexample to either prediction would disprove the expelling-bipartite dichotomy.","tokens_in":20092,"feed_emoji":"🔦","tokens_out":11397,"duration_ms":106264,"temperature":0.7,"pith_summary":"This paper studies a billiard system on a torus encoded by a graph $G$: beams of light travel through an $(n-1)$-dimensional torus and bend whenever they cross hyperplanes whose adjacency pattern is $G$. Every trajectory is periodic, so it can be viewed as a closed loop, and the paper asks whether such loops are contractible. A graph is called ensnaring if all trajectories are contractible and expelling if none are; the first main result is that $G$ is expelling if and only if $G$ is bipartite. Ensnaring graphs turn out to be harder to classify, and the paper supplies a collection of necessary and sufficient conditions along with operations that build new ensnaring graphs from old ones.","feed_headline":"Expelling billiard graphs are exactly the bipartite ones","feed_subtitle":"For graph-built torus billiards, the expelling case is all-or-nothing, and bipartiteness is the dividing line.","key_machinery":"The load-bearing object is the stone diagram, a finite combinatorial picture of an orbit: each vertex of $G$ has a labeled replica on a cycle of length $n$, and a stone with a clockwise or counterclockwise orientation marks the active position. The map $\\Theta_G$ swaps the two replicas next to the stone and either moves the stone (if the corresponding vertices are non-adjacent) or reverses its direction (if they are adjacent). For an orbit $\\mathcal{O}$, the winding vector $\\vec w_{\\mathcal O}\\in\\mathbb{Z}^n$ records the net clockwise displacement of each replica after one full period, and Proposition 2.4 reduces the topological question to algebra: a trajectory is contractible exactly when this vector is the zero vector, because zero winding is equivalent to boundedness of every lift to the affine symmetric group. Ensnaring and expelling thus become properties of the winding vectors of a finite dynamical system.","core_discovery":"The central claim is a dichotomy: a graph $G$ is expelling, meaning no billiard trajectory in the toric system is contractible, if and only if $G$ is bipartite (Theorem 3.1). In the bipartite direction, the stone-diagram model shows that two replicas belonging to opposite parts of the bipartition always wind in opposite directions, so the winding vector cannot be zero. In the converse direction, an induced odd cycle is used to build a periodic orbit whose replicas never cross a particular edge of the surrounding cycle, forcing the winding vector to vanish and the trajectory to contract. The paper then studies ensnaring graphs, where all trajectories are contractible: complete graphs $K_n$ for $n\\ge 3$ are ensnaring, a cycle $C_n$ is ensnaring exactly for odd $n$, wedging two ensnaring graphs at a vertex preserves ensnaring, and a disjoint union is ensnaring exactly when both factors are ensnaring and neither is revolutionary, meaning no orbit's stone has nonzero winding. It also proves a complement reduction: a graph with $n$ vertices is ensnaring exactly when, for every connected component $C$ of its complement, the $n$-vertex complement of $C$ is ensnaring.","pith_inferences":["The bipartite dichotomy suggests a broader principle: for the mirror-and-refraction generalization sketched in Section 9, expelling may correspond to contracting all reflection edges and then asking whether the quotient is bipartite; testing this on materialized cycles would be a direct next step.","The local obstruction in Theorem 7.1 indicates that non-ensnaring can be caused by small induced configurations, so it is reasonable to ask whether ensnaring admits a forbidden-induced-configuration characterization rather than only a global one.","The parity condition in the classification of complements of complete bipartite graphs points toward a general rule in which the ensnaring status of an $n$-vertex complement depends only on the parity of $n$, as Conjecture 8.3 proposes.","The winding-vector criterion is effectively a discrete homology invariant for periodic trajectories, so the paper's result offers a purely finite way to certify contractibility or non-contractibility in a continuous torus billiard system."],"forward_implications":["Every bipartite graph is expelling, and every expelling graph is bipartite, so the topological behavior of all trajectories in the expelling case is decided by a single classical graph invariant.","Complete graphs with at least three vertices are ensnaring: the stone never leaves its initial position, so no replica crosses the cycle edge opposite the stone, forcing zero winding.","A cycle graph $C_n$ is ensnaring exactly when $n$ is odd; even cycles are expelling by bipartiteness, while odd cycles force all replicas to share the same winding number, which must be zero.","Wedging two ensnaring graphs at a vertex preserves ensnaring, whereas a disjoint union is ensnaring exactly when both factors are ensnaring and neither is revolutionary.","The complement reduction says ensnaring can be checked componentwise on the complement, and it implies, for instance, that a graph whose complement has a clique of size at least two as a connected component is not ensnaring."],"supporting_citations":[{"why":"Defines the toric combinatorial refraction billiard system, the map $\\Theta_G$, the periodicity of trajectories, and the stone-diagram discretization that all subsequent proofs use.","marker":"[1]"},{"why":"Supplies the refraction-coefficient $-1$ convention for tiling billiards, which is the physical rule that makes a metalens reverse the direction a reflection would take.","marker":"[2]"},{"why":"Introduces toric promotion, the finite cyclic dynamical system of which $\\Theta_G$ is a special case and whose orbit structure underlies the winding-vector model.","marker":"[11]"}],"fun_headline_variants":["Expelling iff bipartite in toric billiards","Billiard graphs expel precisely when bipartite","No contractible billiard loops exactly for bipartite graphs","In toric billiards expelling means bipartite","Expelling billiards are a bipartite affair"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The classification rests on identifying contractibility of a continuous toric trajectory with vanishing of the discrete winding vector; if a continuous loop could fail to contract while its discretization had zero winding, or vice versa, the theorems would no longer follow.","fun_headline_variants_meta":{"raw":{"variants":["Expelling iff bipartite in toric billiards","Billiard graphs expel precisely when bipartite","No contractible billiard loops exactly for bipartite graphs","In toric billiards expelling means bipartite","Expelling billiards are a bipartite affair"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001814,"raw_usage":{"total_tokens":7193,"prompt_tokens":1051,"completion_tokens":6142,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":667,"completion_tokens_details":{"reasoning_tokens":6063}},"tokens_in":667,"tokens_out":6142,"duration_ms":44843,"temperature":1.0,"reasoning_tokens":6063,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-08T17:02:00.222723+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the orbit of $\\Theta_G$ for the triangle graph $K_3$ starting from the identity stone diagram $(\\mathrm{id},1,1)$; the paper predicts the orbit has zero winding vector. Alternatively, run any orbit for an even cycle such as $C_4$, which the paper predicts always has nonzero winding vector; a single counterexample to either prediction would disprove the expelling-bipartite dichotomy.","supporting_citations":[{"cited_title":"Adams, C","cited_arxiv_id":null,"evidence_quote":"Defines the toric combinatorial refraction billiard system, the map $\\Theta_G$, the periodicity of trajectories, and the stone-diagram discretization that all subsequent proofs use."},{"cited_title":"Baird-Smith, D","cited_arxiv_id":null,"evidence_quote":"Supplies the refraction-coefficient $-1$ convention for tiling billiards, which is the physical rule that makes a metalens reverse the direction a reflection would take."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces toric promotion, the finite cyclic dynamical system of which $\\Theta_G$ is a special case and whose orbit structure underlies the winding-vector model."}],"review_version":1}