Counting in Vieta graphs over Fp
Bogdan Nica
Abstract
We introduce and study a finite simple graph of algebraic origin: the Vieta graph on the solution set over Fp to a symmetric, multivariate equation which is quadratic in each variable. This construction is a broad generalization of the Markoff graph over Fp, extensively studied in the recent literature. We give a systematic approach, partly based on quadratic character sums, to the following basic counting questions: how many vertices does a Vieta graph have, and what is the degree distribution? We focus on explicit counts, addressing the low-dimensional cases in three and four variables.
Create a lesson
Related papers
Explicit equations of Galois subfields of Hermitian function fields with respect to decomposition groups
Liming Ma, Yipeng Wang
Tunnell-type criteria for variants of the congruent number problem
Bo-Hae Im, Minseo Shin
A uniform effective André--Oort result
Guy Fowler
On a conjecture of Browning and Sawin on random hypersurfaces with sign coefficients
Ken Ono, Ashvin Swaminathan
On Multiple Eisenstein Series in Positive Characteristic: Direct Sum Result
Chieh-Yu Chang, Song-Yun Chen, Fei-Jun Huang et al.
Stable Trace Formula for Newton strata of Shimura varieties
Dhruva Kelkar