• International Journal of Naval Architecture and Ocean Engineering
• /
• v.4 no.3
• /
• pp.267-280
• /
• 2012

An approximate method based on an assumed mode method has been presented for the free vibration analysis of a rectangular plate with arbitrary edge constraints. In the presented method, natural frequencies and their mode shapes of the plate are calculated by solving an eigenvalue problem of a multi-degree-of-freedom system matrix equation derived by using Lagrange's equations of motion. Characteristic orthogonal polynomials having the property of Timoshenko beam functions which satisfies edge constraints corresponding to those of the objective plate are used. In order to examine the accuracy of the proposed method, numerical examples of the rectangular plates with various thicknesses and edge constraints have been presented. The results have shown good agreement with those of other methods such as an analytic solution, an approximate solution, and a finite element analysis.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.5
• /
• pp.941-947
• /
• 2009

Let q be a power of 16. Every polynomial $P\in\mathbb{F}_q$[t] is a strict sum $P=A^2+A+B^3+C^3+D^3+E^3$. The values of A,B,C,D,E are effectively obtained from the coefficients of P. The proof uses the new result that every polynomial $Q\in\mathbb{F}_q$[t], satisfying the necessary condition that the constant term Q(0) has zero trace, has a strict and effective representation as: $Q=F^2+F+tG^2$. This improves for such q's and such Q's a result of Gallardo, Rahavandrainy, and Vaserstein that requires three polynomials F,G,H for the strict representation $Q=F^2$+F+GH. Observe that the latter representation may be considered as an analogue in characteristic 2 of the strict representation of a polynomial Q by three squares in odd characteristic.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.393-396
• /
• 2006

In this paper, we analyze the characteristic polynomials of 90/150 cellular automata which uses only 90, 150 rules as state-transition rules. In particular, we propose the method which the characteristic polynomial is represented as the exponential type of a primitive polynomial by synthesizing 90/150 CA.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.369-372
• /
• 1994

In this paper, the robust stability of characteristic polynomials with respect to real parameter variations is investigated through a new functional approach. Specifically there is no restriction on the interrelationship between coefficients of the polynomials. This allows one to treat the robust stability problems alike without distinction as to continuous or discrete time systems. Necessary condition and sufficient condition for the robust stability are shown and some examples extracted from two-link planar manipulator are provided.

• Communications of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1145-1155
• /
• 2019

Let f be a transcendental meromorphic function, defined in the complex plane $\mathbb{C}$. In this paper, we give a quantitative estimations of the characteristic function T(r, f) in terms of the counting function of a homogeneous differential polynomial generated by f. Our result improves and generalizes some recent results.

• Convergence Security Journal
• /
• v.18 no.4
• /
• pp.27-33
• /
• 2018

Stream cipher is an one-time-pad type encryption algorithm that encrypt plaintext using simple operation such as XOR with random stream of bits (or characters) as symmetric key and its security depends on the randomness of used stream. Therefore we can design more secure stream cipher algorithm by using mathematical analysis of the stream such as period, linear complexity, non-linearity, correlation-immunity, etc. The key stream in stream cipher is generated in linear feedback shift register(LFSR) having characteristic polynomial. The primitive polynomial is the characteristic polynomial which has the best security property. It is used widely not only in stream cipher but also in SEED, a block cipher using 8-degree primitive polynomial, and in Chor-Rivest(CR) cipher, a public-key cryptosystem using 24-degree primitive polynomial. In this paper we present the concept and various properties of primitive polynomials in Galois field and prove the theorem finding the number of irreducible polynomials and primitive polynomials over $F_p$ when p is larger than 2. This kind of research can be the foundation of finding primitive polynomials of higher security and developing new cipher algorithms using them.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.467-481
• /
• 2015

Choi and Park introduced an invariant of a finite simple graph, called signed a-number, arising from computing certain topological invariants of some specific kinds of real toric manifolds. They also found the signed a-numbers of path graphs, cycle graphs, complete graphs, and star graphs. We introduce a signed a-polynomial which is a generalization of the signed a-number and gives a-, b-, and c-numbers. The signed a-polynomial of a graph G is related to the $Poincar\acute{e}$ polynomial $P_{M(G)}(z)$, which is the generating function for the Betti numbers of the real toric manifold M(G). We give the generating functions for the signed a-polynomials of not only path graphs, cycle graphs, complete graphs, and star graphs, but also complete bipartite graphs and complete multipartite graphs. As a consequence, we find the Euler characteristic number and the Betti numbers of the real toric manifold M(G) for complete multipartite graphs G.

• Journal of Environmental Science International
• /
• v.11 no.9
• /
• pp.907-914
• /
• 2002

Various Eulerian-Lagrangian models for the one-dimensional longitudinal dispersion equation in nonuniform flow were studied comparatively. In the models studied, the transport equation was decoupled into two component parts by the operator-splitting approach; one part is governing advection and the other is governing dispersion. The advection equation has been solved by using the method of characteristics following fluid particles along the characteristic line and the results were interpolated onto an Eulerian grid on which the dispersion equation was solved by Crank-Nicholson type finite difference method. In the solution of the advection equation, Lagrange fifth, cubic spline, Hermite third and fifth interpolating polynomials were tested by numerical experiment and theoretical error analysis. Among these, Hermite interpolating polynomials are generally superior to Lagrange and cubic spline interpolating polynomials in reducing both dissipation and dispersion errors.

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

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1595-1604
• /
• 2017

We give a complete formula for the characteristic polynomial of hyperplane arrangements ${\mathcal{J}}_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $1{\leq}i$, j, k, $l{\leq}n$. The formula is obtained by associating hyperplane arrangements with graphs, and then enumerating central graphs via generating functions for the number of bipartite graphs of given order, size and number of connected components.