• Title/Summary/Keyword: Structure of polynomials

Search Result 107, Processing Time 0.028 seconds

SOME UMBRAL CHARACTERISTICS OF THE ACTUARIAL POLYNOMIALS

  • Kim, Eun Woo;Jang, Yu Seon
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.29 no.1
    • /
    • pp.73-82
    • /
    • 2016
  • The utility of exponential generating functions is that they are relevant for combinatorial problems involving sets and subsets. Sequences of polynomials play a fundamental role in applied mathematics, such sequences can be described using the exponential generating functions. The actuarial polynomials ${\alpha}^{({\beta})}_n(x)$, n = 0, 1, 2, ${\cdots}$, which was suggested by Toscano, have the following exponential generating function: $${\limits\sum^{\infty}_{n=0}}{\frac{{\alpha}^{({\beta})}_n(x)}{n!}}t^n={\exp}({\beta}t+x(1-e^t))$$. A linear functional on polynomial space can be identified with a formal power series. The set of formal power series is usually given the structure of an algebra under formal addition and multiplication. This algebra structure, the additive part of which agree with the vector space structure on the space of linear functionals, which is transferred from the space of the linear functionals. The algebra so obtained is called the umbral algebra, and the umbral calculus is the study of this algebra. In this paper, we investigate some umbral representations in the actuarial polynomials.

A NOTE ON ENSTRÖM-KAKEYA THEOREM FOR QUATERNIONIC POLYNOMIALS

  • Hussain, Adil
    • Korean Journal of Mathematics
    • /
    • v.30 no.3
    • /
    • pp.503-512
    • /
    • 2022
  • In this paper, we are concerned with the problem of locating the zeros of regular polynomials of a quaternionic variable with quaternionic coefficients. We derive new bounds of Eneström-Kakeya type for the zeros of these polynomials by virtue of a maximum modulus theorem and the structure of the zero sets in the newly developed theory of regular functions and polynomials of a quaternionic variable. Our results generalize some recently proved results about the distribution of zeros of a quaternionic polynomial.

Mathematical Structures of Polynomials in Jeong Yag-yong's Gugo Wonlyu (정약용(丁若鏞)의 산서(算書) 구고원류(勾股源流)의 다항식(多項式)의 수학적(數學的) 구조(構造))

  • Hong, Sung Sa;Hong, Young Hee;Lee, Seung On
    • Journal for History of Mathematics
    • /
    • v.29 no.5
    • /
    • pp.257-266
    • /
    • 2016
  • This paper is a sequel to our paper [3]. Although polynomials in the tianyuanshu induce perfectly the algebraic structure of polynomials, the tianyuan(天元) is always chosen by a specific unknown in a given problem, it can't carry out the role of the indeterminate in ordinary polynomials. Further, taking the indeterminate as a variable, one can study mathematical structures of polynomials via those of polynomial functions. Thus the theory of polynomials in East Asian mathematics could not be completely materialized. In the previous paper [3], we show that Jeong Yag-yong disclosed in his Gugo Wonlyu(勾股源流) the mathematical structures of Pythagorean polynomials, namely polynomials p(a, b, c) where a, b, c are the three sides gou(勾), gu(股), xian(弦) of a right triangle, respectively. In this paper, we show that Jeong obtained his results through his recognizing Pythagorean polynomials as polynomial functions of three variables a, b, c.

A NEW CLASS OF CYCLIC CODES USING ORDERED POWER PRODUCT OF POLYNOMIALS

  • Gaur, Ankita;Sharma, Bhudev
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.3_4
    • /
    • pp.529-537
    • /
    • 2014
  • The paper introduces a new product of polynomials defined over a field. It is a generalization of the ordinary product with inner polynomial getting non-overlapping segments obtained by multiplying with coefficients and variable with expanding powers. It has been called 'Ordered Power Product' (OPP). Considering two rings of polynomials $R_m[x]=F[x]modulox^m-1$ and $R_n[x]=F[x]modulox^n-1$, over a field F, the paper then considers the newly introduced product of the two polynomial rings. Properties and algebraic structure of the product of two rings of polynomials are studied and it is shown to be a ring. Using the new type of product of polynomials, we define a new product of two cyclic codes and devise a method of getting a cyclic code from the 'ordered power product' of two cyclic codes. Conditions for the OPP of the generators polynomials of component codes, giving a cyclic code are examined. It is shown that OPP cyclic code so obtained is more efficient than the one that can be obtained by Kronecker type of product of the same component codes.

