• Kyungpook Mathematical Journal
• /
• v.28 no.2
• /
• pp.185-196
• /
• 1988

We study existence of polynomial integrating factors and solutions F(x, y)=c of first order nonlinear differential equations. We characterize the homogeneous case, and give algorithms for finding existence of and a basis for polynomial solutions of linear difference and differential equations and rational solutions or linear differential equations with polynomial coefficients. We relate singularities to nature of the solution. Solution of differential equations in closed form to some degree might be called more an art than a science: The investigator can try a number of methods and for a number of classes of equations these methods always work. In particular integrating factors are tricky to find. An analogous but simpler situation exists for integrating inclosed form, where for instance there exists a criterion for when an exponential integral can be found in closed form. In this paper we make a beginning in several directions on these problems, for 2 variable ordinary differential equations. The case of exact differentials reduces immediately to quadrature. The next step is perhaps that of a polynomial integrating factor, our main study. Here we are able to provide necessary conditions based on related homogeneous equations which probably suffice to decide existence in most cases. As part of our investigations we provide complete algorithms for existence of and finding a basis for polynomial solutions of linear differential and difference equations with polynomial coefficients, also rational solutions for such differential equations. Our goal would be a method for decidability of whether any differential equation Mdx+Mdy=0 with polynomial M, N has algebraic solutions(or an undecidability proof). We reduce the question of all solutions algebraic to singularities but have not yet found a definite procedure to find their type. We begin with general results on the set of all polynomial solutions and integrating factors. Consider a differential equation Mdx+Ndy where M, N are nonreal polynomials in x, y with no common factor. When does there exist an integrating factor u which is (i) polynomial (ii) rational? In case (i) the solution F(x, y)=c will be a polynomial. We assume all functions here are complex analytic polynomial in some open set.

• 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.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2617-2620
• /
• 2003

This paper presents the construction algorithm of the irreducible polynomial which needs to multiply over GF(2$\^$m/) and the flow chart representing the proposed algorithm has been proposed. And also, we get the degree from the value of xm＋k formation to the value of k = 7 using the proposed flow chart. The multiplier circuit has been implemented by using the proposed irreducible polynomial generation(IPG) algorithm in this paper, and we compared the proposed circuit with the conventional one. In the case of k = 7, one AND gate and five Ex-or gates are needed as the delay time for the irreducible polynomial in the proposed algorithm, but seven AND gates and sever Ex-or gates in the conventional one. As a result, the proposed algorithm shows the improved performance on the delay time.

• 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.

• Journal of Environmental Impact Assessment
• /
• v.16 no.5
• /
• pp.341-350
• /
• 2007

Lake Youngrang is a lagoon whose effluent flows into the East Sea. Because two resort towns and two golf courses are situated at the lake basin, many tourists visit this area. Stormwater runoff surveys were carried out for the eight storm events from 2004 to 2005 in the eutrophic lake watershed to give a basic data for the diffuse pollution control of the lake. Dimensionless mass-volume curves indicating the distribution of pollutant mass vs. volume were used to analyze the first flush phenomenon. The mass-volume curves were fitted with a power function and polynomial equation curves. The regression analysis showed that the polynomial equation curves were better than the power function in representing the tendency of the first flush, and second degree polynomial equation curves indicated the strength of the first flush effectively.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.2
• /
• pp.277-283
• /
• 1992

Let GF(q) be a finite field with q elements where q=p$^{n}$ for a prime number p and a positive integer n. Consider an arbitrary function .phi. from GF(q) into GF(q). By using the Largrange's Interpolation formula for the given function .phi., .phi. can be represented by a polynomial which is congruent (mod x$^{q}$ -x) to a unique polynomial over GF(q) with the degree < q. In [3], Wells characterized all polynomial over a finite field which commute with translations. Mullen [2] generalized the characterization to linear polynomials over the finite fields, i.e., he characterized all polynomials f(x) over GF(q) for which deg(f) < q and f(bx+a)=b.f(x) + a for fixed elements a and b of GF(q) with a.neq.0. From those papers, a natural question (though difficult to answer to ask is: what are the explicit form of f(x) with zero terms\ulcorner In this paper we obtain the exact form (together with zero terms) of a polynomial f(x) over GF(q) for which satisfies deg(f) < p$^{2}$ and (1) f(x+a)=f(x)+c for the fixed nonzero elements a and c in GF(q).

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.141-148
• /
• 2022

