On the coefficient-choosing game

DOI10.2140/moscow.2021.10.183zbMath1471.91070arXiv2007.00213OpenAlexW3199404117MaRDI QIDQ2235355

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) Combinatorial games (91A46) Polynomials (11S05)

Related Items (1)

A game with two players choosing the coefficients of a polynomial

Cites Work

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

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