• Nonlinear Functional Analysis and Applications
• /
• v.28 no.3
• /
• pp.813-830
• /
• 2023

Let p(z) be a polynomial of degree n having no zero in |z| < 1. In this paper, by involving some coefficients of the polynomial, we prove an inequality that not only improves as well as generalizes the well-known result proved by Rivlin but also has some interesting consequences.

• Nuclear Engineering and Technology
• /
• v.31 no.3
• /
• pp.303-313
• /
• 1999

Various interpolation methods have been compared for reconstruction of LMR pin power distributions in hexagonal geometry. Interpolation functions are derived for several combinations of nodal quantities and various sets of basis functions, and tested against fine mesh calculations. The test results indicate that the interpolation functions based on the sixth degree polynomial are quite accurate, yielding maximum interpolation errors in power densities less than 0.5%, and maximum reconstruction errors less than 2% for driver assemblies and less than 4% for blanket assemblies. The main contribution to the total reconstruction error is made tv the nodal solution errors and the comer point flux errors. For the polynomial interpolations, the basis monomial set needs to be selected such that the highest powers of x and y are as close as possible. It is also found that polynomials higher than the seventh degree are not adequate because of the oscillatory behavior.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.659-675
• /
• 2023

Let K be an algebraically closed field of characteristic 0 and let f be a non-fibered planar quadratic polynomial map of topological degree 2 defined over K. We assume further that the meromorphic extension of f on the projective plane has the unique indeterminacy point. We define the critical pod of f where f sends a critical point to another critical point. By observing the behavior of f at the critical pod, we can determine a good conjugate of f which shows its statue in GIT sense.

• Journal of information and communication convergence engineering
• /
• v.16 no.3
• /
• pp.166-172
• /
• 2018

A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

• Animal Bioscience
• /
• v.37 no.8
• /
• pp.1333-1344
• /
• 2024

Objective: Litter size and piglet loss at birth significantly impact piglet production and are closely associated with sow parity. Understanding how these traits vary across different parities is crucial for effective herd management. This study investigates the patterns of the number of born alive piglets (NBA), number of piglet losses (NPL), and the proportion of piglet losses (PPL) at birth in Landrace sows under tropical conditions. Additionally, it aims to identify the most suitable model for describing these patterns. Methods: A dataset comprising 2,322 consecutive reproductive records from 258 Landrace sows, spanning parities from 1 to 9, was analyzed. Modeling approaches including 2nd and 3rd degree polynomial models, the Wood gamma function, and a longitudinal model were applied at the individual level to predict NBA, NPL, and PPL. The choice of the best-fitting model was determined based on the lowest mean and standard deviation of the difference between predicted and actual values, Akaike information criterion (AIC), and Bayesian information criterion (BIC). Results: Sow parity significantly influenced NBA, NPL, and PPL (p<0.0001). NBA increased until the 4th parity and then declined. In contrast, NPL and PPL decreased until the 2nd parity and then steadily increased until the 8th parity. The 2nd and 3rd degree polynomials, and longitudinal models showed no significant differences in predicting NBA, NPL, and PPL (p>0.05). The 3rd degree polynomial model had the lowest prediction standard deviation and yielded the smallest AIC and BIC. Conclusion: The 3rd degree polynomial model offers the most suitable description of NBA, NPL, and PPL patterns. It holds promise for applications in genetic evaluations to enhance litter size and reduce piglet loss at birth in sows. These findings highlight the importance of accounting for sow parity effects in swine breeding programs, particularly in tropical conditions, to optimize piglet production and sow performance.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.155-167
• /
• 2007

A graph G is called to be a 2-degree integral subgraph of a q-tree if it is obtained by deleting an edge e from an integral subgraph that is contained in exactly q - 1 triangles. An added-vertex q-tree G with n vertices is obtained by taking two vertices u, v (u, v are not adjacent) in a q-trees T with n - 1 vertices such that their intersection of neighborhoods of u, v forms a complete graph $K_{q}$, and adding a new vertex x, new edges xu, xv, $xv_{1},\;xv_{2},\;{\cdots},\;xv_{q-4}$, where $\{v_{1},\;v_{2},\;{\cdots},\;v_{q-4}\}\;{\subseteq}\;K_{q}$. In this paper we prove that a graph G with minimum degree not equal to q - 3 and chromatic polynomial $$P(G;{\lambda})\;=\;{\lambda}({\lambda}-1)\;{\cdots}\;({\lambda}-q+2)({\lambda}-q+1)^{3}({\lambda}-q)^{n-q-2}$$ with $n\;{\geq}\;q+2$ has and only has 2-degree integral subgraph of q-tree with n vertices and added-vertex q-tree with n vertices.

• Journal of the Korean Mathematical Society
• /
• v.51 no.3
• /
• pp.443-462
• /
• 2014

Using a simple recurrence relation, we give a new method to compute the Jones polynomials of closed braids: we find a general expansion formula and a rational generating function for the Jones polynomials. The method is used to estimate the degree of the Jones polynomials for some families of braids and to obtain general qualitative results.

• Korean Journal of Mathematics
• /
• v.29 no.3
• /
• pp.631-638
• /
• 2021

In this paper, some sharp inequalities for ordinary derivative P'(z) and polar derivative D_αP(z) = nP(z) + (α - z)P'(z) are obtained by including some of the coefficients and modulus of each individual zero of a polynomial P(z) of degree n not vanishing in the region |z| > k, k ≥ 1. Our results also improve the bounds of Turán's and Aziz's inequalities.

• Journal of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.835-840
• /
• 2008

The main result of this paper shows that every reciprocal Littlewood polynomial, one with {-1, 1} coefficients, of odd degree at least 7 has at least five unimodular roots, and every reciprocal Little-wood polynomial of even degree at least 14 has at least four unimodular roots, thus improving the result of Mukunda. We also give a sketch of alternative proof of the well-known theorem characterizing Pisot numbers whose minimal polynomials are in $$A_N=\{[{X^d+ \sum\limits^{d-1}_{k=0} a_k\;X^k{\in} \mathbb{Z}[X]\;:\;a_k={\pm}N,\;0{\leqslant}k{\leqslant}d-1}\}$$ for positive integer $N{\geqslant}2$.

• Journal of the Korean Mathematical Society
• /
• v.57 no.5
• /
• pp.1119-1133
• /
• 2020

In this paper, we derive an upper bound for the distance from a point in the immediate basin of a root of a complex polynomial to the root itself. We establish that if z is a point in the immediate basin of a root α of a polynomial p of degree d ≥ 12, then ${\mid}z-{\alpha}{\mid}{\leq}{\frac{3}{\sqrt{d}}\(6{\sqrt{310}}/35\)^d{\mid}N_p(z)-z{\mid}$, where N_p is the Newton map induced by p. This bound leads to a new bound of the expected total number of iterations of Newton's method required to reach all roots of every polynomial p within a given precision, where p is normalized so that its roots are in the unit disk.