. Let’s take into consideration the zeta function by the definition:
Let’s take a function, f = x2. Finding the fixed points of the function, we find the card(fix(fn)) to be 2,4,6,...2n for n=1,2,3...n .Substituting the values in the above zeta function we get:
where we take the polar form of the t = a + ib, i.e., t = rexp(i ∗ θ)
We would now be able to compute the zeta function and would be able to plot the same.For the generalized implementation, we would have to create a class for artin-mazur zeta function which would have the functions to calculate the number of fixed point from each iteration and the cardinality of the sets. Then the problem can be computed with solving the formal power series.
For computing this I need to know from the community about:
There are a few issues with your math.
For maps which are morphisms, the number of fixed points is the degree
of the map (or degree +1 in projective space), so the zeta function
should be easy to compute. In particular, your calculations for f(x) =
x^2 are wrong.
Yes, there is functionality in Sage to compute the fixed points and
iterates of maps (take a look at the projective_morphism.py file).
However, this is only feasible for the first few iterates since the
degree of the iterates grows exponentially, so the computations will
quickly be infeasible. However, with this functionality, computing the
first few coefficients of the power series should be trivial.
I'm not sure about creating a class for the zeta function. If all you're
doing is computing it (or approximating it), then it seems like it could
be a member function of the morphism class.
I can't help with (2) when you are outside of the basically trivial
situations.