Higher-order correlations of Tchebyscheff maps (Q5947017): Difference between revisions

This paper is devoted to the analysis of one-dimensional mappings, the Chebyshev polynomials of \(N\)th order. The authors show that the set of non-vanishing higher-order correlations turns out to have very complicated structure, which is properly described by suitable graphs. The authors prove the relevant graphs are forests of double \(N\)-ary trees. Moreover, their method allows for a perturbative treatment of Langevin-like equations where the Gaussian while noise is replaced by a deterministic chaotic dynamics on a small time scale. The paper is a generalization of the work of the second author for \(N=2\) to general \(N\).