New explicit constructions of quasi-random hypergraphs from multivariate polynomials over finite fields yield an asymptotic count for k-Diophantine m-tuples and unify prior hypergraph families.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
$f$-Diophantine sets over finite fields via quasi-random hypergraphs from multivariate polynomials
New explicit constructions of quasi-random hypergraphs from multivariate polynomials over finite fields yield an asymptotic count for k-Diophantine m-tuples and unify prior hypergraph families.