{"paper":{"title":"A recurrence relation for elliptic divisibility sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Matteo Verzobio","submitted_at":"2021-02-15T14:21:05Z","abstract_excerpt":"In literature, there are two different definitions of elliptic divisibility sequences. The first one says that a sequence of integers $\\{h_n\\}_{n\\geq 0}$ is an elliptic divisibility sequence if it verifies the recurrence relation $h_{m+n}h_{m-n}h_{r}^2=h_{m+r}h_{m-r}h_{n}^2-h_{n+r}h_{n-r}h_{m}^2$ for every natural number $m\\geq n\\geq r$. The second definition says that a sequence of integers $\\{\\beta_n\\}_{n\\geq 0}$ is an elliptic divisibility sequence if it is the sequence of the square roots (chosen with an appropriate sign) of the denominators of the abscissas of the iterates of a point on a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07573","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.07573/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}