scientific article; zbMATH DE number 15241
[For the entire collection see Zbl 0688.00002.] For given positive integers \(x\) and \(n\) the finite sequence \(a_ 1,a_ 2,\dots,a_ n\) of positive integers is called \(x\)-avoiding circular sequence of length \(n\) if no set of consecutive terms of the periodically extended sequence \(a_ 1,a_ 2,\dots,a_ n,a_ 1,a_ 2,\dots,a_ n,\dots\) sums to \(x\). In a previous paper [Discrete Appl. Math. 22, No. 2, 103-108 (1989; Zbl 0667.10009)] the authors showed that if \(\sigma(n,x)=\min\{a_ 1+a_ 2+\dots+a_ n\}\) where \(a_ 1,a_ 2,\dots,a_ n\) runs over all \(x\)-avoiding circular sequences of length \(n\) then \(\sigma(n,x)\geq 2n\) and proved a necessary and sufficient condition for the equality. In the present paper they investigate the case \(\sigma(n,x)=2n+1\) and determine the value of \(\sigma(n,x)\) for all \(x\leq 18\) and all \(n\).
- Circular avoiding sequences with prescribed sum
- Avoiding-sequences with minimum sum
- scientific article; zbMATH DE number 637319
- Avoiding zero-sum subsequences of prescribed length over the integers
- Circulants and Sequences
- Cyclically consecutive permutation avoidance
- Cyclic compositions of a positive integer with parts avoiding an arithmetic sequence
- Minimal zero-sum sequences in finite cyclic groups
- Sum-avoiding subsets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977575)
