Abstract
We give explicit formulas for the number U n(N) of closed polygonal paths of length N (starting from the origin) whose steps are n th roots of unity, as well as asymptotic expressions for these numbers when N → ∞. We also prove that the sequences (U n(N))N≥0 are P-recursive for each fixed n ≥ 1 and leave open the problem of determining the values of N for which the dual sequences (U n(N))n≥1 are P-recursive.
| Original language | English |
|---|---|
| Pages | 599-610 |
| Number of pages | 12 |
| Publication status | Published - 2011 |
| Externally published | Yes |
| Event | 23rd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'11 - Reykjavik, Iceland Duration: 13 Jun 2011 → 17 Jun 2011 |
Conference
| Conference | 23rd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'11 |
|---|---|
| Country/Territory | Iceland |
| City | Reykjavik |
| Period | 13/06/11 → 17/06/11 |
Keywords
- Asymptotics
- Closed polygonal paths
- P-recursive
- Roots of unity
ASJC Scopus subject areas
- Algebra and Number Theory
Fingerprint
Dive into the research topics of 'Closed paths whose steps are roots of unity'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver