English
Related papers

Related papers: Polynomial interpolation over quaternions

200 papers

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

Rings and Algebras · Mathematics 2025-01-07 Alina G. Goutor

This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…

Algebraic Geometry · Mathematics 2011-11-30 Yongbi Li

We study conditions on polynomials such that the ideal generated by their orbits under the symmetric group action becomes a monomial ideal or has a monomial radical. If the polynomials are homogeneous, we expect that such an ideal has a…

Commutative Algebra · Mathematics 2022-04-26 Andreas Kretschmer

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

Transformations in the field of computer graphics and geometry are one of the most important concepts for efficient manipulation and control of objects in 2-dimensional and 3-dimensional space. Transformations take many forms each with…

Computational Geometry · Computer Science 2023-03-24 Benjamin Kenwright

The Bohnenblust-Hille inequality and its variants have found applications in several areas of Mathematics and related fields. The control of the constants for the variant for complex $m$-homogeneous polynomials is of special interest for…

Functional Analysis · Mathematics 2019-10-08 Diana Marcela Serrano Rodríguez , Fernando Cabral Alves

By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…

Numerical Analysis · Mathematics 2007-05-23 Andrew J. Sommese , Jan Verschelde , Charles W. Wampler

Some variants of the numerical Picard iterations method are presented to solve an IVP for an ordinary differential system. The term numerical emphasizes that a numerical solution is computed. The method consists in replacing the right hand…

Numerical Analysis · Mathematics 2017-08-09 Ernest Scheiber

One deals with arbitrary reduced free divisors in a polynomial ring over a field of characteristic zero, by stressing the ideal theoretic and homological behavior of the corresponding singular locus. A particular emphasis is given to both…

Commutative Algebra · Mathematics 2012-07-26 Aron Simis , Stefan O. Tohaneanu

We study the convergence of the Laurent polynomials of Lagrange interpolation on the unit circle for continuous functions satisfying a condition about their modulus of continuity. The novelty of the result is that now the nodal systems are…

Classical Analysis and ODEs · Mathematics 2017-05-22 E. Berriochoa , A. Cachafeiro , J. M. García Amor

Polynomials in this paper are defined starting from a compact semisimple Lie group. A known classification of maximal, semisimple subgroups of simple Lie groups is used to select the cases to be considered here. A general method is…

Representation Theory · Mathematics 2011-07-20 Maryna Nesterenko , Jiri Patera , Marzena Szajewska , Agnieszka Tereszkiewicz

Multilinear interpolation is a powerful tool used in obtaining strong type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear…

Functional Analysis · Mathematics 2007-05-23 Loukas Grafakos , Terence Tao

We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial…

Classical Analysis and ODEs · Mathematics 2015-06-26 Alexei Borodin

We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit? We argue that this question is certainly difficult.…

Computational Complexity · Computer Science 2007-10-02 Pascal Koiran , Sylvain Perifel

The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…

Algebraic Geometry · Mathematics 2007-05-23 Arnaud Bodin , Mihai Tibar

This paper describes the passage of light through a system of waveplates mathematically in terms of quaternions, an extension of the complex numbers, instead of the more usual Jones vectors and Jones matrices. Both the light beam and the…

Signal Processing · Electrical Eng. & Systems 2026-03-27 Michael G. Taylor

Let R be a ring and let B be a commutative ring. Let p be a homogeneous multiplicative polynomial law of degree n from R to B. We show that p is essentially a determinant, in the sense that p is obtained from a determinant by left and right…

Rings and Algebras · Mathematics 2007-05-23 Francesco Vaccarino

The classical Hermite-Biehler theorem describes possible zero sets of complex linear combinations of two real polynomials whose zeros strictly interlace. We provide the full characterization of zero sets for the case when this interlacing…

Classical Analysis and ODEs · Mathematics 2023-02-15 Rostyslav Kozhan , Mikhail Tyaglov

This article is about polynomial maps with a certain symmetry and/or antisymmetry in their Jacobians, and whether the Jacobian Conjecture is satisfied for such maps, or whether it is sufficient to prove the Jacobian Conjecture for such…

Algebraic Geometry · Mathematics 2016-03-24 Michiel de Bondt

Let $K$ be a field and $I$ a monomial ideal of the polynomial ring $S=K[x_1,\ldots, x_n]$. We show that if either: 1) $I$ is almost complete intersection, 2) $I$ can be generated by less than four monomials; or 3) $I$ is the Stanley-Reisner…

Commutative Algebra · Mathematics 2013-12-16 Somayeh Bandari , Kamran Divaani-Aazar , Ali Soleyman Jahan