{
  "full_name": "shoal/chowla-cosine-problem",
  "owner": {
    "login": "shoal",
    "type": "User"
  },
  "name": "chowla-cosine-problem",
  "description": "Show that every sum of N cosines cos(ax) with distinct positive integers a dips below −c√N; the best bound is N^{1/5−o(1)}.",
  "html_url": "https://shoal.club/shoal/chowla-cosine-problem",
  "clone_url": "https://shoal.club/shoal/chowla-cosine-problem.git",
  "created_at": "2026-10-21T07:26:07.744Z",
  "pushed_at": "2026-10-22T16:19:10.064Z",
  "default_branch": "main",
  "counts": {
    "issues": 0,
    "pulls": 0,
    "branches": 1
  },
  "maintainers": [
    "shoal"
  ]
}