Related papers: Critical Point Computations on Smooth Varieties: D…

A fundamental problem in arithmetic geometry is to determine the image of the mod $N$ Galois representation for all elliptic curves over $\mathbb{Q}$ and integers $N \geq 1$. For a given subgroup $G \le…

We prove that zeros and critical points of a random polynomial $p_N$ of degree $N$ in one complex variable appear in pairs. More precisely, if $p_N$ is conditioned to have $p_N(\xi)=0$ for a fixed $\xi \in \C\backslash\set{0},$ we prove…

Given a real projective curve with homogeneous coordinate ring R and a nonnegative homogeneous element f in R, we bound the degree of a nonzero homogeneous sum-of-squares g in R such that the product fg is again a sum of squares. Better…

Let $p_n$ be a random, degree $n$ polynomial whose roots are chosen independently according to the probability measure $\mu$ on the complex plane. For a deterministic point $\xi$ lying outside the support of $\mu$, we show that almost…

Given a trivially graded polynomial ring $A=K[a_1,\dots,a_m]$ over a field $K$ and a positively graded polynomial ring $P=A[x_1,\dots,x_k]$, we study graded rings $R=P/I$, where $I$ is a homogeneous ideal in $P$ such that $I\cap A = \{0\}$.…

Let $q$ be a nondegenerate quadratic form on $V$. Let $X\subset V$ be invariant for the action of a Lie group $G$ contained in $SO(V,q)$. For any $f\in V$ consider the function $d_f$ from $X$ to $C$ defined by $d_f(x)=q(f-x)$. We show that…

In the first part we study critical points of random polynomials. We choose two deterministic sequences of complex numbers,whose empirical measures converge to the same probability measure in complex plane. We make a sequence of polynomials…

Consider a component of the Hilbert scheme whose general point corresponds to a degree d genus g smooth irreducible and nondegenerate curve in a projective variety X. We give lower bounds for the dimension of such a component when X is P^3,…

Let ${\cal P}=\{h_1, ..., h_s\}\subset \Z[Y_1, ..., Y_k]$, $D\geq \deg(h_i)$ for $1\leq i \leq s$, $\sigma$ bounding the bit length of the coefficients of the $h_i$'s, and $\Phi$ be a quantifier-free ${\cal P}$-formula defining a convex…

We study a broad class of polynomial optimization problems whose constraints and objective functions exhibit sparsity patterns. We give two characterizations of the number of critical points to these problems, one as a mixed volume and one…

Let $D$ be a disk in $\mathbb{R}^n$ and $f\in C^{r+2}(D, \mathbb{R}^k)$. We deal with the problem of the algebraic approximation of the set $j^{r}f^{-1}(W)$ consisting of the set of points in the disk $D$ where the $r$-th jet extension of…

Multipoint evaluation is the computational task of evaluating a polynomial given as a list of coefficients at a given set of inputs. And while \emph{nearly linear time} algorithms have been known for the univariate instance of multipoint…

We deal with the following closely related problems: (i) For a germ of a reduced plane analytic curve, what is the minimal degree of an algebraic curve with a singular point analytically equivalent (isomorphic) to the given one? (ii) For a…

We introduce an algebraicity criteria. It has the following form: under certain conditions, an analytic subvariety of some algebriac variety over a global field $K$, if it contains many $K$-points, then it is algebraic over $K.$ This gives…

Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…

Many practical integer programming problems involve variables with one or two-sided bounds. Dunkel and Schulz (2012) considered a strengthened version of Chvatal-Gomory (CG) inequalities that use 0-1 bounds on variables, and showed that the…

In this paper, we study linear convolutional networks with one-dimensional filters and arbitrary strides. The neuromanifold of such a network is a semialgebraic set, represented by a space of polynomials admitting specific factorizations.…

We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the…

Define a boundary point of a graph which is embedded in the Euclidean plane a vertex which is incident to only one edge. In this paper we consider graphs which are embedded in the Euclidean plane with a finite number of boundary points. The…

In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In particular, our approach…