Let p(z) be a polynomial of degree n having no zero in |z| < k, k ≤ 1, then Govil proved $$\max_{{\mid}z{\mid}=1}{\mid}p^{\prime}(z){\mid}{\leq}{\frac{n}{1+k^n}}\max_{{\mid}z{\mid}=1}{\mid}p(z){\mid}$$, provided |p'(z)| and |q'(z)| attain their maximal at the same point on the circle |z| = 1, where $$q(z)=z^n{\overline{p(\frac{1}{\overline{z}})}}$$. In this paper, we extend the above inequality to polar derivative of a polynomial. Further, we also prove an improved version of above inequality into polar derivative.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.6
• /
• pp.1491-1498
• /
• 2014

The major criticism of optimal experimental design is that it depends heavily on the model and its accompanying assumption that often leads the number of support points equal to the number of parameters in the model. Often in the past, a polynomial model of higher degree is assumed to handle the experimental design for the polynomial regression of lower degree. In this paper we searched the possible set of designs which are robust to the departure of the assumed model. The designs are categorized with respect to D-efficiency. The approach by O'Brien (1995) was discussed in univariate polynomial regression model setting.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.33-38
• /
• 2008

Biometric based authentication can provide strong security guarantee about the identity of users. However, security of biometric data is particularly important as compromise of the data will be permanent. Cancelable biometrics stores a non - invertible transformed version of the biometric data. Thus, even if the storage is compromised, the biometric data remains safe. Cancelable biometrics also provide a higher level of privacy by allowing many templates for the same biometric data and hence non-linkability of user's data stored in different databases. In this paper, we proposed the fast polynomial reconstruction algorithm for fuzzy fingerprint vault. The proposed method needs (k+1) real points to reconstruct the polynomial of degree (k-1). It enhances the speed, however, by $300{\sim}1500$ times according to the degree of polynomial compared with the exhaust search.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.2
• /
• pp.331-345
• /
• 2021

Let p(z)be a polynomial of degree n. Then Bernstein's inequality [12,18] is $${\max\limits_{{\mid}z{\mid}=1}}\;{\mid}p^{\prime}(z){\mid}\;{\leq}\;n\;{\max_{{\mid}z{\mid}=1}{\mid}(z){\mid}}$$. For q > 0, we denote $${\parallel}p{\parallel}_q=\{{\frac{1}{2{\pi}}}{\normalsize\displaystyle\smashmargin{2}{\int\nolimits_{0}}^{2{\pi}}}\;{\mid}p(e^{i{\theta}}){\mid}^qd{\theta}\}^{\frac{1}{q}}$$, and a well-known fact from analysis [17] gives $${{\lim_{q{\rightarrow}{{\infty}}}}\{{\frac{1}{2{\pi}}}{\normalsize\displaystyle\smashmargin{2}{\int\nolimits_{0}}^{2{\pi}}}\;{\mid}p(e^{i{\theta}}){\mid}^qd{\theta}\}^{\frac{1}{q}}={\max\limits_{{\mid}z{\mid}=1}}\;{\mid}p(z){\mid}$$. Above Bernstein's inequality was extended by Zygmund [19] into L^q norm by proving ║p'║_q ≤ n║p║_q, q ≥ 1. Let p(z) = a₀ + ∑ⁿ_𝜈=𝜇 a_𝜈z^𝜈, 1 ≤ 𝜇 ≤ n, be a polynomial of degree n having no zero in |z| < k, k ≥ 1. Then for 0 < r ≤ R ≤ k, Aziz and Zargar [4] proved $${\max\limits_{{\mid}z{\mid}=R}}\;{\mid}p^{\prime}(z){\mid}\;{\leq}\;{\frac{nR^{{\mu}-1}(R^{\mu}+k^{\mu})^{{\frac{n}{\mu}}-1}}{(r^{\mu}+k^{\mu})^{\frac{n}{\mu}}}\;{\max\limits_{{\mid}z{\mid}=r}}\;{\mid}p(z){\mid}}$$. In this paper, we obtain the L^q version of the above inequality for q > 0. Further, we extend a result of Aziz and Shah [3] into L^q analogue for q > 0. Our results not only extend some known polynomial inequalities, but also reduce to some interesting results as particular cases.