English
Related papers

Related papers: Interpolation Polynomials and Linear Algebra

200 papers

In this paper, we will give suitable conditions on differential polynomials $Q(f)$ such that they take every finite non-zero value infinitely often, where $f$ is a meromorphic function in complex plane. These results are related to Problem…

Complex Variables · Mathematics 2020-03-20 Ta Thi Hoai An , Nguyen Viet Phuong

Let $q$ be a power of a prime $p$, let $\mathbb F_q$ be the finite field with $q$ elements and, for each nonconstant polynomial $F\in \mathbb F_{q}[X]$ and each integer $n\ge 1$, let $s_F(n)$ be the degree of the splitting field (over…

Number Theory · Mathematics 2025-08-13 Lucas Reis

It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties similar to the Riemann {\zeta} function. The construction was generalized by Matsui et al. to a larger family of reflexive polytopes coming from…

Combinatorics · Mathematics 2018-04-20 Akihiro Higashitani , Mario Kummer , Mateusz Michałek

In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…

Numerical Analysis · Mathematics 2019-10-23 Maha Youssef , Gerd Baumann

This paper considers the extension of classical Lagrange interpolation in one real or complex variable to "polynomials of one quaternionic variable". To do this we develop some aspects of the theory of such polynomials. We then give a…

Classical Analysis and ODEs · Mathematics 2020-10-06 Shayne Waldron

This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…

General Mathematics · Mathematics 2020-10-02 Christopher Thron , Jordan T. Barry

Let P(z) and Q(y) be polynomials of the same degree k>=1 in the complex variables z and y, respectively. In this extended abstract we study the non-linear functional equation P(z)=Q(y(z)), where y(z) is restricted to be analytic in a…

Complex Variables · Mathematics 2007-06-13 Manuel Lladser

We establish a ring isomorphism between the derived Hall algebra of the Jordan quiver and the ring of double symmetric functions (i.e., the ring of symmetric polynomials in two sets of countably many variables, invariant under the…

Quantum Algebra · Mathematics 2026-01-21 Jiayi Chen , Ming Lu , Shiquan Ruan

We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…

Algebraic Geometry · Mathematics 2025-10-20 H. Hakopian , M. Tonoyan

Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…

History and Overview · Mathematics 2015-04-23 Piotr Błaszczyk

Let $A \in Z^{m \times n}$, $rank(A) = n$, $b \in Z^m$, and $P$ be an $n$-dimensional polyhedron, induced by the system $A x \leq b$. It is a known fact that if $F$ is a $k$-face of $P$, then there exist at least $n-k$ linearly independent…

Discrete Mathematics · Computer Science 2022-11-09 D. V. Gribanov , D. S. Malyshev , I. A. Shumilov

We consider a wide class of semi linear Hamiltonian partial differential equa- tions and their approximation by time splitting methods. We assume that the nonlinearity is polynomial, and that the numerical tra jectory remains at least uni-…

Numerical Analysis · Mathematics 2009-12-16 Erwan Faou , Benoit Grebert

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

Commutative Algebra · Mathematics 2016-01-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

Let X be a countably infinite set of real numbers and let Y_x, x \in X, be an independent family of stationary random subsets of the real numbers, e.g. homogeneous Poisson point processes. We give criteria for the a.s. existence of various…

Probability · Mathematics 2011-05-17 Martin P. W. Zerner

Let $\mathcal{G}=[A & M N & B]$ be a generalized matrix algebra defined by the Morita context $(A, B,_AM_B,_BN_A, \Phi_{MN}, \Psi_{NM})$. In this article we mainly study the question of whether there exist proper Jordan derivations for the…

Rings and Algebras · Mathematics 2012-02-14 Yanbo Li , Leon van Wyk , Feng Wei

In this work, we introduce the new class of functions which can use to solve the nonlinear/linear multi-dimensional differential equations. Based on these functions, a numerical method is provided which is called the Developed Lagrange…

Numerical Analysis · Mathematics 2019-04-30 Mehdi Delkhosh , Kourosh Parand , Amir H. Hadian-Rasanan

We consider finite-dimensional complex Lie algebras. We generalize the concept of Lie derivations via certain complex parameters and obtain various Lie and Jordan operator algebras as well as two one-parametric sets of linear operators.…

Mathematical Physics · Physics 2008-03-19 Petr Novotný , Jiří Hrivnák

Let $(A,\mathfrak{m})$ be an analytically un-ramified Noetherian local ring of dimension $d \geq 1$, $I$ a regular $\mathfrak{m}$-primary ideal of $A$ and let $\overline{I}$ be integral closure ideal of $I$. If $A$ is of characteristic $p >…

Commutative Algebra · Mathematics 2026-04-07 Tony J. Puthenpurakal , Samarendra Sahoo

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

Symbolic Computation · Computer Science 2020-09-03 Jean-Charles Faugère , George Labahn , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

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