Abstract
This paper presents a study of the relationships between the missing powers of polynomials in network functions and the network geometry. The elementary transformation of trees and the 2-trees of a network are introduced to obtain the necessary and sufficient conditions for polynomials in network functions to have missing powers. It is shown that the polynomial in the numerator of the transfer function of a grounded two-terminal-pair RLC network cannot have two successive missing powers unless some common factors of the numerator and the denominator are cancelled. This result is useful in topological synthesis where one must usually restore all the necessary surplus factors before deciding on the minimum number of vertices and the geometry of the network.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.