相关论文: An elementary proof of Takagi's theorem on the dif…

We give results on zeros of a polynomial of $\zeta(s),\zeta'(s),\ldots,\zeta^{(k)}(s)$. First, we give a zero free region and prove that there exist zeros corresponding to the trivial zeros of the Riemann zeta function. Next, we estimate…

We prove a factorization formula for the Taylor series coefficients of a zero of a polynomial as a function of the polynomial's coefficients. This result extends to more general functions which we call "complex-exponent polynomials". To…

This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…

We examine when the composition of two entire functions f and g is even, and extend some of our results to cyclic compositions in general. We prove some theorems for the cases when f or g is a polynomial. Two of the key theorems we use are…

Let $f_1,\dots,f_k\in\mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an integer $n<x$ such that the fractional parts $\|f_i(n)\|\ll x^{c/k}$ for all $1\le i\le k$ and for some constant…

We give a self-contained proof that the nullity of the Bezoutian matrix associated with a pair of polynomials $f$ and $g$ equals the number of their common zeros counting multiplicities.

In this paper, we study the uniqueness of the differential-difference polynomials of entire functions on $\mathbb{C}^{n}$. We prove the following result: Let $f(z)$ be a transcendental entire function on $\mathbb{C}^{n}$ of hyper-order less…

Let f be a function transcendental and meromorphic in the plane, and define g(z) by g(z) = f(z+1) - f(z). A number of results are proved concerning the existence of zeros of g(z) or g(z)/f(z), in terms of the growth and the poles of f.

Let p(z) be a complex polynomial of degree n. Let C be a circle containing its n-1 zeros, having its center in the centroid of these zeros. We prove that C must contain at least int((n-1):2) zeros of its derivative.

We prove some separation results for the roots of the generalized Fibonacci polynomials and their absolute values

S\'ark\"ozy proved that dense sets of integers contain two elements differing by a $k$th power. The bounds in quantitative versions of this theorem are rather weak compared to what is expected. We prove a version of S\'ark\"ozy's theorem…

In this paper, we give results that partially prove a conjecture which was discussed in our previous work (arXiv:1307.4991). More precisely, we prove that as $n\to \infty,$ the zeros of the polynomial$${}_{2}\text{F}_{1}\left[…

In this paper, we study the unicity of entire functions concerning their $q-$shifts and $k-$th derivatives and prove: Let $f(z)$ be a transcendental entire function of zero-order, and $g(z)$ define as in (1.1). Let $a(z), b(z)$ be two…

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

Let $T=\alpha_0 I + \alpha_1 D + ...+\alpha_n D^n$, where $D$ is the differentiation operator and $\alpha_0\not= 0$, and let $f$ be a square-free polynomial with large minimum root separation. We prove that the roots of $Tf$ are close to…

We give a short direct proof of Agler's factorization theorem that uses the abstract characterization of operator algebras. the key ingredient of this proof is an operator algebra factorization theorem. Our proof provides some additional…

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…

In this paper we give an elementary proof of the Fundamental Theorem of Algebra for polynomials over the rational tropical semi-ring. We prove that, tropically, the rational numbers are algebraically closed. We provide a simple algorithm…

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…