RESULTANT AND DISCRIMINANT OF ITERATE POLYNOMIALS

  • Choi, Eun-Mi
    • Honam Mathematical Journal
    • /
    • v.32 no.3
    • /
    • pp.493-514
    • /
    • 2010
  • The resultant and discriminant of composite polynomials were studied by McKay and Wang using some algebraic properties. In this paper we study the resultant and discriminant of iterate polynomials. We shall use elementary computations of matrices and block matrix determinants; this could provide not only the values but also the visual structure of resultant and discriminant from elementary matrix calculation.

A New Aspect of Comrade Matrices by Reachability Matrices

  • Solary, Maryam Shams
    • Kyungpook Mathematical Journal
    • /
    • v.59 no.3
    • /
    • pp.505-513
    • /
    • 2019
  • In this paper, we study orthanogonal polynomials by looking at their comrade matrices and reachability matrices. First, we focus on the algebraic structure that is exhibited by comrade matrices. Then, we explain some properties of this algebraic structure which helps us to find a connection between comrade matrices and reachability matrices. In the last section, we use this connection to determine the determinant, eigenvalues, and eigenvectors of these matrices. Finally, we derive a factorization for det R(A, x), where R(A, x) is the reachability matrix for a comrade matrix A and x is a vector of indeterminates.

Approximate Optimization Based on Meta-model for Weight Minimization Design of Ocean Automatic Salt Collector (해양자동채염기의 최소중량설계를 위한 메타모델 기반 근사최적화)

  • Song, Chang Yong
    • Journal of Convergence for Information Technology
    • /
    • v.11 no.1
    • /
    • pp.109-117
    • /
    • 2021
  • In this paper, the meta-model based approximate optimization was carried out for the structure design of an ocean automatic salt collector in order to minimize the structure weight. The structural analysis was performed by using the finite element method to evaluate the strength performance of the ocean automatic salt collector in its initial design. In the structural analysis, it was evaluated the strength performance of the design load conditions. The optimum design problem was formulated so that design variables of main structure thickness would be determined by minimizing the structure weight subject to strength performance constraints. The meta-models used in the approximate optimization were the response surface method, Kriging model, and Chebyshev orthogonal polynomials. Regarding to the numerical characteristics, the solution results from approximate optimization techniques were compared to the results of non-approximate optimization. The Chebyshev orthogonal polynomials among the meta-models used in the approximate optimization showed the most appropriate optimum design results for the structure design of the ocean automatic salt collector.

Hong JeongHa's Tianyuanshu and Zhengcheng Kaifangfa (홍정하(洪正夏)의 천원술(天元術)과 증승개방법(增乘開方法))

  • Hong, Sung Sa;Hong, Young Hee;Kim, Young Wook
    • Journal for History of Mathematics
    • /
    • v.27 no.3
    • /
    • pp.155-164
    • /
    • 2014
  • Tianyuanshu and Zengcheng Kaifangfa introduced in the Song-Yuan dynasties and their contribution to the theory of equations are one of the most important achievements in the history of Chinese mathematics. Furthermore, they became the most fundamental subject in the history of East Asian mathematics as well. The operations, or the mathematical structure of polynomials have been overlooked by traditional mathematics books. Investigation of GuIlJib (九一集) of Joseon mathematician Hong JeongHa reveals that Hong's approach to polynomials is highly structural. For the expansion of $\prod_{k=11}^{n}(x+a_k)$, Hong invented a new method which we name Hong JeongHa's synthetic expansion. Using this, he reveals that the processes in Zhengcheng Kaifangfa is not synthetic division but synthetic expansion.

Efficient DFDC Filter Design Using Interpolated Fourth-Order Polynomials (IFOP를 사용한 효과적인 DFDC 필터 설계)

  • 양세정;장영범
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6C
    • /
    • pp.609-614
    • /
    • 2003
  • In this paper, a new filter structure to improve frequency response characteristics in CIC(Cascaded Integrator-Comb) decimation filters is proposed. Conventional filters improve passband characteristics, but they make worse aliasing band characteristics. In this paper, we propose a new filter which is called IFOP(Interpolated Fourth-Order Polynomials). By using this proposed filter, passband droop and aliasing band attenuation are simultaneously improved. Since proposed filter needs only one multiplication, computation is not much. And overall linear phase characteristics are maintained since the proposed filter is also linear phase. Finally, implementation cost of the proposed filter is compared with those of conventional filters.