On Some Inequalities Concerning Rate of Growth of Polynomials

In this paper we consider a class of polynomials P(z) = a0+∑n v=t a v z v, t ≥ 1not vanishing in |z|k, k≥1 and investigate the dependence of max|z|=1|P(Rz)-P(rz)on max|z|=1|P(z)|, where 1 ≤ r R. Our result generalizes and refines some know polynomial inequalities.     

Sums of two polynomials with each having real zeros symmetric with the other

Consider the polynomial equation

零维多项式系统保持重数的零点分解

对零维多项式系统,基于经典的吴方法给出了一个保持重数的零点分解定理及其算法.在一定条件下,该算法计算出的分解是三角化的.     

On asymptotics of polynomial eigenfunctions for exactly solvable differential operators

In this paper we study the class of differential operators with polynomial coefficients Q_j in one complex variable satisfying the condition degQ_jj with equality for at least one j. We show that if degQ_k<k then the root with the largest modulus of the nth degree eigenpolynomial p_n of T tends to infinity when n→∞, as opposed to the case when degQ_k=k, which we have treated previously in [T. Bergkvist, H. RullgÅrd, On polynomial eigenfunctions for a class of differential operators, Math. Res. Lett. 9 (2002) 153–171]. Moreover, we present an explicit conjecture and partial results on the growth of the largest modulus of the roots of p_n. Based on this conjecture we deduce the algebraic equation satisfied by the Cauchy transform of the asymptotic root measure of the appropriately scaled eigenpolynomials, for which the union of all roots is conjecturally contained in a compact set.     

Shaping an antenna radiation diagram with discrete weights using the PSO algorithm and periodic and nest spaces

Using traditional methods, finding the weights that allow shaping a desired radiation diagram for an antenna in order to reject unwanted signals or maximize the desired signal reception, is possible.However, neither by iterative nor closed methods, can it be done while restricting the amplitudes and phases to a set of finite values for each of them. Also, it often happens that they cannot include in its formulation other types of specifications that are necessary to be achieved.Some modifications were implemented in the method Particle Swarm Optimization (PSO), which reduced the convergence time, especially in the search space of phases where there exists a periodicity that the original method does not take into account.PSO is an evolutionary algorithm, inspired by the social behavior of flocks of birds or fish, developed by Eberhart and Kennedy in 1995, and has been intensively applied in solving numerical Engineering problems.     

圆内零级亚纯函数的充满圆及应用

本文研究了圆内零级亚纯函数的充满圆序列,获得了在关于型函数的Borel点附近存在充满圆序列,从而得到了Hayman点的存在性.     

Factorizations of root-based polynomial compositions

Let denote the finite field of order q=p^r, p a prime and r a positive integer, and let f(x) and g(x) denote monic polynomials in of degrees m and n, respectively. Brawley and Carlitz (Discrete Math. 65 (1987) 115–139) introduce a general notion of root-based polynomial composition which they call the composed product and denote by fg. They prove that fg is irreducible over if and only if f and g are irreducible with gcd(m,n)=1. In this paper, we extend Brawley and Carlitz's work by examining polynomials which are composed products of irreducibles of non-coprime degrees. We give an upper bound on the number of distinct factors of fg, and we determine the possible degrees that the factors of fg can assume. We also determine when the bound on the number of factors of fg is met.     

POLYNoMIAL RECURRENCE FOR，LEVY PROCESSES

In this paper, the authors study the ω-transience and ω-recurrence for Levy processes with any weight function ω, give a relation between ω-recurrence and the last exit times. As a special case, the polynomial recurrence and polynomial transience are also studied.     

Kalman particle swarm optimized polynomials for data classification

Data classification is an important area of data mining. Several well known techniques such as decision tree, neural network, etc. are available for this task. In this paper we propose a Kalman particle swarm optimized (KPSO) polynomial equation for classification for several well known data sets. Our proposed method is derived from some of the findings of the valuable information like number of terms, number and combination of features in each term, degree of the polynomial equation etc. of our earlier work on data classification using polynomial neural network. The KPSO optimizes these polynomial equations with a faster convergence speed unlike PSO. The polynomial equation that gives the best performance is considered as the model for classification. Our simulation result shows that the proposed approach is able to give competitive classification accuracy compared to PNN in many datasets.     

不可约圈与路之并补图的色唯一性

讨论了形如ｋＣＲＵｒＰＲ的一类图的补图的色性．在一定的条件下证明了这类图是色唯一的．本文推广了文［１］的结果．     

一类融合逼近和插值的曲线细分

采用生成多项式为主的方法对一类融合逼近和插值三重细分格式的支撑区间、多项式生成、连续性、多项式再生及分形性质进行了分析,给出并证明了极限曲线C^k连续的充分条件.通过对融合型细分规则中参数变量的适当选择来实现对极限曲线的形状调整,从而衍生出具有良好性质的新格式,并将这类新格式与现有格式进行比较.数值实例表明这类新格式生成的极限曲线具有较好的保形性.     

Polynomial Hulls of Subsets of T 2

This paper investigates the polynomial convexity of subsets of the two-torus. Given a compact subset K of T 2 , we find regions in K which do not contribute to the polynomial hull of K inside the bidisc.     

A fitting algorithm for real coefficient polynomial rooting

A new algorithm for computing all roots of polynomials with real coefficients is introduced. The principle behind the new algorithm is a fitting of the convolution of two subsequences onto a given polynomial coefficient sequence. This concept is used in the initial stage of the algorithm for a recursive slicing of a given polynomial into degree-2 subpolynomials from which initial root estimates are computed in closed form. This concept is further used in a post-fitting stage where the initial root estimates are refined to high numerical accuracy. A reduction of absolute root errors by a factor of 100 compared to the famous Companion matrix eigenvalue method based on the unsymmetric QR algorithm is not uncommon. Detailed computer experiments validate our claims.