• Journal of applied mathematics & informatics
• /
• v.40 no.5_6
• /
• pp.1137-1150
• /
• 2022

Consider the quantum algebra U_q(sl₂) over field 𝓕 (char(𝓕) = 0) with equitable generators x^±1, y and z, where q is fixed nonzero, not root of unity scalar in 𝓕. Let V denote a finite dimensional irreducible module for this algebra. Let Λ ∈ End(V), and let {A₁, A₂, A₃} = {x, y, z}. First we show that if Λ, A₁ is a Leonard pair, then this Leonard pair have four types, and we show that for each type there exists a Leonard pair Λ, A₁ in which Λ is a linear combination of 1, A₂, A₃, A₂A₃. Moreover, we use Λ to construct 𝚼 ∈ U_q(sl₂) such that 𝚼, A^-1₁ is a Leonard pair, and show that 𝚼 = I + A₁Φ + A₁ΨA₁ where Φ and Ψ are linear combination of 1, A₂, A₃.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.193-201
• /
• 2023

In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.3_4
• /
• pp.187-196
• /
• 2023

This study is about spin half add operations in 𝓑₂ and 𝓑₃. The burden of technological structures has increased due to the increase in the use of today's technological applications or the processes in the digital systems used. This has increased the importance of fast transactions and storage areas. For this, less transactions, more gain and storage space are foreseen. We have handle tit (triple digit) system instead of bit (binary digit). 729 is reached in 3⁶ in 𝓑₃ while 256 is reached with 2⁸ in 𝓑₂. The volume and number of transactions are shortened in 𝓑₃. The limited storage space at the maximum level is storaged. The logic connectors and the complement of an element in 𝓑₂ and the course of the connectors and the complements of the elements in 𝓑₃ are examined. "Carry" calculations in calculating addition and "borrow" in calculating difference are given in 𝓑₃. The logic structure 𝓑₂ is seen to embedded in the logic structure 𝓑₃. This situation enriches the logic structure. Some theorems and lemmas and properties in logic structure 𝓑₂ are extended to logic structure 𝓑₃.

• Journal of applied mathematics & informatics
• /
• v.41 no.5
• /
• pp.989-999
• /
• 2023

The aim of this paper is to study the projective curvature tensor field of the Curvature tensor Rⁱ_jkh on a recurrent non Riemannian space admitting recurrent affine motion, which is also decomposable in the form Rⁱ_jkh=Xⁱ Y_jkh, where Xⁱ and Y_jkh are non-null vector and tensor respectively. In this paper we decompose Special Pseudo Projective Curvature Tensor Field. In the sequal of decomposition we established several properties of such decomposed tensor fields. We have considered the curvature tensor field Rⁱ_jkh in a Finsler space equipped with non symmetric connection and we study the decomposition of such field. In a special Pseudo recurrent Finsler Space, if the arbitrary tensor field 𝜓ⁱ_j is assumed to be a covariant constant then, in view of the decomposition rule, 𝜙_kh behaves as a recurrent tensor field. In the last, we have considered the decomposition of curvature tensor fields in Kaehlerian recurrent spaces and have obtained several related theorems.

• Journal of The Korean Association of Information Education
• /
• v.19 no.1
• /
• pp.11-20
• /
• 2015

The researches on the concept of justice and utilization for Computational Thinking with SW education are being actively discussed. However, a program has developed in conjunction with the actual elementary curriculum is not much. In this study, we have developed an educational program in applied mathematics based on CT. First, a separated view for a CT Application of mathematical concepts and objectives are set in three different application models. In order to achieve the CT-based math lessons, we also have developed a teaching and learning materials. We applied the developed materials in class, and to evaluate the satisfaction of learners. In addition to the validation of school application, we conducted a survey of professionals and teachers. The results of the analysis, the data showed that are helpful in the development of the student' CT ability as well as the ability to be helpful teaching and learning in school.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.34 no.4
• /
• pp.191-197
• /
• 2021

To calculate the induced charge of atoms in molecular dynamics, linear equations for the induced charges need to be solved. As induced charges are determined at each time step, the process involves considerable computational costs. Hence, an efficient method for calculating the induced charge distribution is required when analyzing large systems. This paper introduces the Uzawa method for solving saddle point problems, which occur in linear systems, for the solution of the Lagrange equation with constraints. We apply the accelerated Uzawa algorithm, which reduces computational costs noticeably using the Schur complement and preconditioned conjugate gradient methods, in order to overcome the drawback of the Uzawa parameter, which affects the convergence speed, and increase the efficiency of the matrix operation. Numerical models of molecular dynamics in which two gold nanoparticles are placed under external electric fields reveal that the proposed method provides improved results in terms of both convergence and efficiency. The computational cost was reduced by approximately 1/10 compared to that for the Gaussian elimination method, and fast convergence of the conjugate gradient, as compared to the basic Uzawa method, was verified.

