The coefficient-choosing game

MaRDI QIDQ5232590zbMATH OpenFDO

Authors Samuel Zbarsky, William Gasarch, Lawrence C. Washington

Publication date 12 September 2019

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

zbMATH Keywords

coefficient-choosing gamepolynomialstwo-player game

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) 2-person games (91A05) Combinatorial games (91A46)

Abstract: Let $D$ be an integral domain. Two players, Nora and Wanda, alternately choose coefficients from $D$ for a polynomial of degree $d$. When they are done, if the polynomial has a root in the field of fractions of $D$, then Wanda wins. If not, then Nora wins. We determine, for many $D$, who wins this game.

Recommendations

• On 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

Cited in

(3)

• Element-building games on \(\mathbb{Z}_n\)
• A game with two players choosing the coefficients of a polynomial
• On the coefficient-choosing game

This page was built for publication: The coefficient-choosing game

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