Back to search
2503.23520

Discrete-Time Periodic Monotonicity Preserving Systems

Christian Grussler

correctmedium confidence
Category
Not specified
Journal tier
Strong Field
Processed
Sep 28, 2025, 12:56 AM

Audit review

The paper’s Theorem 4 (i)⇔(ii)⇔(iii) is explicitly stated and proved in the appendix, using the convexity-preservation equivalence (Lemma 10) and the convex-contour characterization (Theorem 1), plus the oriented-area identity det[[Δg(t),Δg(t−1);Δg(t+1),Δg(t)]] = det[[Δg(t−1),g(t−1),1];[Δg(t),g(t),1];[Δg(t+1),g(t+1),1]] to obtain the log-concavity condition and PM of Δg. This matches (ii)⇔(iii) and supplies a correct proof of (ii)⇒(i) (; ; ; ). By contrast, the model’s key step for (i)⇔(ii) invokes the Karlin–Schoenberg variation‑diminishing characterization to conclude that the circulant Toeplitz matrix K with kernel Δg must be cyclic sign‑regular of order 3. This misapplies the theorem: PMP(T) requires Sg to preserve unimodality of inputs (equivalently S_c[Δu]≤2), not to be CVB2 on all inputs with S_c[u]≤2. The paper itself emphasizes PMP(T) is strictly weaker than CVB2(T) (Lemma 9), and provides a different, correct route from (ii)⇒(i) without assuming sign‑regularity of K (; ).

Referee report (LaTeX)

\textbf{Recommendation:} minor revisions

\textbf{Journal Tier:} strong field

\textbf{Justification:}

This paper offers clear, tractable characterizations of periodically monotone preserving discrete-time convolution operators via a geometric convex-contour criterion, and connects this to a local log-concavity condition on Δg. The core equivalence (Theorem 4) is rigorously proved, leveraging precise cyclic-variation notions and an elegant oriented-area identity. The exposition is generally clear and well organized, with helpful links to total positivity and applications to LTI systems. Minor clarifications on the strict/non-strict cases and small editorial points would further improve readability.