{"id":"2a9e1f9d-f6ff-41a9-92c3-33898a89cccd","arxiv_id":"2607.03785","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.5,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Signed order-crossing counts equal λ(u)^T Ω λ(v) for a skew matrix Ω of the orders, so discrete IET trajectories are Ω-orthogonal and admit at most floor((k+d)/2) distinct ones.","lead":"The paper proves that the signed count of order crossings between conjugates of two words equals a bilinear form on their letter-count vectors given by a skew-symmetric matrix built from the two alphabet orders. This forces trajectory vectors of discrete interval exchanges to be orthogonal, yielding an exact orbit-count formula in dimension 3 and sharp upper bounds on the number of trajectories for general k.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The central claim is the identity of Theorem 1/2. Its proof is purely combinatorial, rests only on the definitions of the indicator sequences a_{i,j}, d_{i,j} and the resulting δ_{i,j}, and is carried through by a careful case analysis (Lemma 3) that accounts for shared prefixes/suffixes. The reader correctly isolates this bookkeeping as the sole non-routine step; after re-reading the argument I find no place where the counting over- or under-counts. All later results (pairwise orthogonality of trajectory Parikh vectors, the arithmetic formula for the number of orbits of a discrete 3-IET, and the dimensional upper bound floor((k+d)/2)) are immediate linear-algebraic consequences of that identity together with classical facts about Rauzy classes and the rank of Ω. No external data, circular definitions, or unverifiable geometric appeals appear. Consequently the reader's ACCEPT verdict with low correctness risk stands; no adjustment is warranted.","tokens_in":19427,"tokens_out":534,"duration_ms":4281,"concrete_test":"Independently recompute |T2(u,v)|-|T1(u,v)| for the mixed-order pair of Example 1 (u=121313, v=1222) and for two short Sturmian words of known Parikh vectors by exhaustive enumeration of all conjugate pairs; verify that both values equal the corresponding bilinear form λ(u)^T Ω λ(v). Agreement confirms the diagonal-sum bookkeeping.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The reader's weakest_assumption correctly flags the most delicate step: the canonical representatives of Type-1/Type-2 classes and the diagonal-sum argument of Theorem 2 (via Lemma 3). That step is intricate, but the manuscript supplies an explicit, self-contained combinatorial proof that partitions ∑ δ_{i,j} along slope--1 lines and matches each nonzero contribution to a unique equivalence class of crossings. No internal inconsistency, hidden hypothesis, or counting gap is visible; the subsequent linear-algebraic corollaries (orthogonality, the 3-exchange gcd formula, and the floor((k+d)/2) bound) follow by standard arguments once the identity is granted. The concern therefore does not land as a correctness risk.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper studies order symmetry for periodic trajectories of discrete k-interval exchange transformations with a pair of orders π = (<D, <A). It introduces Type-1 and Type-2 order crossings among conjugates of two words u, v, packages them into equivalence classes T1(u,v) and T2(u,v), and defines the index i(u,v) = |T1| + |T2|. The central result (Theorem 1 / Theorem 2) is the identity |T2(u,v)| - |T1(u,v)| = λ(u)^T Ω λ(v), where Ω is the skew-symmetric matrix built from π. Consequently the Parikh vectors of trajectories of any discrete k-IET with permutation π are pairwise orthogonal with respect to Ω. For k = 3 this yields that the number of orbits equals gcd(Ω λ) (hence a minimality criterion recovering Pak–Redlich in the symmetric case). For general k the same orthogonality implies the bound ⌊(k + d)/2⌋ on the number of distinct trajectories (d = dim ker Ω), sharpening to ⌊(k + 1)/2⌋ when π is symmetric; the bound is shown to be optimal for perfectly clustering families and is invariant under Rauzy moves.","tokens_in":19639,"tokens_out":1029,"duration_ms":7659,"significance":"The signed-crossing identity is a clean, purely combinatorial statement that unifies several previously separate phenomena: clustering of Burrows–Wheeler arrays, the order condition for IET languages, and the arithmetic of discrete 3-exchanges. Once the identity is granted, the linear-algebraic consequences (orthogonality, the gcd formula, the dimension bound) follow by standard arguments and recover known geometric bounds on cylinders of square-tiled surfaces without invoking zippered rectangles. The proof of the identity itself is self-contained and does not rely on earlier black-box lemmas beyond the basic definitions of clustering. The results therefore supply both a new computational tool (the index is easy to evaluate from Parikh vectors when there is no mixed order type) and a transparent explanation of the observed sparsity of multi-orbit discrete IETs.","major_comments":[],"minor_comments":[{"comment":"In the abstract and again on p. 1 the phrase “discrete interval exchange transformations T with permutation π” is used; later the same object is called a “pair of orders π”. A single consistent terminology (or an explicit remark that the two notions coincide) would help the reader.","section":null},{"comment":"Lemma 3 is the technical heart of the diagonal-sum argument. While the case analysis is complete, a short schematic diagram illustrating a typical block +10^n-1 (or -10^n+1) and the corresponding pair of crossing classes would make the bookkeeping easier to follow.","section":null},{"comment":"Corollary 6 asserts optimality of the bound ⌊(k+1)/2⌋ by exhibiting the family (1^k, 2(k-1), …). It would be useful to record explicitly that these words are pairwise non-conjugate and that the whole family is perfectly clustering, so that the reader can verify the claim without further computation.","section":null},{"comment":"A few typographical slips: “de action” (p. 9), missing space before “where” in the abstract, and the repeated phrase “with pair of orders π” that occasionally becomes “with pair of ordersπ”.","section":null},{"comment":"The digression on Rauzy classes (pp. 9–10) is correct but slightly abrupt; a one-sentence reminder that the rank of Ω is a Rauzy-class invariant would clarify why the dimension bounds apply throughout the class.","section":null}],"recommendation":"accept","confidential_remarks":"The manuscript is ready for publication essentially as is. The only non-trivial technical step is the diagonal bookkeeping of Lemma 3; I checked it carefully and found no gap. The geometric comparison with Smillie’s cylinder bound is appropriately placed in a remark and does not claim priority. Fit for a combinatorics / symbolic-dynamics journal is excellent."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The new core is Theorem 1/2: the signed difference of Type-2 and Type-1 order-crossing classes between any two words equals λ(u)^T Ω λ(v), where Ω is the skew-symmetric matrix built from the pair of orders. Once you have that, the Parikh vectors of the trajectories of a discrete IET are pairwise orthogonal with respect to Ω, the number of orbits of a 3-exchange is exactly gcd(Ωλ), and you get the bound floor((k+d)/2) on the number of distinct trajectories (floor((k+1)/2) when the orders are symmetric). That is real progress inside the combinatorics-of-words / discrete-IET niche.\n\nWhat they do well is keep the argument self-contained and combinatorial. The proof of the identity is an explicit double count: they define local indicators δ_{i,j}, sum them along the slope-1 diagonals, and match each nonzero block to a unique equivalence class of crossings (Lemma 3). The linear-algebra consequences (rank of Ω, Rauzy-class invariance, the gcd formula, the dimension bound) then drop out by standard arguments. The 3-dimensional case recovers the Pak–Redlich criterion as a special case, which is a nice sanity check. The alternate reading in terms of perfectly clustering families is clean and useful.\n\nThe delicate step is exactly the one the reader flagged: the choice of canonical representatives for the crossing classes and the diagonal-sum bookkeeping when the words share long common prefixes or suffixes. It is intricate, but the manuscript writes it out carefully and I do not see a counting gap or hidden hypothesis. Everything else is routine once the identity is granted. No circularity, no free parameters, no data fitting.\n\nThis is for people who already care about clustering, Burrows–Wheeler arrays, or discrete interval exchanges. It will not reorient the broader field, but it supplies a clean arithmetic tool that was missing. The math is solid, the citations are appropriate (their own earlier clustering papers supply definitions, not black-box lemmas), and the result is new. I would send it to a serious referee without hesitation.","headline":"Clean combinatorial identity that turns order crossings into a bilinear form, giving an exact orbit count for 3-exchanges and a uniform trajectory bound.","tokens_in":20215,"tokens_out":540,"would_cite":true,"duration_ms":4819,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["68R15","37B10"],"pacs":[],"model":"grok-4.5","headline":"Order crossings between two words reduce to a single bilinear form on their letter-count vectors; trajectories of a discrete interval exchange are therefore pairwise orthogonal, bounding how many can exist.","keywords":["discrete interval exchange","order symmetry","order crossings","Parikh vectors","skew-symmetric matrix","perfectly clustering words","Burrows-Wheeler transform","Rauzy class"],"falsifier":"Compute T₁ and T₂ explicitly for a pair of short words that share a long common factor (for example the Simon words of Example 1 or two Sturmian words of length 20) and check whether |T₂| − |T₁| equals the bilinear form; a single mismatch falsifies the main identity.","tokens_in":20357,"feed_emoji":"🔀","tokens_out":1071,"duration_ms":7368,"temperature":0.7,"pith_summary":"The paper studies discrete interval exchange maps through the combinatorics of their periodic trajectories. Two trajectories always satisfy a symmetry: the order in which they appear when read left-to-right is exactly the reverse of the order when read right-to-left. For arbitrary words that symmetry can fail; each failure is an \"order crossing\" of one of two types. The authors prove that the signed difference between the two types of crossings equals a simple bilinear expression built only from the letter-count (Parikh) vectors of the two words and a fixed skew-symmetric matrix that records the pair of orders. Consequently every pair of trajectories of a discrete interval exchange is orthogonal with respect to that matrix. Orthogonality immediately yields an arithmetic formula for the exact number of orbits of any three-interval exchange (hence a minimality criterion) and an upper bound of roughly half the alphabet size on the number of distinct trajectories for any alphabet size. The same bound limits how many perfectly clustering words can share a single common Burrows–Wheeler array.","feed_headline":"Word crossings equal a bilinear form; trajectories are orthogonal","feed_subtitle":"The identity bounds how many distinct orbits a discrete interval exchange can have","key_machinery":"The index i(u,v) together with the identity |T₂| − |T₁| = λ(u)ᵀ Ω λ(v). The proof reduces the difference of crossing counts to a diagonal sum of local indicators δ_{i,j} ∈ {−1,0,+1} and shows, by a case analysis along lines of slope −1, that this sum equals the bilinear form.","core_discovery":"For any two words u and v over a k-letter alphabet equipped with a pair of orders π, the signed difference |T₂(u,v)| − |T₁(u,v)| between the two families of order-crossing classes equals the bilinear form λ(u)ᵀ Ω λ(v), where Ω is the skew-symmetric matrix determined solely by π. In particular the Parikh vectors of all trajectories of a discrete k-interval exchange with permutation π are pairwise orthogonal with respect to Ω.","pith_inferences":["The same bilinear form appears in the continuous theory as the intersection form on the first cohomology of the translation surface; the combinatorial identity therefore supplies a purely word-theoretic proof of the classical bound on the number of cylinders.","When the two words have mixed order type the absolute value of the bilinear form is strictly smaller than the total index, so the formula gives only a lower bound; mixed type may therefore be detectable by comparing the two quantities.","The optimality example (the family of words i(k−i+1)) suggests that the bound floor((k+1)/2) is achieved by a very simple set of words; one could ask whether every maximal perfectly clustering family is conjugate to a sub-family of that example."],"forward_implications":["The number of orbits of any discrete 3-interval exchange equals gcd(Ωλ), so the map is minimal precisely when that gcd is 1.","Any discrete k-interval exchange has at most floor((k+d)/2) distinct trajectories, where d = dim ker Ω; for a symmetric exchange the bound simplifies to floor((k+1)/2).","On a k-letter ordered alphabet at most floor((k+1)/2) primitive pairwise non-conjugate perfectly clustering words can share a single common lexicographic array.","The same numerical bounds hold throughout the entire Rauzy class of the given pair of orders, because rank(Ω) is a Rauzy-class invariant."],"fun_headline_variants":["Order crossings equal λᵀΩλ; trajectories are Ω-orthogonal","Signed crossings equal the bilinear form of Parikh vectors","Interval-exchange trajectories pairwise orthogonal under Ω","Parikh vectors of discrete IET orbits form Ω-orthogonal set","Ω-bilinear form counts signed order crossings of word pairs"],"cache_read_input_tokens":16512,"weakest_assumption_plain":"The chosen canonical representatives of crossing classes (pairs ending in distinct letters for Type 1, beginning in distinct letters for Type 2) correctly count every geometric crossing without over- or under-counting when the words share long common prefixes or suffixes.","fun_headline_variants_meta":{"raw":{"variants":["Order crossings equal λᵀΩλ; trajectories are Ω-orthogonal","Signed crossings equal the bilinear form of Parikh vectors","Interval-exchange trajectories pairwise orthogonal under Ω","Parikh vectors of discrete IET orbits form Ω-orthogonal set","Ω-bilinear form counts signed order crossings of word pairs"]},"model":"grok-4.5","effort":"low","cost_usd":0.005252,"raw_usage":{"total_tokens":1654,"prompt_tokens":1072,"num_sources_used":0,"completion_tokens":64,"cost_in_usd_ticks":52520000,"prompt_tokens_details":{"text_tokens":1072,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":518,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":1072,"tokens_out":64,"duration_ms":4135,"temperature":1.0,"reasoning_tokens":518,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-11T23:57:32.429971+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Compute T₁ and T₂ explicitly for a pair of short words that share a long common factor (for example the Simon words of Example 1 or two Sturmian words of length 20) and check whether |T₂| − |T₁| equals the bilinear form; a single mismatch falsifies the main identity.","supporting_citations":[],"review_version":1}