LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

An inverse problem about minimal zero-sum sequences over finite cyclic groups

Photo by emileseguin from unsplash

Abstract The article characterizes the minimal zero-sum sequences over the cyclic group C n with lengths between ⌊ n / 3 ⌋ + 3 and ⌊ n / 2 ⌋… Click to show full abstract

Abstract The article characterizes the minimal zero-sum sequences over the cyclic group C n with lengths between ⌊ n / 3 ⌋ + 3 and ⌊ n / 2 ⌋ + 1 , for n ≥ 10 . This is a step beyond established results about minimal zero-sum sequences over C n of lengths at least ⌊ n / 2 ⌋ + 2 . The range of the obtained characterization is optimal. Among the possible approaches we choose one with a strong emphasis on unsplittable sequences—intriguing objects generalizing the longest minimal zero-sum sequences over an abelian group. The unsplittable sequences over C n with lengths in [ ⌊ n / 3 ⌋ + 3 , ⌊ n / 2 ⌋ + 1 ] prove capable of capturing the essence of our setting and deserve an explicit description.

Keywords: minimal zero; inverse problem; problem minimal; zero sum; sum sequences

Journal Title: Journal of Number Theory
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.