Related papers: Engineered complete intersections: slightly degene…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
Kontsevich's graphs from deformation quantisation allow encoding multi-vectors whose coefficients are differential-polynomial in components of Poisson brackets on finite-dimensional affine manifolds. The calculus of Kontsevich graphs can be…
We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…
We present a new continuation algorithm to find all nondegenerate real solutions to a system of polynomial equations. Unlike homotopy methods, it is not based on a deformation of the system; instead, it traces real curves connecting the…
We extend the known classification of threefolds of general type that are complete intersections to various classes of non-complete intersections, and find other classes of polarised varieties, including Calabi-Yau threefolds with canonical…
Many of the stochastic models used in inference of phylogenetic trees from biological sequence data have polynomial parameterization maps. The image of such a map --- the collection of joint distributions for a model --- forms the model…
In our recent work \cite{StojnicCSetam09,StojnicUpper10} we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved results related to performance of a…
We introduce a new approach to the study of a system of algebraic equations in the algebraic torus whose Newton polytopes have sufficiently general relative positions. Our method is based on the theory of Parshin's residues and tame symbols…
The finite-degree Zariski (Z-) closure is a classical algebraic object, that has found a key place in several applications of the polynomial method in combinatorics. In this work, we characterize the finite-degree Z-closures of a subclass…
We prove a formula for the multidegrees of a rational map defined by generalized monomials on a projective variety, in terms of integrals over an associated Newton region. This formula leads to an expression of the multidegrees as volumes…
We present a polynomial basis that exactly tridiagonalizes Teukolsky's radial equation for quasi-normal modes. These polynomials naturally emerge from the radial problem, and they are canonical in that they possess key features of classical…
This paper reviews Kunchenko's polynomials using as template matching method to recognize template in one-dimensional input signal. Kunchenko's polynomials method is compared with classical methods - cross-correlation and sum of squared…
We use generalized Chebyshev polynomials, associated with the root system $A_2$, to provide a new semi-iterative method for accelerating simple iterative methods for solving linear systems. We apply this semi-iterative method to the Jacobi…
We develop a general theory of Cartesian and non-Cartesian polynomials on products of complex spaces $\mathbb{C}^{n_1} \times \cdots \times \mathbb{C}^{n_k}$. We prove that, for any fixed degree $d \ge 2$, a (Zariski) generic polynomial is…
The Faber--Walsh polynomials are a direct generalization of the (classical) Faber polynomials from simply connected sets to sets with several simply connected components. In this paper we derive new properties of the Faber--Walsh…
We demonstrate that a system of bi-orthogonal polynomials and their associated functions corresponding to a regular semi-classical weight on the unit circle constitute a class of general classical solutions to the Garnier systems by…
What polynomial in the coefficients of a system of algebraic equations should be called its discriminant? We prove a package of facts that provide a possible answer. Let us call a system typical, if the homeomorphic type of its set of…
This survey discusses the classical Bernstein and Markov inequalities for the derivatives of polynomials, as well as some of their extensions to general sets.
We prove a sufficient condition for the Jacobian problem in the setting of real, complex and mixed polynomial mappings. This follows from the study of the bifurcation locus of a mapping subject to a new Newton non-degeneracy condition.
In this paper, we propose a sparse spectral-Galerkin approximation scheme for solving the second-order partial differential equations on an arbitrary tetrahedron. Generalized Koornwinder polynomials are introduced on the reference…