• Kyungpook Mathematical Journal
• /
• 제28권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
• /
• 제25권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 V
• /
• 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.

• 대한수학회지
• /
• 제57권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.

• 환경영향평가
• /
• 제16권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.

• 대한수학회보
• /
• 제29권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
• /
• 제27권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
• /
• 제25권6호
• /
• pp.1491-1498
• /
• 2014

최적실험의 제일 큰 약점은 실험기준이 지나치게 모형과 그에 수반되는 가정에 의존한다는 점이다. 이는 종종 모형의 모수의 개수와 받힘점의 개수가 일치를 하는 경우로 이루어지는데 이는 가정된 모형이 참이 아닌 경우를 대비한 실험이 될 수 없다. 이런 경우 문헌에서는 가정된 다항회귀모형의 차수보다 큰 차수를 가진 다항회귀모형을 가정하고 최적실험을 제안하나 이는 D-효율에 근거한 관행적인 방법일 뿐이다. 본 연구에서는 O'Brien (1995)이 제안한 가정된 모형의 일반적인 이탈을 염두에 둔 추가받힘점 생성에 관하여 알아보고 단순회귀모형과 2차 회귀모형에 대한 실험들을 D-효율로 카타로그화 하여 실험자로 하여금 선택을 할 수 있게 하였다. O'Brien은 비선형모형에 대해 추가받힘점의 선택 방법을 제시하였지만 방법을 구현하는 데 있어 명확치 않은 기준이 있어 모수에 의존하는 비선형모형에 대한 최적실험보다는 다항회귀모형을 중심으로 심층적으로 사용방법을 알아보았다.

• 정보보호학회논문지
• /
• 제18권2호
• /
• pp.33-38
• /
• 2008

바이오정보를 이용한 사용자 인증시스템은 편리함과 동시에 강력한 보안을 제공할 수 있다. 그러나 사용자 인증을 위해 저장된 중요한 바이오정보가 타인에게 도용된다면 심각한 문제를 일으킨다. 따라서 타인에게 유출되더라도 재사용이 불가능하도록 하기 위하여 사용자의 바이오정보에 역변환이 불가능한 함수를 적용하여 저장하고 변환된 상태에서 인증과정을 수행할 수 있는 방법이 필요하다. 본 논문에서는 최근 지문 템플릿 보호를 위해 활발히 연구되고 있는 지문 퍼지볼트의 빠른 다항식 복원 방법을 제안한다. 제안된 방법은 (k-1)차 다항식을 복원하기 위해 (k+1)개의 real point를 필요로 하며, 전수조사에 비해서 수행속도가 다항식의 차수에 따라 약 $300{\sim}1500$배 향상되는 효과를 가져왔다.

• Nonlinear Functional Analysis and Applications
• /
• 제26권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.