• Journal of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.973-1008
• /
• 1997

We reconsider the problem of calssifying all classical orthogonal polynomial sequences which are solutions to a second-order differential equation of the form $$ \ell_2(x)y"(x) + \ell_1(x)y'(x) = \lambda_n y(x). $$ We first obtain new (algebraic) necessary and sufficient conditions on the coefficients $\ell_1(x)$ and $\ell_2(x)$ for the above differential equation to have orthogonal polynomial solutions. Using this result, we then obtain a complete classification of all classical orthogonal polynomials : up to a real linear change of variable, there are the six distinct orthogonal polynomial sets of Jacobi, Bessel, Laguerre, Hermite, twisted Hermite, and twisted Jacobi.cobi.

• Kyungpook Mathematical Journal
• /
• v.50 no.1
• /
• pp.1-5
• /
• 2010

Let P be a prime ideal of a commutative unital ring R; X an indeterminate; D := R/P; L the quotient field of D; F an algebraic closure of L; ${\alpha}$ ${\in}$ L[X] a monic irreducible polynomial; ${\xi}$ any root of in F; and Q = ${\alpha}$>, the upper to P with respect to ${\alpha}$. Then R[X]/Q is R-algebra isomorphic to $D[{\xi}]$; and is R-isomorphic to an overring of D if and only if deg(${\alpha}$) = 1.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.6
• /
• pp.1015-1027
• /
• 2009

Many problems of confounding and identifiability for polynomial models in an experimental design can be solved using methods of algebraic geometry. The theory of $Gr\ddot{o}bner$ basis is used to characterize the design. In addition, a fractional factorial design can be uniquely represented by a polynomial indicator function. $Gr\ddot{o}bner$ bases and indicator functions are powerful computational tools to deal with ideals of fractions based on each different theoretical aspects. The problem posed here is to give how to move from one representation to the other. For a given fractional factorial design, the indicator function can be computed from the generating equations in the $Gr\ddot{o}bner$ basis. The theory is tested using some fractional factorial designs aided by a modern computational algebra package CoCoA.

• Journal for History of Mathematics
• /
• v.27 no.3
• /
• pp.165-182
• /
• 2014

After algebraic expressions for the roots of 3rd and 4th degree polynomial equations were given in the mid 16th century, seeking such a formula for the 5th and greater degree equations had been one main problem for algebraists for almost 200 years. Lagrange made careful and thorough investigation of various solving methods for equations with the purpose of finding a principle which could be applicable to general equations. In the process of doing this, he found a relation between the roots of the original equation and its auxiliary equation using permutations of the roots. Lagrange's ingenious idea of using permutations of roots of the original equation is regarded as the key factor of the Abel's proof of unsolvability by radicals of general 5th degree equations and of Galois' theory as well. This paper intends to examine Lagrange's contribution in the theory of polynomial equations, providing a detailed analysis of various solving methods of Lagrange and others before him.

• Communications of Mathematical Education
• /
• v.29 no.4
• /
• pp.661-685
• /
• 2015

This study is to search for a program of professional development of mathematics teachers on the viewpoint of content knowledge of mathematics. To do this, we select algebraic subject as content knowledge for solution of polynomials and develop material for group study based on selected subject. We supply the developed material to teachers and discuss the possibility of application and the acceptability of it. For discussion, we collect data through tests and questionnaire. Through analysing the data, we obtain the positive result.

• Coupled systems mechanics
• /
• v.1 no.2
• /
• pp.155-163
• /
• 2012

This paper presents analytical approximate solutions for the initial post-buckling deformation of the pipes in oil and gas wells. The governing differential equation with sinusoidal nonlinearity can be reduced to form a third-order-polynomial nonlinear equation, by coupling of the well-known Maclaurin series expansion and orthogonal Chebyshev polynomials. Analytical approximations to the resulting boundary condition problem are established by combining the Newton's method with the method of harmonic balance. The linearization is performed prior to proceeding with harmonic balancing thus resulting in a set of linear algebraic equations instead of one of non-linear algebraic equations, unlike the classical method of harmonic balance. We are hence able to establish analytical approximate solutions. The approximate formulae for load along axis, and periodic solution are established for derivative of the helix angle at the end of the pipe. Illustrative examples are selected and compared to "reference" solution obtained by the shooting method to substantiate the accuracy and correctness of the approximate analytical approach.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.6
• /
• pp.1651-1672
• /
• 2023

