Related papers: Rolle models in the real and complex world

Let f1, ..., fs be a polynomial family in Q[X1,..., Xn] (with s less than n) of degree bounded by D. Suppose that f1, ..., fs generates a radical ideal, and defines a smooth algebraic variety V. Consider a projection P. We prove that the…

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

General concept of a gradation slicing is used to analyze polynomial solutions of ordinary differential equations (ODE) with polynomial coefficients, ${\cal L}\psi=0$, where ${\cal L}=\sum_l p_l(z) d_z^l$, $p_l(z)$ are polynomials, $z$ is a…

This paper investigates how global decision problems over arithmetically represented domains acquire reflective structure through class-quantification. Arithmetization forces diagonal fixed points whose verification requires reflection…

Using model theory and differential algebra, we give necessary conditions for algebraic ordinary differential equations to have a complex Pfaffian solution on some complex domain. These tools also allow us to give many examples of algebraic…

We call a smooth function of one variable a degree n pseudopolynomial if its n-th derivative has no (real) zeros. An n pseudopolynomial is called hyperbolic if it has exactly n simple zeros. In this short note we describe the necessary and…

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…

In this paper, we explore two fundamental theorems of differential calculus: Rolle's Theorem and the Mean Value Theorem (MVT). These theorems play a crucial role in the development of theoretical and practical results in mathematics,…

We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…

For regular and nonregular (singular) semilinear differential-algebraic equations (DAEs), we prove theorems on the existence and uniqueness of global solutions and on the blow-up of solutions, which allow one to identify the sets of initial…

{We explore a simple {\it geometric model} for functions between spaces of the same dimension (in infinite dimensions, we require that Jacobians be Fredholm operators of index zero). The model combines standard results in analysis and…

Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…

We present a maximal class of analytic functions, elements of which are in one-to-one correspondence with their asymptotic expansions. In recent decades it has been realized (B. Malgrange, J. Ecalle, J.-P. Ramis, Y. Sibuya et al.), that the…

The \emph{Noetherian class} is a wide class of functions defined in terms of polynomial partial differential equations. It includes functions appearing naturally in various branches of mathematics (exponential, elliptic, modular, etc.). A…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

Let $\{f_{\lambda; j}\}_{\lambda\in V; 1\le j\le k}$ be families of holomorphic functions in the open unit disk $\Di\subset\Co$ depending holomorphically on a parameter $\lambda\in V\subset \Co^n$. We establish a Rolle type theorem for the…

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius…