Abstract
Two sequences (a1, a2, . . . , an) and (b1, b2, . . . , bn), sharing n − 1 elements, are said disarranged if for every subset Q ⊆ [n], the sets {ai | i ∈ Q} and {bi | i ∈ Q} are different. In this paper we investigate properties of these pairs of sequences. Moreover we extend the definition of disarranged pairs to a circular string of n-sequences and prove that, for every positive integer m, except some initials values for n even, there exists a similar structure of length m.
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.
