Avoiding-sequences with minimum sum
From MaRDI portal
Let x,n be positive integers with \(x\leq n\). A sequence \(a_ 1,a_ 2,...,a_ n\) of positive integers is called x-avoiding circular sequence of length n if no set of consecutive terms of the sequence \(a_ 1,...,a_ n,a_ 1,...,a_ n\) sums to x. The authors show that if \(a_ 1,...,a_ n\) is an x-avoiding circular sequence of length n then \(a_ 1+...+a_ n\geq 2n\) and give a necessary and sufficient condition for equality. Exact values of \(a_ 1+...+a_ n\) are given for x-avoiding circular sequences of length n for \(x=2,4\), and 6.
Recommendations
- scientific article; zbMATH DE number 15241
- Avoiding zero-sum subsequences of prescribed length over the integers
- scientific article; zbMATH DE number 637319
- Circular avoiding sequences with prescribed sum
- Sum-avoiding subsets
- scientific article; zbMATH DE number 5577846
- Sequences of integers avoiding 3-term arithmetic progressions
- Pattern avoidance in ascent sequences
- A Study of Minimizing Sequences
Cites work
Cited in
(6)- Circular avoiding sequences with prescribed sum
- Avoiding triples in arithmetic progression
- scientific article; zbMATH DE number 15241 (Why is no real title available?)
- scientific article; zbMATH DE number 637319 (Why is no real title available?)
- A type of special circular sequence: \((k,q)\)-flat sequence
- Avoiding zero-sum subsequences of prescribed length over the integers
This page was built for publication: Avoiding-sequences with minimum sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1117263)
