Lifting of cycles in functional graphs
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912595177373696 |
|---|---|
| author | Nara, Tadahisa |
| author_facet | Nara, Tadahisa |
| contents | For a given function from a set to itself, we can define a directed graph called the functional graph, where the vertices are the elements of the set, and the edges are all the pairs of inputs and outputs for the function. In this article we consider functional graphs on Z/mZ with respect to polynomial functions. The main result describes the behavior of cycles in functional graphs on Z/p^nZ while $n$ is increasing, where $p$ is a prime number. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_16234 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Lifting of cycles in functional graphs Nara, Tadahisa Combinatorics Number Theory 37P25, 05C38, 11T06 For a given function from a set to itself, we can define a directed graph called the functional graph, where the vertices are the elements of the set, and the edges are all the pairs of inputs and outputs for the function. In this article we consider functional graphs on Z/mZ with respect to polynomial functions. The main result describes the behavior of cycles in functional graphs on Z/p^nZ while $n$ is increasing, where $p$ is a prime number. |
| title | Lifting of cycles in functional graphs |
| topic | Combinatorics Number Theory 37P25, 05C38, 11T06 |
| url | https://arxiv.org/abs/2509.16234 |