On the coefficient-choosing game

DOI10.2140/MOSCOW.2021.10.183MaRDI QIDQ2235355zbMATH OpenOpenAlexFDO

Authors Divyum Sharma, L. Singhal

Publication date 21 October 2021

Published in Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

Newton polygonsroots of polynomialsfinite cyclic rings

Mathematics Subject Classification ID

2-person games (91A05) Polynomials in number theory (11C08) Polynomials (11S05) Combinatorial games (91A46)

Abstract: Nora and Wanda are two players who choose coefficients of a degree $d$ polynomial from some fixed unital commutative ring $R$. Wanda is declared the winner if the polynomial has a root in the ring of fractions of $R$ and Nora is declared the winner otherwise. We extend the theory of these games given by Gasarch, Washington and Zbarsky to all finite cyclic rings and determine the possible outcomes. A family of examples is also constructed using discrete valuation rings for a variant of the game proposed by these authors. Our techniques there lead us to an adversarial approach to constructing rational polynomials of any prescribed degree (equal to $3$ or greater than $8$) with no roots in the maximal abelian extension of $mathbbQ$.

Recommendations

• The coefficient-choosing game
• A game with two players choosing the coefficients of a polynomial
• scientific article; zbMATH DE number 6296052
• Computational complexity of winning strategies in two player polynomial games
• scientific article; zbMATH DE number 29719

Cites work

• On equation \(x^q=a\) over \(\mathbb Q_p\)
• Randomized polynomial-time root counting in prime power rings

Cited in

(2)

• A game with two players choosing the coefficients of a polynomial
• The coefficient-choosing game

This page was built for publication: On the coefficient-choosing game

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