English
Related papers

Related papers: Real Zero Polynomials and A. Horn's Problem

200 papers

This paper is devoted to the construction of polynomial 2-surfaces which possess a polynomial area element. In particular we study these surfaces in the Euclidean space $\mathbb R^3$ (where they are equivalent to the PN surfaces) and in the…

Graphics · Computer Science 2016-09-20 Michal Bizzarri , Miroslav Lávička , Zbyňek Šír , Jan Vršek

Addressing a problem posed by W. Li and A. Wei (2009), we investigate the average number of (complex) zeros of a random harmonic polynomial $p(z) + \overline{q(z)}$ sampled from the Kac ensemble, i.e., where the coefficients are independent…

Complex Variables · Mathematics 2023-08-22 Erik Lundberg , Andrew Thomack

In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In…

Symbolic Computation · Computer Science 2008-09-10 Yong Feng , Jingzhong Zhang , Xiaolin Qin , Xun Yuan

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

Rings and Algebras · Mathematics 2009-12-08 Marla Slusky

In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…

Symbolic Computation · Computer Science 2019-01-01 Jin-San Cheng , Xiaojie Dou , Junyi Wen

We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…

Functional Analysis · Mathematics 2020-01-28 Pintu Bhunia , Santanu Bag , Raj Kumar Nayak , Kallol Paul

The paper deals with two fundamental types of trigonometric polynomials and splines on uniform grids, which allow us to construct interpolation approximations that depend linearly on the values of the interpolated function. Fundamental on…

Numerical Analysis · Mathematics 2019-12-05 V. P. Denysiuk

An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on a key observation that quadratic polynomial inequalities…

Logic in Computer Science · Computer Science 2016-11-14 Ting Gan , Liyun Dai , Bican Xia , Naijun Zhan , Deepak Kapur , Mingshuai Chen

A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…

Classical Analysis and ODEs · Mathematics 2026-02-25 K. Castillo , G. Gordillo-Núñez

Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…

Computational Physics · Physics 2007-05-23 C. Semay

We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

Numerical Analysis · Mathematics 2014-10-02 Peter Bürgisser , Felipe Cucker

The eigenvalues of a self-adjoint nxn matrix A can be put into a decreasing sequence $\lambda=(\lambda_1,...,\lambda_n)$, with repetitions according to multiplicity, and the diagonal of A is a point of $R^n$ that bears some relation to…

Operator Algebras · Mathematics 2007-05-23 William Arveson , Richard V. Kadison

Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…

Data Structures and Algorithms · Computer Science 2023-03-20 Pasin Manurangsi , Erel Segal-Halevi , Warut Suksompong

Let $f(x)$ and $g(x)$ be two real polynomials whose leading coefficients have the same sign. Suppose that $f(x)$ and $g(x)$ have only real zeros and that $g$ interlaces $f$ or $g$ alternates left of $f$. We show that if $ad\ge bc$ then the…

Combinatorics · Mathematics 2007-05-23 Yi Wang , Y. -N. Yeh

In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…

Discrete Mathematics · Computer Science 2024-08-14 Khaled Elbassioni

Some properties and relations satisfied by the polynomial solutions of the bispectral problem are studied. Given a differential operator, under certain restrictions its polynomial eigenfunctions are explicitly obtained, as well as the…

Spectral Theory · Mathematics 2021-11-30 D. Barrios Rolanía

In this article, we prove the following interpolation problem: if the composition of a function and a regular map between affine varieties is a regular function, then there exists a global regular function of the target variety that…

Algebraic Geometry · Mathematics 2023-02-20 Nilkantha Das

In this work, we introduce a method based on piecewise polynomial interpolation to enclose rigorously solutions of nonlinear ODEs. Using a technique which we call a priori bootstrap, we transform the problem of solving the ODE into one of…

Dynamical Systems · Mathematics 2017-04-12 Maxime Breden , Jean-Philippe Lessard

We identify a class of remarkable algebraic relations satisfied by the zeros of the Krall orthogonal polynomials that are eigenfunctions of linear differential operators of order higher than two. Given an orthogonal polynomial family…

Classical Analysis and ODEs · Mathematics 2017-01-23 Oksana Bihun

It is proven that if an interpolation map between two wavelet sets preserves the union of the sets, then the pair must be an interpolation pair. We also construct an example of a pair of wavelet sets for which the congruence domains of the…

Functional Analysis · Mathematics 2007-10-30 Xiaofei Zhang , David R. Larson
‹ Prev 1 4 5 6 7 8 10 Next ›