English
Related papers

Related papers: Weierstrass method for quaternionic polynomial roo…

200 papers

The satisfactory development of Quaternionic Analysis has indicated new solutions for physical and mathematical problems. It is worth mentioning the fact that quaternions possess four dimensions, and in this way they may be considered as…

Mathematical Physics · Physics 2015-08-25 J. Marão

A zero-finding technique for solving nonlinear equations more efficiently than they usually are with traditional iterative methods in which the order of convergence is improved is presented. The key idea in deriving this procedure is to…

Numerical Analysis · Mathematics 2011-06-07 Miquel Grau-Sánchez , José Luis Díaz-Barrero

In this work, a new approach has been developed to obtain numerical solution of linear Volterra type integral equations by obtaining asymptotic approximation to solutions. Using the classical Bernoulli polynomials, a set of orthonormal…

Numerical Analysis · Mathematics 2020-07-22 Udaya Pratap Singh

Asymptotic approximations for the continuous Hahn polynomials and their zeros as the degree grows to infinity are established via their three-term recurrence relation. The methods are based on the uniform asymptotic expansions for…

Classical Analysis and ODEs · Mathematics 2022-08-16 Li-Hua Cao , Yu-Tian Li , Yu Lin

The roots of -1 in the set of biquaternions (quaternions with complex components, or complex numbers with quaternion real and imaginary parts) are studied and it is shown that there is an infinite number of non-trivial complexified…

Rings and Algebras · Mathematics 2007-05-23 Stephen J. Sangwine

We study certain polynomial trace identities in the group $SL(2,\IC)$ and their application in the theory of discrete groups. We obtain canonical representations for two generator groups in \S 4 and then in \S 5 we give a new proof for…

Geometric Topology · Mathematics 2019-11-27 T. H. Marshall , G. J. Martin

We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases.…

Data Structures and Algorithms · Computer Science 2018-08-07 Heng Guo , Chao Liao , Pinyan Lu , Chihao Zhang

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero…

Rings and Algebras · Mathematics 2026-05-08 Hristina Radak , Christian Scheunert , Frank H. P. Fitzek

We present a branch-consistent framework for integrals involving quadratic radicals by expressing exponentials of principal inverse trigonometric functions in algebraic form. Two identities for $e^{\pm i\cos^{-1}(y)}$ and $e^{\pm…

General Mathematics · Mathematics 2026-05-26 Emmanuel Antonio José García

We study matrix forms of quaternionic versions of the Fourier Transform and Convolution operations. Quaternions offer a powerful representation unit, however they are related to difficulties in their use that stem foremost from…

Computer Vision and Pattern Recognition · Computer Science 2024-07-23 Giorgos Sfikas , George Retsinas

Following a systematic analysis of existing results, we investigate when complete interlacing between the zeros of distinct polynomial sequences, $\{\mathcal{P}_n\}$ and $\{\mathcal{G}_n\}$ can be achieved by using a naturally arising extra…

Classical Analysis and ODEs · Mathematics 2026-04-07 Kerstin Jordaan , Vikash Kumar

We present some properties of the Weierstrass $\wp$-function associated to the hexagonal (or triangular) lattice. In particular, with the help of an old theorem of I.N. Baker \cite{B} on the characterization of meromorphic solutions of the…

Complex Variables · Mathematics 2021-05-11 Vassilis G. Papanicolaou

We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial.…

General Mathematics · Mathematics 2021-09-01 Rajeev Kumar

Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.

Number Theory · Mathematics 2024-05-08 V. Vinay Kumaraswamy

Weingarten calculus is a completely general and explicit method to compute the moments of the Haar measure on compact subgroups of matrix algebras. Particular cases of this calculus were initiated by theoretical physicists -- including…

Combinatorics · Mathematics 2019-02-27 Benoît Collins , Sho Matsumoto

Herein we shall consider Lorentz boosts and Wigner rotations from a (complexified) quaternionic point of view. We shall demonstrate that for a suitably defined self-adjoint complex quaternionic 4-velocity, pure Lorentz boosts can be phrased…

General Relativity and Quantum Cosmology · Physics 2021-01-18 Thomas Berry , Matt Visser

We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…

Commutative Algebra · Mathematics 2023-09-19 Matvey Borodin , Ethan Liu , Justin Zhang

In the late nineteenth century, Felix Klein revived the problem of solving the quintic equation from the moribund state into which Galois had placed it. Klein's approach was a mix of algebra and geometry built on the structure of the…

Dynamical Systems · Mathematics 2020-06-16 Scott Crass

By the celebrated Weierstrass Theorem the set of algebraic polynomials is dense in the space of continuous functions on a compact set in R^d. In this paper we study the following question: does the density hold if we approximate only by…

Classical Analysis and ODEs · Mathematics 2007-05-23 David Benko , Andras Kroo

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