ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let games AA and BB be as in Theorem 4, with the bias parameter absent. For positive integers rr and ss, let μ[r,s](0)\mu_{[r,s]}(0) denote the expected gain per turn for the periodic pattern consisting of rr plays of AA followed by ss plays of BB. Sign conjecture. For every pair of positive integers rr and ss, μ[r,s](0)>0\mu_{[r,s]}(0)>0 if κ<λ<1\kappa<\lambda<1 or κ>λ>1\kappa>\lambda>1, μ[r,s](0)=0\mu_{[r,s]}(0)=0 if κ=λ\kappa=\lambda or λ=1\lambda=1, and μ[r,s](0)<0\mu_{[r,s]}(0)<0 if λ<min⁡(κ,1)\lambda<\min(\kappa,1) or λ>max⁡(κ,1)\lambda>\max(\kappa,1). This conjecture extends the sign description established in the preceding theorem to all positive integers r,sr,s; the source states that the analogous theorem cannot be proved in this setting.

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.