• Journal for History of Mathematics
• /
• v.23 no.3
• /
• pp.141-168
• /
• 2010

Mathematical communication is necessary to exchange mathematical idea among participants in teaching-learning process. The promotion of mathematical communication competence is clearly stated in many parts of the 2007 revised curriculum. As a result, mathematical communication tasks are contained in 'high school Mathematics' textbook. At this point of time when increasing importance of mathematical communication is realized, we will check over mathematical communication and analyze communicative tasks corner in 'high school Mathematics' textbook in this paper And thereby we hope this study help prepare for practical communicative tasks corner suggesting a way for invigoration of mathematical communication.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.457-469
• /
• 2008

In this paper, we study the existence of positive solutions for the following nonlinear m-point boundary value problem with p-Laplacian: $\{{{{(\phi_p(u'))'\;+\;f(t,u(t))=0, \;0<t<1,} \atop u'(0)={\sum}{^{m-2}_{i=1}}\;a_iu'(\xi_i),} \atop u(1)={\sum}{^k_{i=1}}\;b_iu(\xi_i)\;-\;{\sum}{^s_{i=k+1}}\;b_iu(\xi_i)\;-\;{\sum}{^{m-2}_{i=s+1}}\;b_iu'(xi_i),}$ where ${\phi}_p(s)$ is p-Laplacian operator, i.e., ${\phi}_p(s)=\mid s\mid^{p-2}s$, p>1, ${\phi}_q\;=\;({\phi}_p)^{-1}$, $\frac{1}{p}+\frac{1}{q}=1$, $1\;{\leq}\;k\;{\leq}\;s\;{\leq}m\;-\;2$, $b_i\;{\in}\;(0,+{\infty})$ with $0\;<\;{\sum}{^k_{k=1}}\;b_i\;-\;{\sum}{^s_{i=k+1}}\;b_i\;<\;1$, $0\;<\;{\sum}{^{m-2}_{i=1}}\la_i\;<\;1$, $0\;<\;{\xi}_1\;<\;{\xi}_2\;<\;{\cdots}\;<\;{\xi}_{m-2}\;<\;1$, $f\;{\in}\;C([0,\;1]\;{\times}\;[0,\;+{\infty}),\;[0,\;+{\infty}))$. We show that there exists one or two positive solutions by using fixed-point theorem for operator on a cone. The conclusions in this paper essentially extend and improve the known results.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.173-183
• /
• 2015

A radio k-labeling f of a graph G is a function f from V (G) to $Z^+{\cup}\{0\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}k+1$ for every two distinct vertices x and y of G, where d(x, y) is the distance between any two vertices $x,y{\in}G$. The span of a radio k-labeling f is denoted by sp(f) and defined as max$\{{\mid}f(x)-f(y){\mid}:x,y{\in}V(G)\}$. The radio k-labeling is a radio labeling when k = diam(G). In other words, a radio labeling is an injective function $f:V(G){\rightarrow}Z^+{\cup}\{0\}$ such that $${\mid}f(x)=f(y){\mid}{\geq}diam(G)+1-d(x,y)$$ for any pair of vertices $x,y{\in}G$. The radio number of G denoted by rn(G), is the lowest span taken over all radio labelings of the graph. When k = diam(G) - 1, a radio k-labeling is called a radio antipodal labeling. An antipodal labeling for a graph G is a function $f:V(G){\rightarrow}\{0,1,2,{\ldots}\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}diam(G)$ holds for all $x,y{\in}G$. The radio antipodal number for G denoted by an(G), is the minimum span of an antipodal labeling admitted by G. In this paper, we investigate the exact value of the radio number and radio antipodal number for the circulant graphs G(4k + 2; {1, 2}).

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.871-882
• /
• 2012

For a connected graph G of order $n$, an ordered set $S=\{u_1,u_2,{\cdots},u_k\}$ of vertices in G is a linear edge geodetic set of G if for each edge $e=xy$ in G, there exists an index $i$, $1{\leq}i$ < $k$ such that e lie on a $u_i-u_{i+1}$ geodesic in G, and a linear edge geodetic set of minimum cardinality is the linear edge geodetic number $leg(G)$ of G. A graph G is called a linear edge geodetic graph if it has a linear edge geodetic set. The linear edge geodetic numbers of certain standard graphs are obtained. Let $g_l(G)$ and $eg(G)$ denote the linear geodetic number and the edge geodetic number, respectively of a graph G. For positive integers $r$, $d$ and $k{\geq}2$ with $r$ < $d{\leq}2r$, there exists a connected linear edge geodetic graph with rad $G=r$, diam $G=d$, and $g_l(G)=leg(G)=k$. It is shown that for each pair $a$, $b$ of integers with $3{\leq}a{\leq}b$, there is a connected linear edge geodetic graph G with $eg(G)=a$ and $leg(G)=b$.