Discrete-time polynomial systems with inputs and outputs: structure, reachability, observability, and minimal realizations

arXiv:2609.36423 · eess.SY, cs.SY, math.OC · Submitted 2026-09-29 · Read on arXiv

eess.SY, cs.SY, math.OC

Submitted: 2026-09-29

Updated: 2026-09-29

Terminology

• Generalization — 16× in this paper · explained in 13 episodes
• Embeddings — 11× in this paper · explained in 2 episodes
• Hybrid System — 2× in this paper · explained in 2 episodes
• Parameter Identifiability — 2× in this paper · explained in 2 episodes
• Verification — 2× in this paper · explained in 2 episodes
• Abstraction — 1× in this paper · explained in 1 episode
• Axioms — 1× in this paper · explained in 2 episodes
• Hilbert Space — 1× in this paper · explained in 2 episodes
• System Identification — 1× in this paper · explained in 3 episodes

Sources

• Exact Finite Koopman Embedding of Block-Oriented Polynomial Systems

Related papers

• One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
• A Geometric Decision Procedure for STL Feasibility and Repair
• Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
• Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model
• Minimal Experiments for Robust Stabilization: Information, Spectral Geometry, and Duration
• Decentralized Power-Optimal Coordination for Spacecraft Swarms Using Time-Varying Magnetorquer Actuation