Direction-complete finite-field sets and quadratic secant lifting
Statement
Problem 3.9 (A. Granville). Given a finite field F and an integer n ≥ 1, find the smallest size of a subset E ⊂ F n which determines all directions in Fn.PALO ALTO PROBLEMS 9
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.