# Shifted varieties and discrete neighborhoods around varieties

## TL;DR

This paper investigates the size of neighborhoods around algebraic varieties over finite fields, characterizing when the trivial bounds are tight and linking shift-invariance to geometric and computational properties.

## Contribution

It provides a characterization of shift-invariant varieties as cylinders and shows the intractability of detecting shift-invariance computationally.

## Key findings

- Asymptotic tightness of neighborhood bounds for most varieties.
- Shift-invariance corresponds to being a cylinder over a base variety.
- Determining shift-invariance is NP-hard.

## Abstract

In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for Newton's root-finding method. Bounds, sometimes very precise, are known for the volumes over R or C of such neighborhoods of the varieties of "critical" inputs. This paper deals with the discrete version of this question: over a finite field, how many points lie in a certain type of neighborhood around a given variety? A trivial upper bound on this number is (size of the variety) x (size of a neighborhood of a point). It turns out that this bound is usually asymptotically tight, including for the singular matrices, polynomials with multiple roots, and pairs of non-coprime polynomials. The interesting question then is: for which varieties does this bound not hold? We show that these are precisely those that admit a shift, that is, where one absolutely irreducible component is a shift (translation by a fixed nonzero point) of another such component. Furthermore, the shift-invariant absolutely irreducible varieties are characterized as being cylinders over some base variety. Computationally, determining whether a given variety is shift-invariant turns out to be intractable, namely NP-hard even in simple cases.