ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥4n\ge4 be even. Let ρ\rho and ϕ\phi be the game parameters, let π0\pi_0 and bn−2b_{n-2} be the quantities defined for the stationary dynamics, and let Gn,n−2G_{n,n-2}, En−2E_{n-2}, En,n−2E_{n,n-2}, Hn,n−2H_{n,n-2}, and Gn+2,nG_{n+2,n} denote the functions whose zero curves partition the parameter plane. For a finite word ww, let Δw\Delta_w denote the corresponding set of initial states, and let [1,n,1,n−2][1,n,1,n-2], [1,n−2][1,n-2], and [1,n][1,n] denote the indicated limit cycles. Adjacent-cycle conjecture. Let n≥4n\ge4 be even. The curve bn−2−π0=0b_{n-2}-\pi_0=0 lies below Hn,n−2=0H_{n,n-2}=0 and above Gn+2,n=0G_{n+2,n}=0, with bn−2−π0b_{n-2}-\pi_0 positive above and negative below the curve. If Gn,n−2<0G_{n,n-2}<0 and En−2≥0E_{n-2}\ge0, there are precisely two limit cycles, of forms [1,n,1,n−2][1,n,1,n-2] and [1,n−2][1,n-2], together with an unstable equilibrium. If En−2<0E_{n-2}<0 and En,n−2≥0E_{n,n-2}\ge0, there is a unique asymptotically stable limit cycle of form [1,n,1,n−2][1,n,1,n-2], together with an unstable equilibrium. If En,n−2<0E_{n,n-2}<0 and Hn,n−2≥0H_{n,n-2}\ge0, there are precisely two limit cycles, of forms [1,n,1,n−2][1,n,1,n-2] and [1,n][1,n], together with an unstable equilibrium. If Hn,n−2<0H_{n,n-2}<0 and bn−2−π0≥0b_{n-2}-\pi_0\ge0, there is a unique asymptotically stable limit cycle of form [1,n][1,n], together with an unstable equilibrium. If bn−2−π0<0b_{n-2}-\pi_0<0 and Gn+2,n≥0G_{n+2,n}\ge0, there is a unique asymptotically stable limit cycle of form [1,n][1,n], together with an unstable equilibrium. In each case, the corresponding decomposition of ΔA\Delta_A in the conjecture is asserted, and every initial state in ΔB−ΔB‾\Delta_B-\Delta_{\overline{B}} eventually enters ΔA\Delta_A. These claims extend the proposed classification of greedy collective Parrondo dynamics beyond the regions covered by the preceding theorems; the supplied text presents them as conjectural rather than proved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.