Period adding bifurcation in a logistic map with memory

We introduce a single step memory dependence in the fully chaotic logistic map. This makes it a two dimensional system in general. However, we show that by using composite functions to define two one dimensional maps, it is possible to obtain some analytic results for the bifurcation structure. Numerical results support the calculated bifurcation scheme and, in addition, yield a further insight which allows the calculation of the convergence ratio for a new period adding scenario.