Odd-Sum Minkowski Inclusion in Reversal-Limited Peak Gain

For a fixed discrete-time linear time-invariant system with a scalar output and fixed disturbance amplitude limits, we establish a law for peak-gain increments across reversal bounds. On a finite horizon, the gain increment from one additional reversal may increase between consecutive bounds, but cannot increase when the starting bound rises by two. We prove this law by recombining binary sequences while preserving their sum at each index and balancing their transition counts within two. At each interior bound, three consecutive constrained gains determine the exact gap to the tightest upper bound from a linear penalty on the reversal count with an optimized nonnegative weight. Explicit truncation bounds extend both results to the infinite horizon for stable systems with real, absolutely summable impulse responses. For multiple inputs, both results hold when the bound limits the sum of channelwise reversal counts. The worst-case output peak equals the maximum sum of channel peak gains scaled by their disturbance amplitude limits over admissible allocations.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-14
DOI
https://doi.org/10.5281/zenodo.23364696
Primary Topic
Stability and Control of Uncertain Systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Odd-Sum Minkowski Inclusion in Reversal-Limited Peak Gain

Son Thanh Phung, Thanh-Tri-Dai Le, Phong Lưu Nguyễn, Thi Ngoc Thao Nguyen et al.
Zenodo (CERN European Organization for Nuclear Research)
Stability and Control of Uncertain Systems
preprint

Odd-Sum Minkowski Inclusion in Reversal-Limited Peak Gain

Son Thanh Phung, Thanh-Tri-Dai Le, Phong Lưu Nguyễn, Thi Ngoc Thao Nguyen, Van Dong Hai Nguyen
preprint en

Abstract

For a fixed discrete-time linear time-invariant system with a scalar output and fixed disturbance amplitude limits, we establish a law for peak-gain increments across reversal bounds. On a finite horizon, the gain increment from one additional reversal may increase between consecutive bounds, but cannot increase when the starting bound rises by two. We prove this law by recombining binary sequences while preserving their sum at each index and balancing their transition counts within two. At each interior bound, three consecutive constrained gains determine the exact gap to the tightest upper bound from a linear penalty on the reversal count with an optimized nonnegative weight. Explicit truncation bounds extend both results to the infinite horizon for stable systems with real, absolutely summable impulse responses. For multiple inputs, both results hold when the bound limits the sum of channelwise reversal counts. The worst-case output peak equals the maximum sum of channel peak gains scaled by their disturbance amplitude limits over admissible allocations.

Zenodo (CERN European Organization for Nuclear Research)
Ho Chi Minh City University of Technology and Engineering (VN)
Stability and Control of Uncertain Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.