Abstract
In this paper we consider polynomial kernel representations for behaviors. For behaviors over fields it is well-known that minimal representations, i.e. representations with minimal row degrees, are exactly those representations for which the polynomial matrix is row reduced. In this paper we consider behaviors over a particular type of ring, namely ℤpr, where p is a prime number and r is a positive integer. As a starting point in this investigation we focus on minimal partial realizations. These are equivalent to shortest linear recurrence relations. We present an algorithm that computes a parametrization of all shortest linear recurrence relations for a finite sequence in ℤpr. For this we extend well-known techniques developed by Reeds and Sloane in the 80's with methods from the theory of behavioral modeling.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
