On the coefficient-choosing game
From MaRDI portal
Publication:2235355
DOI10.2140/MOSCOW.2021.10.183zbMATH Open1471.91070arXiv2007.00213OpenAlexW3199404117MaRDI QIDQ2235355FDOQ2235355
Authors: Divyum Sharma, L. Singhal
Publication date: 21 October 2021
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Abstract: Nora and Wanda are two players who choose coefficients of a degree polynomial from some fixed unital commutative ring . Wanda is declared the winner if the polynomial has a root in the ring of fractions of 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 or greater than ) with no roots in the maximal abelian extension of .
Full work available at URL: https://arxiv.org/abs/2007.00213
Recommendations
2-person games (91A05) Polynomials in number theory (11C08) Polynomials (11S05) Combinatorial games (91A46)
Cites Work
Cited In (2)
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)