Related papers: Quantitative Curve Selection Lemma

We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…

Let $S \subset \R^{k + m}$ be a compact semi-algebraic set defined by a system of $\ell$ polynomial inequalities of degree at most 2. $ Let $\pi$ denote the standard projection from $\R^{k + m}$ onto $\R^m$. We prove that for any $q >0$,…

Let $f$ be a generically finite polynomial map $f: \mathbb{C}^n\to \mathbb{C}^m$ of algebraic degree $d$. Motivated by the study of the Jacobian Conjecture, we prove that the set $S_f$ of non-properness of $f$ is covered by parametric…

Using a strong version of the Curve Selection Lemma for real semianalytic sets, we prove that for an arbitrary connected Lie group $G$, each connected component of the set $E_n(G)$ of all elements of order $n$ in $G$ is a conjugacy class in…

We continue the investigation of curves of type p,q started in [KKW]. We study the space of such curves and the space of nodal curves with prescribed Weierstra\ss semigroup. A necessary and sufficient criterion for a numerical semigroup to…

Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…

Let $D$ be a digraph. We define the minimum semi-degree of $D$ as $\delta^{0}(D) := \min \{\delta^{+}(D), \delta^{-}(D)\}$. Let $k$ be a positive integer, and let $S = \{s\}$ and $T = \{t_{1}, \dots ,t_{k}\}$ be any two disjoint subsets of…

Let Y be a complex algebraic curve and let [Y]={X_1,...,X_n} be the set of all real algebraic curves X_i with complexification X_i(C)=Y, such that the real points X_i(R) divide X_i(C). We find all such families [Y]. According to Harnak…

We develop a variant of the barrier method in order to address questions about topology of Kostlan random real algebraic plane curves. In particular we prove that the expected number of connected components of the curve of length at least…

Let $K$ be a local field of residue characteristic $p>0$. We explain how to compute the semistable reduction of $K$-curves $Y$ equipped with a degree-$p$ morphism from $Y$ to the projective line. This includes the reduction at $p$ of…

A polynomial $f$ of degree $d$ and coefficients in an algebraically closed field $k$ defines a morphism $f:\mathbb{P}^1_k\longrightarrow\mathbb{P}^1_k$ which, if char$(k)\nmid d$, is unramified outside a finite set of points in the image:…

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

Let $\mathbb{K}$ be an algebraically closed field. In this paper, we consider the class of smooth plane curves of degree $n+1>3$ over $\mathbb{K}$, containing three points, $P_1,P_2,$ and $P_3$, such that $nP_1+P_2$, $nP_2+P_3$, and…

Let X be a set definable in a sharply o-minimal structure. We consider the problem of counting the number of points where X intersects algebraic varieties V over Q of dimension k < codim X, as a function of T := deg(V) + h(V), where h(V) is…

Semialgebraic graphs are graphs whose vertices are points in $\mathbb{R}^d$, and adjacency between two vertices is determined by the truth value of a semialgebraic predicate of constant complexity. We show how to harness polynomial…

Let $P$ be a set of $n$ points in $\R^d$. We present a linear-size data structure for answering range queries on $P$ with constant-complexity semialgebraic sets as ranges, in time close to $O(n^{1-1/d})$. It essentially matches the…

We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{P}^3$, whose image lies in a $\mathbb{P}^2$, passing through $r$ lines and $s$ points, where $r + 2s = 3d+2$. This can be viewed as a family version of…

We prove that with high probability over the choice of a random graph $G$ from the Erd\H{o}s-R\'enyi distribution $G(n,1/2)$, the $n^{O(d)}$-time degree $d$ Sum-of-Squares semidefinite programming relaxation for the clique problem will give…

We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…