English
Related papers

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

200 papers

The method of constructing Hermite trigonometric polynomials, which interpolate the values of a certain periodic function and its derivatives up to (including ) the -th ( ) order in nodes of a uniform grid, is considered. The proposed…

Numerical Analysis · Mathematics 2019-02-13 V. P. Denysiuk

Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…

Computational Complexity · Computer Science 2017-12-27 Grzegorz Guśpiel

Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…

Algebraic Geometry · Mathematics 2007-05-23 Walter D. Neumann , Penelope G. Wightwick

We consider the problem of computing homogeneous coordinates of points in a zero-dimensional subscheme of a compact, complex toric variety $X$. Our starting point is a homogeneous ideal $I$ in the Cox ring of $X$, which in practice might…

Algebraic Geometry · Mathematics 2022-03-14 Matías R. Bender , Simon Telen

We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and $(1-o_n(1))\cdot 2^{n^2}$ monomials with non-zero coefficients. In contrast, we show…

Discrete Mathematics · Computer Science 2020-02-25 Gal Beniamini , Noam Nisan

We present certain existence criteria and parameterisations for an interpolation problem for completely positive maps that take given matrices from a finite set into prescribed matrices. Our approach uses density matrices associated to…

Operator Algebras · Mathematics 2013-09-03 Calin-Grigore Ambrozie , Aurelian Gheondea

We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…

Computational Geometry · Computer Science 2020-09-30 Boris Aronov , Esther Ezra , Micha Sharir

We present a new algorithm for solving the real roots of a bivariate polynomial system $\Sigma=\{f(x,y),g(x,y)\}$ with a finite number of solutions by using a zero-matching method. The method is based on a lower bound for bivariate…

Symbolic Computation · Computer Science 2010-01-19 Xiaolin Qin , Yong Feng , Jingwei Chen , Jingzhong Zhang

We consider three realization problems about monic real univariate polynomials without vanishing coefficients. Such a polynomial $P:=\sum_{j=0}^db_jx^j$ defines the sign pattern $\sigma (P):=({\rm sgn}(b_d)$, $\ldots$, ${\rm sgn}(b_0))$.…

Classical Analysis and ODEs · Mathematics 2026-01-16 Vladimir Petrov Kostov

In this paper, applied strictly monotonic increasing scaled maps, a kind of well-conditioned linear barycentric rational interpolations are proposed to approximate functions of singularities at the origin, such as $x^\alpha$ for $\alpha \in…

Numerical Analysis · Mathematics 2021-01-21 Desong Kong , Shuhuang Xiang

The interplay among the time-evolution of the coefficients and the zeros of a generic time-dependent (monic) polynomial provides a convenient tool to identify certain classes of solvable dynamical systems. Recently this tool has been…

Mathematical Physics · Physics 2019-09-04 Francesco Calogero , Farrin Payandeh

A probabilistic approach to the study of the number of zeros of complex harmonic polynomials was initiated by W. Li and A. Wei (2009), who derived a Kac-Rice type formula for the expected number of zeros of random harmonic polynomials with…

Complex Variables · Mathematics 2016-05-16 Antonio Lerario , Erik Lundberg

An $n\times n$ matrix is said to have a self-interlacing spectrum if its eigenvalues $\lambda_k$, $k=1,\ldots,n$, are distributed as follows $$ \lambda_1>-\lambda_2>\lambda_3>\cdots>(-1)^{n-1}\lambda_n>0. $$ A method for constructing sign…

Classical Analysis and ODEs · Mathematics 2025-07-01 Mikhail Tyaglov

We present a parallel algorithm for permanent mod 2^k of a matrix of univariate integer polynomials. It places the problem in ParityL subset of NC^2. This extends the techniques of [Valiant], [Braverman, Kulkarni, Roy] and [Bj\"orklund,…

Computational Complexity · Computer Science 2021-06-03 Samir Datta , Kishlaya Jaiswal

We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…

Classical Analysis and ODEs · Mathematics 2022-03-04 Askold Khovanskii , Sushil Singla , Aaron Tronsgard

We consider the explicit relation between two resolvent matrices related to the truncated Hausdorff matrix moment problem (THMM) in the case of an even and odd number of moments. This relation is described with the help of four families of…

Classical Analysis and ODEs · Mathematics 2023-02-28 Abdon E. Choque-Rivero , Monika Winklmeier

We introduce a new strategy in solving the truncated complex moment problem. To this aim we investigate recursive doubly indexed sequences and their characteristic polynomials. A characterization of recursive doubly indexed \emph{moment}…

Functional Analysis · Mathematics 2016-10-14 Kaissar Idrissi , El Hassan Zerouali

We characterize the relationship between the singular values of a complex Hermitian (resp., real symmetric, complex symmetric) matrix and the singular values of its off-diagonal block. We also characterize the eigenvalues of an Hermitian…

Algebraic Geometry · Mathematics 2007-05-23 Sergey Fomin , William Fulton , Chi-Kwong Li , Yiu-Tung Poon

This paper proposes a real moment-HSOS hierarchy for complex polynomial optimization problems with real coefficients. We show that this hierarchy provides the same sequence of lower bounds as the complex analogue, yet is much cheaper to…

Optimization and Control · Mathematics 2024-02-27 Jie Wang , Victor Magron

For a graph $H$, the $H$-recolouring problem $\operatorname{Recol}(H)$ asks, for two given homomorphisms from a given graph $G$ to $H$, if one can get between them by a sequence of homomorphisms of $G$ to $H$ in which consecutive…

Combinatorics · Mathematics 2024-03-06 Jae-baek Lee , Jonathan A. Noel , Mark Siggers