Supplementary Material to: Realizations of a Special Class of Admittances with Strictly Lower Complexity than Canonical Forms

2015/01/19 by Michael Z. Q. Chen, Chen, Michael Z. Q., Kai Wang +5 · 1 citation
Mathematics · #Advanced Differential Equations and Dynamical Systems #Algebra over a field #Artificial intelligence #Canonical form #Class (philosophy) #Computer science #FOS: Mathematics #Fixed Point Theorems Analysis #Geometry #Mathematical proof #Mathematics #Nonlinear Differential Equations Analysis #Optimization and Control (math.OC) #Pure mathematics #math.OC

paper · pdf · doi:10.48550/arxiv.1501.04488

published in arXiv (Cornell University) (Cornell University) · 6 pages, 2 figures, supplementary report to a journal paper

arxiv created 2015/01/19 · openalex publication_date 2015/01/19 · arxiv updated 2015/01/20 · openalex created_date 2016/07/22 · openalex updated_date 2026/07/28

Abstract

This is supplementary material to "Realizations of a special class of admittances with strictly lower complexity than canonical forms" [1], which presents the detailed proofs of some results. For more background information, refer to [2]-[22] and references therein.

Citations

• Synthesis of mechanical networks: the inerter

Related

• Complexity Classes as Mathematical Axioms II
• An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity
• Relativizing Small Complexity Classes and their Theories
• Weak length induction and slow growing depth boolean circuits
• Graphs and Circuits: Some Further Remarks