Optimal Range of k-Consecutive Sums on a Circle for n = 2k + 1 and n = k2 + 1
Mathematics · 09.04.2026 · 14 (8) · 1252
DOI: 10.3390/math14081252 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 09.04.2026. Verfasst von Yaoran Yang und 1 weiteren Autor:innen. Die Arbeit nennt 6 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Arrange the integers 1,2,…,n on a circle and, for a fixed k≥1, let si be the sum of the k consecutive entries starting at position i (indices taken modulo n). For a circular permutation π, define the range R(π)=maxisi−minisi, and let w(n,k) be the minimum value of R(π) over all circular permutations of {1,…,n}. We obtain three structural results. First, we prove the complement symmetry w(n,k)=w(n,n−k). Second, we determine the first nontrivial arithmetic progression case n=2k+1 exactly: w(2k+1,k)=2k2. Third, we determine the structured regime n=k2+1 exactly: w(k2+1,k)=k. The proofs combine averaging lower bounds on the progression n≡1(modk) with explicit constructions: a parity-sensitive two-block arrangement for n=2k+1 and a k×k array construction for n=k2+1.
Zitieren
APA
Yang, Y., & Zhang, Y. (2026). Optimal Range of k-Consecutive Sums on a Circle for n = 2k + 1 and n = k2 + 1. Mathematics, 14(8), 1252. https://doi.org/10.3390/math14081252
Vancouver
Yang Y, Zhang Y. Optimal Range of k-Consecutive Sums on a Circle for n = 2k + 1 and n = k2 + 1. Mathematics. 2026;14(8):1252. doi:10.3390/math14081252
BibTeX
@article{Yang2026,
author = {Yang, Yaoran and Zhang, Yutong},
title = {Optimal Range of k-Consecutive Sums on a Circle for n = 2k + 1 and n = k2 + 1},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {8},
pages = {1252},
doi = {10.3390/math14081252}
}
EUVIMED