Realizability of integer sequences as differences of fixed point count sequences

zbMATH Open1259.37007arXiv0905.1203MaRDI QIDQ3637686FDOQ3637686

Authors: Natascha Neumärker 

Publication date: 13 July 2009

Abstract: A sequence of non-negative integers is exactly realizable as the fixed point counts sequence of a dynamical system if and only if it gives rise to a sequence of non-negative orbit counts. This provides a simple realizability criterion based on the transformation between fixed point and orbit counts. Here, we extend the concept of exact realizability to realizability of integer sequences as differences of the two fixed point counts sequences originating from a dynamical system and a topological factor. A criterion analogous to the one for exact realizability is given and the structure of the resulting set of integer sequences is outlined.

Full work available at URL: https://arxiv.org/abs/0905.1203

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Arithmetic and growth of periodic orbits
• Fibonacci along even powers is (almost) realizable
• Smoothness is not an obstruction to realizability
• scientific article; zbMATH DE number 2186893
• scientific article; zbMATH DE number 1919523

zbMATH Keywords

dynamical systemsrealizabilityinteger sequences

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25)

Cited In (3)

• Generalized Dold sequences on partially-ordered sets
• Realizability of some combinatorial sequences
• Dold sequences, periodic points, and dynamics

Uses Software

• OEIS

This page was built for publication: Realizability of integer sequences as differences of fixed point count sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637686)