In this paper We introduce some new types of almost bi-periodic points in topological bitransfprmation groups and thier effects on some types of minimaliy in topological dynamics

In this paper, some necessary and sufficient conditions are obtained to ensure the oscillatory of all solutions of the first order impulsive neutral differential equations. Also, some results in the references have been improved and generalized. New lemmas are established to demonstrate the oscillation property. Special impulsive conditions associated with neutral differential equation are submitted. Some examples are given to illustrate the obtained results.

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

This study delves into the properties of the associated act V over the monoid S of sinshT. It examines the relationship between faithful, finitely generated, and separated acts, as well as their connections to one-to-one and onto operators. Additionally, the correlation between acts over a monoid and modules over a ring is explored. Specifically, it is established that  functions as an act over S if and only if  functions as module, where T represents a nilpotent operator. Furthermore, it is proved that when T is onto operator and  is finitely generated, is guaranteed to be finite-dimensional. Prove that for any bounded operator the following,  is acting over S if and only if  is a module where T is a nilpotent operator, is a

 الأثر V بالنسبة إلى   sinshT و خواصه قد تم دراسته في هذا البحث حيث تم دراسة علاقة الأثر المخلص والاثر المنتهى التولد والاثر المنفصل وربطها بالمؤثرات المتباينة حيث تم بهنة العلاقات التالية ان الاثر اذا وفقط اذا مقاس في حالة كون المؤثر هو عديم القوة وكذلك في حالة كون المؤثر شامل فان الاثر هو منتهي التولد اي ان الغضاء هو منتهي التولد وايضا تم برهن ان الاثر مخلص لكل مؤثر مقيد وك\لك قد تم التحقق من انه لاي مؤثر مقي

In this paper, we presented new types of Mc-function by using 𝜔-open and 𝑁-open sets some of them are weaker than Mc-function and some are stronger, which are 𝜔Mc-function, M𝜔c-function, 𝜔M𝜔c-function, 𝑁Mc-function, M𝑁c-function and 𝑁M𝑁c-function, also we submitted new kinds of continuous functions and compact functions and we illustrated the relationships between these types. The purpose of this paper is to expand the study of Mcfunction and to get results that we need to find the relationship with the types that have been introduced.

A demonstration of the inverse kinematics is a very complex problem for redundant robot manipulator. This paper presents the solution of inverse kinematics for one of redundant robots manipulator (three link robot) by combing of two intelligent algorithms GA (Genetic Algorithm) and NN (Neural Network). The inputs are position and orientation of three link robot. These inputs are entering to Back Propagation Neural Network (BPNN). The weights of BPNN are optimized using continuous GA. The (Mean Square Error) MSE is also computed between the estimated and desired outputs of joint angles. In this paper, the fitness function in GA is proposed. The sinwave and circular for three link robot end effecter and desired trajectories are simulated b