相关论文: Shifted varieties and discrete neighborhoods aroun…

Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Separation bounds are a fundamental measure of the complexity of solving a zero-dimensional system as it measures how difficult it is to separate its zeroes. In the positive dimensional case, the notion of reach takes its place. In this…

The problem of determining the volume of a tubular neighbourhood has a long and rich history. Bounds on the volume of neighbourhoods of algebraic sets have turned out to play an important role in the probabilistic analysis of condition…

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…

Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received a considerable amount of attention in recent years. In this…

Given a complex algebraic variety X, we define a natural number called the motivic dimension which measures the amount of transcendental (co)homology of X. It is zero precisely when all the (co)homolgy is spanned by algebraic cycles. Most…

In this article we study invariance properties of shift-invariant spaces in higher dimensions. We state and prove several necessary and sufficient conditions for a shift-invariant space to be invariant under a given closed subgroup of…

We study algebraic dynamical systems (and, more generally, $\sigma$-varieties) $\Phi:{\mathbb A}^n_{\mathbb C} \to {\mathbb A}^n_{\mathbb C}$ given by coordinatewise univariate polynomials by refining a theorem of Ritt. More precisely, we…

Dynamical systems of a new kind are described, which are motivated by the problem of constructing diffeomorphism invariant quantum theories. These are based on the extremization of a non-local and non-additive quantity that we call the…

In this short note we prove a couple of facts about polynomial count varieties, answering natural questions that they raise. A polynomial count $X$ variety is essentially one for which its number of points over finite fields is given by a…

We consider the problem of testing whether the points in a complex or real variety with non-zero coordinates form a multiplicative group or, more generally, a coset of a multiplicative group. For the coset case, we study the notion of…

This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…

This paper investigates why and when the edge-based districting problem becomes computationally intractable. The overall problem is represented as an exact mathematical programming formulation consisting of an objective function and several…

It is generally hard to count, or even estimate, how many integer points lie in a polytope P. Barvinok and Hartigan have approached the problem by way of information theory, showing how to efficiently compute a random vector which samples…

The problem of deciding, given a complex variety X, a point x in X, and a subvariety Z of X, whether there is an automorphism of X mapping x into Z is proved undecidable. Along the way, we prove the undecidability of a version of Hilbert's…

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

Degree bounds for algebra generators of invariant rings are a topic of longstanding interest in invariant theory. We study the analogous question for field generators for the field of rational invariants of a representation of a finite…

A short note on bounds on distance to variety of a point in terms of the Taylor coefficients at the point.

We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimensional subshifts of finite type : there exists a threshold in the irreducibility rate where…