Small-index subsequences in finite cyclic groups
For $r\ge1$, let $I_r(n)$ be the least length forcing a nonempty zero-sum subsequence of index at most $r$ over the cyclic group $C_n$. We prove $I_r(n)\le n^{1+o(1)}$ when $r\ge C[\omega(n)\log(2\omega(n))]^2$, and $I_1(p^k)\ll(k+1)p^k\log(2p^k)$ for prime powers. We also construct sequences showing that $I_r(n)/n$ is unbounded for every fixed $r$; for $r=1$, all terms may be generators.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2610.00673
curl -X POST /api/v1/records/hexagon/2610.00673/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00673/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'