Related papers: Rolle models in the real and complex world
The probability content of a convex polyhedron with a multivariate normal distribution can be regarded as a real analytic function. We give a system of linear partial differential equations with polynomial coefficients for the function and…
In the paper we develop a general theory of solvability of linear inhomogeneous boundary-value problems for systems of first-order ordinary differential equations in spaces of smooth functions on a finite interval. This problems are set…
We consider ideals of minors of a matrix, ideals of minors of a symmetric matrix, and ideals of Pfaffians of an alternating matrix. Assuming these ideals are of generic height, we characterize the condition $G_{s}$ for these ideals in terms…
It is shown (Theorem A and its corollary) that if g is any nonconstant nonunivalent analytic function on a half-plane H and if D is either a half-plane or a smoothly bounded Jordan domain, then there is a function f on D for which f'(D)…
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…
An optimal first-order global regularity theory, in spaces of functions defined in terms of oscillations, is established for solutions to Dirichlet problems for the $p$-Laplace equation and system, with right-hand side in divergence form.…
[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…
By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…
It is proposed the algorithm that find a basis of the ideal and a basis of the space of all root functionals by using the extension operation for bounded root functionals, when the number of polynomials is equal to the number of variables,…
Given a set of inequalities determined by homogeneous forms, the following intertwined results are established: (1) the volume of the real semi-algebraic domain determined by these inequalities is explicitly determined; it is shown to be…
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…
This article offers a comprehensive treatment of polynomial functional regression, culminating in the establishment of a novel finite sample bound. This bound encompasses various aspects, including general smoothness conditions, capacity…
Let n,d be positive integers, with d even (say d=2e). Let X_(n,d) denote the locus of degree d hypersurfaces in P^n which consist of two e-fold hyperplanes. We bound the regularity of the ideal of this variety. Moreover, we show that this…
A differential module is a module equipped with a square-zero endomorphism. This structure underpins complexes of modules over rings, as well as differential graded modules over graded rings. We establish lower bounds on the class--a…
Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…
We give a Descartes'-like bound on the number of positive solutions to a system of fewnomials that holds when its exponent vectors are not in convex position and a sign condition is satisfied. This was discovered while developing algorithms…
Cover's function counting theorem is a milestone in the theory of artificial neural networks. It provides an answer to the fundamental question of determining how many binary assignments (dichotomies) of $p$ points in $n$ dimensions can be…
Birkhoff's variety theorem, a fundamental theorem of universal algebra, asserts that a subclass of a given algebra is definable by equations if and only if it satisfies specific closure properties. In a generalized version of this theorem,…
We consider elliptic problems with nonclassical boundary conditions that contain additional unknown functions on the border of the domain of the elliptic equation and also contain boundary operators of higher orders with respect to the…