More on Periodicity and Duality associated with Jordan partitions
Pith reviewed 2026-05-24 21:12 UTC · model grok-4.3
The pith
When r ≤ p^β the composition c(r,s,p) for Jordan partitions has a determinable least period in s along with partial subperiodic and subreflective behaviors.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
When r ≤ p^β the composition c(r,s,p) is periodic in s with a least period length that the paper determines, and it exhibits new partial subperiodic and partial subreflective behavior within that period.
What carries the argument
The composition c(r,s,p) = (m1, …, mk) that records the multiplicities of the distinct parts μi in the Jordan partition λ(r,s,p) of rs.
If this is right
- The least period length of c(r,s,p) can be computed explicitly whenever r ≤ p^β.
- Partial subperiodic behavior occurs, so repetition holds on certain proper subintervals of the period.
- Partial subreflective behavior occurs, so reflection properties hold on certain proper subintervals of the period.
- All of these properties are new refinements that hold under the standing hypothesis r ≤ p^β.
Where Pith is reading between the lines
- Knowing the exact least period reduces the computation of c(r,s,p) for arbitrary s to checking a finite initial segment.
- The partial behaviors supply additional symmetry that could be used to cross-check explicit calculations of the underlying Jordan partitions.
- The same least-period and partial-pattern techniques may extend to other sequences that arise from tensor products or Kronecker products in characteristic p.
Load-bearing premise
That c(r,s,p) is periodic with period p^β (and has the associated reflection property) when r ≤ p^β, as implied by the result of Glasby, Praeger, and Xia.
What would settle it
An explicit computation of the sequence c(r,s,p) for fixed r ≤ p^β and several consecutive values of s that fails to repeat at the claimed least period or lacks the stated partial subperiodic or subreflective patterns.
read the original abstract
Let $J_r$ denote a full $r \times r$ Jordan block matrix with eigenvalue $1$ over a field $F$ of characteristic $p$. For positive integers $r$ and $s$ with $r \leq s$, the Jordan canonical form of the $r s \times r s$ matrix $J_{r} \otimes J_{s}$ has the form $J_{\lambda_1} \oplus J_{\lambda_2} \oplus \dots \oplus J_{\lambda_{r}}$ where $\lambda_1 \geq \lambda_2 \geq \dots \geq \lambda_{r}>0$. This decomposition determines a partition $\lambda(r,s,p)=(\lambda_1,\lambda_2,\dots, \lambda_{r})$ of $r s$, known as the \textbf{Jordan partition}, but the values of the parts depend on $r$, $s$, and $p$. Write \[(\lambda_1,\lambda_2,\dots, \lambda_{r})=(\overbrace{\mu_1,\dots,\mu_1}^{m_1},\overbrace{\mu_2,\dots,\mu_2}^{m_2},\dots, \overbrace{\mu_k,\dots,\mu_k}^{m_k}) =(m_1 \cdot \mu_1, \dots,m_k \cdot \mu_k),\] where $\mu_1>\mu_2>\dots>\mu_k>0$, and denote the composition $(m_1,\dots,m_k)$ of $r$ by $c(r,s,p)$. A recent result of Glasby, Praeger, and Xia in \cite{GPX} implies that if $r \leq p^\beta$, $c(r,s,p)$ is periodic in the second variable $s$ with period length $p^\beta$ and exhibits a reflection property within that period. We determine the least period length and we exhibit new partial subperiodic and partial subreflective behavior.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies the composition c(r,s,p) derived from the Jordan partition λ(r,s,p) of rs arising from the Jordan form of J_r ⊗ J_s over a field of characteristic p. Building on the periodicity and reflection result of Glasby-Praeger-Xia for the case r ≤ p^β, the authors determine the minimal period length in the variable s and establish additional partial subperiodic and partial subreflective behaviors of c(r,s,p) within that period.
Significance. The refinement of the GPX periodicity result by identifying the exact minimal period and new partial behaviors supplies more precise information on the structure of these Jordan partitions. This could facilitate explicit computations and further theoretical work on tensor products of Jordan blocks in positive characteristic, particularly in contexts where the period governs recurrence or duality phenomena.
minor comments (3)
- [Introduction] The abstract and introduction state the main claims clearly, but the manuscript should include an explicit statement of the value of β (as the smallest integer such that r ≤ p^β) at the first use of the hypothesis r ≤ p^β to avoid any ambiguity for readers.
- [§1] The notation (m1 · μ1, …, mk · μk) for the grouped partition is introduced without a displayed equation number; assigning an equation label would make subsequent references to the parts of c(r,s,p) easier to follow.
- [References] The citation to Glasby-Praeger-Xia is given as [GPX]; the reference list entry should be expanded to include the full bibliographic details (journal, volume, year, pages) for completeness.
Simulated Author's Rebuttal
We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. No major comments appear in the report, so there are no specific points requiring a point-by-point response or manuscript changes.
Circularity Check
No significant circularity identified
full rationale
The paper cites an external result from Glasby-Praeger-Xia for the base periodicity with period p^β when r ≤ p^β, then independently determines the least period length and identifies additional partial subperiodic/subreflective behaviors. No self-citation load-bearing steps, no self-definitional reductions, no fitted inputs called predictions, and no ansatz smuggling appear. The derivation chain extends the cited implication without reducing new claims to the inputs by construction.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math Existence and uniqueness of Jordan canonical form for matrices over any field
- domain assumption The periodicity with period p^β and reflection property when r ≤ p^β
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.