Shifted varieties and discrete neighborhoods around varieties

12/17/2018
by   Joachim von zur Gathen, et al.
0

For an affine variety X defined over a finite prime field F_p and some integer h, we consider the discrete h-neighborhood of the set of F_p-rational points, consisting of those points over F_p whose distance from X is not more than h, for a natural notion of "distance". There is a natural upper bound on its size. We address the question whether the neighborhood's size is close to its upper bound. The central notion for understanding this question turns out to be the shift of a variety, which is the translation by a nonzero constant vector of the coordinates. If no absolutely irreducible component with maximal dimension of X is a shift of another component, then the answer to the question is "yes". For the opposite case, we exhibit examples where the answer is "no". When X is absolutely irreducible, the condition on shifts turns out to be necessary and sufficient. Computationally, testing the condition is coNP-complete under randomized reductions, already for simple cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2020

An almost optimal bound on the number of intersections of two simple polygons

What is the maximum number of intersections of the boundaries of a simpl...
research
05/11/2023

A tight upper bound on the number of non-zero weights of a constacyclic code

For a simple-root λ-constacyclic code 𝒞 over 𝔽_q, let ⟨ρ⟩ and ⟨ρ,M⟩ be t...
research
03/24/2022

Geometric Dominating Sets

We consider a minimizing variant of the well-known No-Three-In-Line Prob...
research
06/21/2017

Art Gallery Localization

We study the problem of placing a set T of broadcast towers in a simple ...
research
07/31/2023

Higher rank antipodality

Motivated by general probability theory, we say that the set X in ℝ^d is...
research
01/07/2022

Most Clicks Problem in Lights Out

Consider a game played on a simple graph G = (V, E) where each vertex co...
research
09/05/2022

Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings

The purpose of this article is to study the algorithmic complexity of th...

Please sign up or login with your details

Forgot password? Click here to reset