Circular avoiding sequences with prescribed sum
Given positive integers \(x,n,s\) a finite sequence \(a_ 1,a_ 2,\dots,a_ n\) of positive integers is called \(x\)-avoiding circular sequence of length \(n\) with sum \(s\) 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 the paper a necessary and sufficient condition for the existence of such sequences is proved. The proof (due to D. Hickerson) uses a graph theoretical argument and suggests an effective method for their construction. The formulae for the number (up to rotation) of \(x\)-avoiding circular sequences of length \(n\) with sum \(s=2n\) and \(s=2n+1\) are also derived.
This page was built for publication: Circular avoiding sequences with prescribed sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801666)