In 2010, Li-Ye [13, Theorem 0.1] proved that P(ζ(z), ζ'(z), . . . , ζ^(m)(z), Γ(z), Γ'(z), Γ"(z)) ≢ 0 in ℂ, where m is a non-negative integer, and P(u₀, u₁, . . . , u_m, v₀, v₁, v₂) is any non-trivial polynomial in its arguments with coefficients in the field ℂ. Later on, Li-Ye [15, Theorem 1] proved that P(z, Γ(z), Γ'(z), . . . , Γ⁽ⁿ⁾(z), ζ(z)) ≢ 0 in z ∈ ℂ for any non-trivial distinguished polynomial P(z, u₀, u₁, . . ., u_n, v) with coefficients in a set L_δ of the zero function and a class of nonzero functions f from ℂ to ℂ ∪ {∞} (cf. [15, Definition 1]). In this paper, we prove that P(z, ζ(z), ζ'(z), . . . , ζ^(m)(z), Γ(z), Γ'(z), . . . , Γ⁽ⁿ⁾(z)) ≢ 0 in z ∈ ℂ, where m and n are two non-negative integers, and P(z, u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n) is any non-trivial polynomial in the m + n + 2 variables u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n with coefficients being meromorphic functions of order less than one, and the polynomial P(z, u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n) is a distinguished polynomial in the n + 1 variables v₀, v₁, . . . , v_n. The question studied in this paper is concerning the conjecture of Markus from [16]. The main results obtained in this paper also extend the corresponding results from Li-Ye [12] and improve the corresponding results from Chen-Wang [5] and Wang-Li-Liu-Li [23], respectively.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.17-26
• /
• 2014

In this paper, we present an algorithm for computing the number of points on the Jacobian varieties of genus 3 hyperelliptic curves of type $y^2=x^7+ax$ over finite prime fields. The problem of determining the group order of the Jacobian varieties of algebraic curves defined over finite fields is important not only arithmetic geometry but also curve-based cryptosystems in order to find a secure curve. Based on this, we provide the explicit formula of the characteristic polynomial of the Frobenius endomorphism of the Jacobian variety of hyperelliptic curve $y^2=x^7+ax$ over a finite field $\mathbb{F}_p$ with $p{\equiv}1$ modulo 12. Moreover, we also introduce some implementation results by using our algorithm.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.459-479
• /
• 2020

In the last two decades, codes over noncommutative rings have been one of the main trends in coding theory. Due to the fact that noncommutativity brings many challenging problems in its nature, still there are many open problems to be addressed. In 2015, generator polynomial matrices and parity-check polynomial matrices of generalized quasi-cyclic (GQC) codes were investigated by Matsui. We extended these results to the noncommutative case. Exploring the dual structures of skew constacyclic codes, we present a direct way of obtaining parity-check polynomials of skew multi-twisted codes in terms of their generators. Further, we lay out the algebraic structures of skew multipolycyclic codes and their duals and we give some examples to illustrate the theorems.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.971-974
• /
• 2002

Petri net is an effective modeling tool for concurrent systems. Liveness problem is one of analysis problems in Petri net theory verifying whether the system is free from any local deadlocks. It is well known that computational complexity of liveness problem of general Petri net is deterministic exponential space. Some subclasses, such as marked graph and free choice net, are suggested where liveness problem is verified in less complexity. This paper studies liveness of siphon containing circuit (SCC) net. Liveness condition based on algebraic inequalities is shown. Then polynomial time decidability of liveness of SCC net is derived, if the given net is known to be an SCC net a priori.