This article is available for purchase or by subscription. See below.
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 (2018) 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
.
|
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.83
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
roots of polynomials, finite cyclic rings, Newton polygons
|
Mathematical Subject Classification
Primary: 91A46
Secondary: 11C08, 11S05
|
Milestones
Received: 29 November 2020
Revised: 15 June 2021
Accepted: 5 July 2021
Published: 13 September 2021
|
|