{"id":"4478601d-4613-4faf-8cee-c87a86441288","arxiv_id":"2606.30482","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A nonnegative tensor is s-primitive exactly when it is s-irreducible, has nonempty accessibility exponent sets, and all vertices are aperiodic.","lead":"Nonnegative tensors—higher-dimensional arrays used in Markov chain theory—get two new properties, s-irreducibility and s-primitivity, defined through a generalized box product and its powers. The paper proves exactly when the second property holds and shows the new definitions reduce to the classical matrix case when the tensor is a matrix.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified — Theorem 2.5 is proved correctly within the paper's explicit definitions.","rationale":"The reader's weakest assumption is that the non-associativity of the box product makes the right-recursive power a modeling choice rather than a canonical operation. I find this is not a load-bearing concern for Theorem 2.5: the power is defined unambiguously by recursion, and the proof of Theorem 2.5 does not require associativity. The reader's conditional verdict is based on the delegated proofs of Theorems 2.1 and 2.4, but those theorems are not used in the proof of the central claim and their extensions are straightforward. The central theorem's proof is self-contained and correct. Therefore I do not identify a significant mathematical objection to the central claim; the paper's conditional verdict can remain unchanged, but the specific concern about non-associativity is not the reason.","tokens_in":12512,"tokens_out":35798,"duration_ms":239961,"concrete_test":"Independently re-derive Lemma 2.2 from Theorem 2.3 for a general m, carefully verifying the multi-index alignment in the definition of Q_A; then brute-force test Theorem 2.5 on the finite set of all third-order 2x2x2 tensors with entries in {0,1} by computing A^α for α up to, say, 20, and checking the three conditions against s-primitivity.","verdict_should_be":"UNCHANGED","load_bearing_attack":"I examined Theorem 2.5's proof line by line. The necessity is immediate; the sufficiency argument uses Lemma 2.2 (proved via Theorem 2.3, which is fully proved) and the standard numerical semigroup Lemma 2.3. The finite-subset gcd argument is valid because the gcd sequence over an enumeration of a subset of positive integers stabilizes to the gcd of the whole set. The non-associativity of the box product is not a hidden assumption: the right-recursive power is explicitly defined, and the proof never uses associativity. The only genuine gaps are the deferred proofs of Theorems 2.1 and 2.4 (marked 'easily extended'), but neither is used in Theorem 2.5's proof, so they do not threaten the central claim. For completeness: Theorem 2.1 follows by a cut argument (if A^α had a crossing entry, then A would, by induction on α), and Theorem 2.4 follows directly from Theorem 2.3 (A^(β) = A^(0) Q_A^β, which is positive if Q_A^β is positive). Thus I find no load-bearing mathematical error in the paper's main characterization.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an alternative framework for irreducibility and primitivity of nonnegative tensors, based on the previously introduced 'box' product and its recursively defined right power. It defines s-irreducibility and s-primitivity (Definitions 2.5 and 2.6), explores their relationship with the classical tensor notions (Theorems 2.1, 2.2, 2.4, and examples), and proves a main characterization theorem (Theorem 2.5): a nonnegative tensor is s-primitive iff it is s-irreducible, its uniform accessibility sets S_A(i,j) are nonempty whenever i→j, and all indices are aperiodic. This reduces to the classical matrix characterization when m=2. The paper concludes with auxiliary results (Theorems 2.6 and 2.7) and a discussion of applications to higher-order Markov chains.","tokens_in":12910,"tokens_out":18357,"duration_ms":151900,"significance":"The main result, Theorem 2.5, is a clean and potentially useful generalization of the classical Frobenius characterization for nonnegative matrices. The proof is self-contained and, on inspection, correct: Lemma 2.2 is proved through Theorem 2.3, the finite-subset gcd argument is valid, and the numerical semigroup lemma is applied appropriately. The paper gives explicit examples that distinguish the new notions from existing tensor primitivity and shows the reduction to the matrix case. The framework is a modeling choice because the box product is non-associative, but this is explicitly acknowledged and the right-recursive power is well-motivated by the higher-order Markov chain interpretation. The contribution is modest but solid; it broadens previous third-order stochastic-tensor results to arbitrary order and to general nonnegative tensors.","major_comments":[],"minor_comments":[{"comment":"The proofs of Theorems 2.1 and 2.4 are deferred to the author's own papers with the remark that the arguments are easily extended. Since Theorem 2.3 is proved, Theorem 2.4 follows immediately by A^{(α)} = A^{(0)} Q_A^α; and Theorem 2.1 follows by a simple induction on α. Please include these short proofs to make the paper self-contained.","section":"§2, Theorems 2.1 and 2.4"},{"comment":"The description of the mode-1 matricization is ambiguous: it says 'linear indexing order of i_3,...,i_m', but the multi-index column is i_2 i_3 ... i_m. Please clarify the exact ordering of columns.","section":"Definition 2.8"},{"comment":"There is a typo in the line 'for any i1i1 . . . , im−1' — presumably this should be 'i1i2 . . . im−1'. Please correct.","section":"Definition 2.7"},{"comment":"The necessity of conditions (ii) and (iii) is stated as 'straightforward'. For (ii), it would be helpful to note explicitly that s-primitivity gives A^α > 0 for all sufficiently large α, so that a single exponent belongs to S_A(i,j). A one-line justification would improve clarity.","section":"Theorem 2.5, necessity part"},{"comment":"The proof of the inequality (I+A)^β ≥ Σ_{α=0}^β A^α is only sketched for β=2,3 and then asserted for general β. Please provide a formal induction, using the monotonicity of the box product and the fact that A^α ⊠ I ≥ 0.","section":"Theorem 2.6, proof"},{"comment":"The wording 'both s-primitivity and primitivity' should be 'both s-primitive and primitive'. Similar grammatical issues appear in a few places.","section":"Theorem 2.2"},{"comment":"The claim 'A^α = A for all α≥2' is asserted without verification. A short explanation would be useful, since the box product is not associative.","section":"Example 2.2"}],"recommendation":"minor_revision","confidential_remarks":"The paper is sound, and the main characterization is correct. The novelty relative to the author's own prior work (especially [10], which already defines the box product and proves Theorem 2.3 for stochastic tensors) should be made clearer. The contribution is incremental but within the scope of a specialized linear algebra journal. The deferred proofs in Theorems 2.1 and 2.4 should be included or explicitly stated as immediate consequences to avoid an impression of over-reliance on self-citations."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The main thing to know: this is a legitimate, self-contained extension of the classical matrix primitivity theorem to m-th order nonnegative tensors via a specific non-associative \"box\" product and a right-recursive power. The central result, Theorem 2.5, states that s-primitivity is equivalent to s-irreducibility plus nonempty exponent sets on all accessible pairs plus aperiodicity of every vertex. The proof is written out in detail and I checked the steps: the necessity is immediate, and the sufficiency uses Lemma 2.2 and Lemma 2.3 with a finite-subset gcd argument that holds because the gcd sequence over an enumeration of a subset stabilizes to the gcd of the whole set. The non-associativity of the box product is explicitly acknowledged and not a hidden assumption; the power is defined recursively on the right, and the proof never uses associativity. In the matrix case m=2 condition (ii) becomes vacuous and the theorem reduces to the classical result. That is a real contribution.\n\nWhat the paper does well: it gives a uniform algebraic treatment that includes the earlier stochastic-third-order results and the m=2 case, and it provides several examples showing how s-primitivity and the existing primitivity notion differ. The mode-1 matricization and reduced matrix setup is helpful, and Theorem 2.3 is proved cleanly with matrix multiplication.\n\nSoft spots, in proportion: two supporting results, Theorem 2.1 and Theorem 2.4, are stated with proofs \"easily extended\" from the author's own stochastic-tensor papers. The stress-test note already shows Theorem 2.4 follows directly from Theorem 2.3, and Theorem 2.1 follows from a cut argument — so these are genuine but minor gaps. A referee would want the details supplied, not a rewrite. The framework does depend on the right-recursive power convention; a different bracketing of the box product would change the definitions and the exponent sets. That is not a flaw in the math, only a reminder that the notions are convention-dependent. The citation pattern is heavily self-referential, but the cited results are either verified in the text or easy to expand, so I don't see that as a problem.\n\nWho this is for: anyone working on nonnegative tensor theory, higher-order Markov chains, or generalizations of matrix primitivity. It deserves a serious referee; I would have no trouble sending it out. The central theorem is proved correctly and the presentation is concise.\n\nRecommendation: send to peer review.","headline":"Solid and self-contained extension of the matrix primitivity theorem to nonnegative tensors; Theorem 2.5 is proved correctly, with only minor deferred proofs from the author's own earlier papers.","tokens_in":13281,"tokens_out":4149,"would_cite":true,"duration_ms":37641,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["15A69","15A72","15B48","46B28"],"pacs":[],"model":"deepseek-v4-flash","headline":"A nonnegative tensor is s-primitive exactly when it is s-irreducible, uniformly accessible on arrows, and aperiodic at every index—a graph-theoretic test for a new kind of tensor primitivity.","keywords":["nonnegative tensors","tensor box product","s-irreducibility","s-primitivity","aperiodicity","accessibility","higher-order Markov chains","primitivity characterization"],"falsifier":"Take the finite collection of all 3rd-order 3-dimensional tensors with entries in {0,1}; for each tensor, compute the right-recursive powers A^α until the zero-nonzero pattern repeats (which must happen, since there are finitely many patterns), and compare the predicate 'some A^α has all entries positive' with the conjunction of conditions (i)-(iii) from Theorem 2.5. One tensor where the two answers disagree would refute the characterization; an exhaustive match would corroborate it.","tokens_in":12427,"feed_emoji":"🧮","tokens_out":10045,"duration_ms":87745,"temperature":0.7,"pith_summary":"This paper tries to establish a graph-theoretic characterization of a new kind of primitivity for nonnegative tensors, called s-primitivity, defined through a tensor power built from the non-associative box product. The central theorem states that a tensor is s-primitive if and only if it is s-irreducible, every accessible pair has a nonempty uniform accessibility set S_A(i,j), and every index has period 1. For ordinary matrices (order 2), the characterization reduces to the classical result that a nonnegative matrix is primitive iff it is irreducible and aperiodic. This matters because the new notions translate directly into ergodicity and regularity for higher-order Markov chains, where the classical matrix theory does not apply.","feed_headline":"Three graph conditions pin down tensor primitivity","feed_subtitle":"Reduces to the classic matrix test at order two and gives ergodicity checks for higher-order Markov chains.","key_machinery":"The load-bearing object is the box product A⊠B and its recursively defined right power A^α = A^(α−1) ⊠ A, with identity tensor I that is only a left identity. Because the box product is not associative for m ≥ 3, this right-recursive power is a convention, not a canonical operation. The reduced matrix Q_A—an n^{m−1}×n^{m−1} matrix built from the tensor's entries—is what makes the framework tractable: Theorem 2.3 shows A^(α+β) = A^(α) Q_A^β, so tensor power entries are governed by ordinary matrix powers of Q_A. The sets S_A(i,j) of uniform return/access exponents, together with the gcd period d = gcd(S_A(i)), supply the combinatorial control for the characterization.","core_discovery":"On the paper's own terms, the discovery is Theorem 2.5: for an mth order, n-dimensional nonnegative tensor A, s-primitivity—meaning some power A^α built by repeated right box products has all entries positive—is equivalent to three graph-theoretic conditions: (i) A is s-irreducible, i.e., every entry position of some power is positive with an exponent that may depend on the position; (ii) for every arrow i→j in the accessibility digraph, the set S_A(i,j) of exponents that simultaneously work for all intermediate indices is nonempty; and (iii) every index i has gcd(S_A(i)) = 1. The proof works by showing through the reduced matrix Q_A that tensor power entries follow matrix-power dynamics, th","pith_inferences":["Because Theorem 2.3 reduces tensor powers to powers of Q_A, questions like the minimal α with A^α > 0—or a bound analogous to the classical primitive-matrix exponent bound—can likely be answered through the spectral and graph theory of Q_A, which is an ordinary n^{m−1}×n^{m−1} matrix.","The right-recursive power convention is one of several possible bracketings of the non-associative box product; defining A^α by left multiplication or another bracketing would produce different s-notions, and comparing them could reveal which convention truly matches the transition structure of higher-order Markov chains.","Condition (ii) can be read as uniform accessibility: whenever j is reachable from i, there is one step count that works no matter which intermediate indices appear. One could test on real or simulated transition tensors whether ergodic chains that violate this uniformity are exactly the ones whose higher-order Markov chains show slow mixing or no regular limit.","A finite exhaustive check is feasible: for all 0-1 tensors of order 3 and dimension 3 (2^27 ≈ 1.3×10^8 cases), compare s-primitivity with conditions (i)-(iii); any mismatch would refute Theorem 2.5."],"forward_implications":["For m=2, Theorem 2.5 restores the classical theorem: a nonnegative matrix is primitive iff it is irreducible and every index is aperiodic.","S-primitivity and the existing tensor primitivity are logically independent in general: the paper gives examples of a primitive but not s-irreducible tensor, an s-primitive but not primitive tensor, and an s-irreducible and primitive but not s-primitive tensor.","S-irreducibility implies the standard tensor irreducibility, but not conversely; so the new framework is strictly finer at the irreducible level.","If A is s-irreducible, then c1I + c2A is s-primitive for any c1,c2>0; in particular, positive diagonal entries make an s-irreducible tensor s-primitive.","In higher-order Markov chains, s-primitivity is regularity, so Theorem 2.5 provides a checkable necessary-and-sufficient route to the existence of a limiting distribution, and Theorem 2.7 gives the simple sufficient condition that an ergodic chain with positive diagonal transition entries is regular."],"fun_headline_variants":["Graph conditions settle tensor primitivity","Tensor primitivity: graph checks replace matrix legacy","s-primitivity decoded: graph criteria for tensor powers","From matrices to tensors: a unified primitivity test","Ergodic tensors: graph conditions ensure positive powers"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The framework stands or falls on the convention that A^alpha means repeated multiplication on the right, A^alpha = A^(alpha-1) ⊠ A; the paper itself notes after Definition 2.1 that the box product is not associative, so this bracketing is a choice, and changing it would change which tensors count as s-irreducible or s-primitive.","fun_headline_variants_meta":{"raw":{"variants":["Graph conditions settle tensor primitivity","Tensor primitivity: graph checks replace matrix legacy","s-primitivity decoded: graph criteria for tensor powers","From matrices to tensors: a unified primitivity test","Ergodic tensors: graph conditions ensure positive powers"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001149,"raw_usage":{"total_tokens":4552,"prompt_tokens":645,"completion_tokens":3907,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":389,"completion_tokens_details":{"reasoning_tokens":3833}},"tokens_in":389,"tokens_out":3907,"duration_ms":26210,"temperature":1.0,"reasoning_tokens":3833,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T09:28:35.957925+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take the finite collection of all 3rd-order 3-dimensional tensors with entries in {0,1}; for each tensor, compute the right-recursive powers A^α until the zero-nonzero pattern repeats (which must happen, since there are finitely many patterns), and compare the predicate 'some A^α has all entries positive' with the conjunction of conditions (i)-(iii) from Theorem 2.5. One tensor where the two answers disagree would refute the characterization; an exhaustive match would corroborate it.","supporting_citations":[],"review_version":2}