Abstract
Let α = {α1, ...,αk} be a finite multiset of non-negative real numbers. Consider the sequence of all positive integer multiples of all αi’s, and note the multiplicity of each term in this sequence. This sequence of multiplicities is the resonance sequence generated by {α 1, ...,αk}. Two multisets are combinatiorially equivalent if they generate the same resonance sequence. The paper is devoted to the classification of multisets up to combinatorial equivalence. We show that the problem of combinatorial equivalence of multisets is closely related to the problem of classification of systems of second order ordinary differential equations up to focal equivalence.
Sign-in/Register to access full text options 
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.
