Related papers: Engineered complete intersections: slightly degene…
In this paper we investigate the intrinsic sequential time complexity of universal elimination procedures for arbitrary continuous data structures encoding input and output objects of elimination theory (i.e. polynomial equation systems)…
Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with better parameters than explicit constructions do. But the probabilistic…
We introduce a generalized bootstrap technique for estimators obtained by solving estimating equations. Some special cases of this generalized bootstrap are the classical bootstrap of Efron, the delete-d jackknife and variations of the…
This paper concerns developing a numerical method of the Newton type to solve systems of nonlinear equations described by nonsmooth continuous functions. We propose and justify a new generalized Newton algorithm based on graphical…
We generalize the Bernstein-Walsh-Siciak theorem on polynomial approximation in $\mathbb{C}^n$ to the case where the polynomial ring $\mathcal{P}(\mathbb{C}^n)$ is replaced by a subring $\mathcal{P}^S(\mathbb{C}^n)$ consisting of all…
We increase the scope of previous work on change of basis between finite bases of polynomials by defining ascending and descending bases and introducing three techniques for defining them from known ones. The minimum degrees of polynomials…
The Bohigas--Giannoni--Schmit conjecture stating that the statistical spectral properties of systems which are chaotic in their classical limit coincide with random matrix theory is proved. For this purpose a new semiclassical field theory…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
In this work, we discuss generalizations of the classical Bernstein and Markov type inequalities for polynomials and we present some new inequalities for the $k$th Fr\'echet derivative of homogeneous polynomials on real and complex…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
A matrix polynomial is a polynomial in a complex variable $\lambda$ with coefficients in $n \times n$ complex matrices. The spectral curve of a matrix polynomial $P(\lambda)$ is the curve $\{ (\lambda, \mu) \in \mathbb{C}^2 \mid…
We consider positive solutions to parametrized systems of generalized polynomial equations (with real exponents and positive parameters). By a fundamental result obtained in parallel work, polynomial systems are determined by geometric…
In this paper we research global dynamics and bifurcations of planar piecewise smooth quadratic quasi--homogeneous but non-homogeneous polynomial differential systems. We present sufficient and necessary conditions for the existence of a…
We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…
In this paper, we treat $\mathscr{D}$-modules on the basic affine space $G/U$ and their global sections for a semisimple complex algebraic group $G$. Our aim is to prepare basic results about large non-irreducible modules for the branching…
The goal of this article is to provide an explicit algorithmic construction of formal $F$-manifold structures, formal Frobenius manifold structures, and higher residue pairings on the primitive middle-dimensional cohomology $\mathbb{H}$ of…
This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…
Hamiltonian systems with a mixed phase space typically exhibit an algebraic decay of correlations and of Poincare' recurrences, with numerical experiments over finite times showing system-dependent power-law exponents. We conjecture the…
In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…
The degeneracy of central configurations in the planar $N$-body problem makes their enumeration problem hard and the related dynamics appealing. To truly understand the bifurcations of central configurations, we should work in the FULL…