Related papers: Estimates for the coefficients of differential dim…

Let $f$ be an analytic polynomial of degree at most $K-1$. A classical inequality of Bernstein compares the supremum norm of $f$ over the unit circle to its supremum norm over the sampling set of the $K$-th roots of unity. Many extensions…

This paper is mainly devoted to the study of the differentiation index and the order for quasi-regular implicit ordinary differential algebraic equation (DAE) systems. We give an algebraic definition of the differentiation index and prove a…

We prove the uniqueness for an inverse problem of determining a matrix coefficient $P(x)$ of a system of evolution equations $\sigma \ppp_t u = \ppp_x^2 u(t,x) - P(x) u(t,x)$ for $0<x<\ell$ and $0<t<T$, where $\ell>0$ and $T>0$ are…

We introduce a notion of dimension for the solution set of a system of algebraic difference equations that measures the degrees of freedom when determining a solution in the ring of sequences. This number need not be an integer, but, as we…

Many canonical machine learning problems boil down to a convex optimization problem with a finite sum structure. However, whereas much progress has been made in developing faster algorithms for this setting, the inherent limitations of…

We obtain a necessary and sufficient condition for the linear independence of solutions of differential equations for hyperlogarithms. The key fact is that the multiplier (i.e. the factor $M$ in the differential equation $dS=MS$) has only…

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of…

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…

We extend Kolchin's results on linear dependence over projective varieties in the constants, to linear dependence over arbitrary complete differential varieties. We show that in this more general setting, the notion of linear dependence…

Let $K$ be an {\em arbitrary} field of characteristic $p>0$ and $\CD (P_n)$ be the ring of differential operators on a polynomial algebra $P_n$ in $n$ variables. A long anticipated {\em analogue of the inequality of Bernstein} is proved for…

In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…

We prove that the roots of a smooth monic polynomial with complex-valued coefficients defined on a bounded Lipschitz domain $\Omega$ in $\mathbb R^m$ admit a parameterization by functions of bounded variation uniformly with respect to the…

Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

We prove that the theory of differentially closed fields of characteristic zero in $m\geq 1$ commuting derivations DCF$_{0,m}$ satisfies the expected form of the dichotomy. Namely, any minimal type is either locally modular or nonorthogonal…

We produce a short and elementary algorithm to compute an upper bound for the canonical dimension of a spit semisimple linear algebraic group. Using this algorithm we confirm previously known bounds by Karpenko and Devyatov as well as we…

A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…