• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.2
• /
• pp.357-365
• /
• 2013

Fix $n-2$ elements $h_1,{\cdots},h_{n-2}$ of the quotient field B of the polynomial algebra $\mathbb{C}[x_1,x_2,{\cdots},x_n]$. It is proved that B is a Poisson algebra with Poisson bracket defined by $\{f,g\}=det(Jac(f,g,h_1,{\cdots},h_{n-2})$ for any $f,g{\in}B$, where det(Jac) is the determinant of a Jacobian matrix.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.75-86
• /
• 1996

Let G be a finite simple connected graph with vertex set V(G) and edge set E(G). Let A(G) be the adjacency matrix of G. The characteristic polynomial of G is the characteristic polynomial $\Phi(G;\lambda) = det(\lambda I - A(G))$ of A(G). A zero of $\Phi(G;\lambda)$ is called an eigenvalue of G.

• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.1017-1045
• /
• 2016

Using a combination of calculational and theoretical approaches, we establish results that relate two knot invariants, the Alexander polynomial, and the number of quandle colourings using any finite linear Alexander quandle. Given such a quandle, specified by two coprime integers n and m, the number of colourings of a knot diagram is given by counting the solutions of a matrix equation of the form AX = 0 mod n, where A is the m-dependent colouring matrix. We devised an algorithm to reduce A to echelon form, and applied this to the colouring matrices for all prime knots with up to 10 crossings, finding just three distinct reduced types. For two of these types, both upper triangular, we found general formulae for the number of colourings. This enables us to prove that in some cases the number of such quandle colourings cannot distinguish knots with the same Alexander polynomial, whilst in other cases knots with the same Alexander polynomial can be distinguished by colourings with a specific quandle. When two knots have different Alexander polynomials, and their reduced colouring matrices are upper triangular, we find a specific quandle for which we prove that it distinguishes them by colourings.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.299-302
• /
• 2002

Digital video camera can be a useful tool to capture images for use in colorimeter. However, the RGB signals generated by different digital video camera are not equal for the same scene. The digital video camera for use in colorimeter is characterized based on the CIE standard colorimetric observer. One method of deriving a colorimetric characterization matrix between camera RGB output signals and CIE XYZ tristimulus values is Polynomial modeling. In this paper, 3${\times}$3 linear matrix and 3${\times}$l1 polynomial matrix is used to investigate the characterization performance of the professional digital video camera. In experimental results, it is demonstrated that proposed 3${\times}$3 linear matrix has a reasonable degree of accuracy for use in colorimeter.

• Journal of the Korean Mathematical Society
• /
• v.47 no.6
• /
• pp.1269-1282
• /
• 2010

We in this note consider a new concept, so called $\pi$-McCoy, which unifies McCoy rings and IFP rings. The classes of McCoy rings and IFP rings do not contain full matrix rings and upper (lower) triangular matrix rings, but the class of $\pi$-McCoy rings contain upper (lower) triangular matrix rings and many kinds of full matrix rings. We first study the basic structure of $\pi$-McCoy rings, observing the relations among $\pi$-McCoy rings, Abelian rings, 2-primal rings, directly finite rings, and ($\pi-$)regular rings. It is proved that the n by n full matrix rings ($n\geq2$) over reduced rings are not $\pi$-McCoy, finding $\pi$-McCoy matrix rings over non-reduced rings. It is shown that the $\pi$-McCoyness is preserved by polynomial rings (when they are of bounded index of nilpotency) and classical quotient rings. Several kinds of extensions of $\pi$-McCoy rings are also examined.

• Korean Journal of Mathematics
• /
• v.21 no.4
• /
• pp.421-428
• /
• 2013

We observe the basic structure of the products of coefficients of nilpotent (left) polynomials in skew polynomial rings. This study consists of a process to extend a well-known result for semi-Armendariz rings. We introduce the concept of ${\alpha}$-skew n-semi-Armendariz ring, where ${\alpha}$ is a ring endomorphism. We prove that a ring R is ${\alpha}$-rigid if and only if the n by n upper triangular matrix ring over R is $\bar{\alpha}$-skew n-semi-Armendariz. This result are applicable to several known results.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.592-594
• /
• 1998

In the single-input and single-output system, the parameter of plant is scalar polynomial, but in the multiple input and multiple output, it accompanies, being matrix polynomial, the consideration of observable conrolability index or problems of non-commutation in matrix polynomial as well as degree, and it is more complex to deal with. Therefore, it is thought that a full reserach on the single-input and single-output system is not made. This reserach propose that problems of minimum variance self-tuning regulator of multivariable system and pole placement self-tuning regulator.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.7
• /
• pp.76-82
• /
• 2004

The solutions of neighboring optimal control are typically obtained using the sweep method or transition matrices. Due to the numerical integration, however, the gain matrix can become infinite as time go to final one in the transition matrices, and the Riccati solution can become infinite when the final time free. To overcome these disadvantages, this paper proposes the pseudospectral Legendre method which is to first discreteize the linear boundary value problem using the global orthogonal polynomial, then transforms into an algebraic equations. Because this method is not necessary to take any integration of transition matrix or Riccati equation, it can be usefully used in real-time operation. Finally, its performance is verified by the numerical example for the space vehicle's orbit transfer.

• Communications of the Korean Mathematical Society
• /
• v.12 no.4
• /
• pp.855-864
• /
• 1997

Let K be a algebraically closed field of characteristic 0 and G a cyclic group of order n. We find the units and idempotent elements of the group ring KG by using the basic group table matrix of G.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.