Asset Details
Do you wish to reserve the book?
Counting Rational Points on Danielewski and Double Danielewski Surfaces over Finite Fields
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Counting Rational Points on Danielewski and Double Danielewski Surfaces over Finite Fields
Do you wish to request the book?
Counting Rational Points on Danielewski and Double Danielewski Surfaces over Finite Fields
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
Counting Rational Points on Danielewski and Double Danielewski Surfaces over Finite Fields
2026
Overview
Let \\(\\) be the finite field with \\(q\\) elements. We study the number of \\(\\)-rational points on Danielewski and double Danielewski surfaces. For Danielewski surfaces, the point count is reduced to the number of roots of \\(P(Z)\\) over \\( \\) For double Danielewski surfaces, one has to count the number of tuples \\(( )ın^2\\), such that \\(P(0,)=0\\), \\(Q(0, )=0\\) hold simultaneously. We compute these numbers using gcd methods, resultants, character sums, Gauss sums, and the König--Rados theorem. We obtain explicit formulas in several structured cases, derive general bounds, and give a Macaulay2 algorithm for verification and show an intresting connection between the number of \\(\\)-rational points of these surfaces and polygonal numbers.
Publisher
Cornell University Library, arXiv.org
Subject
