Search results for: semigroup
16 Rank of Semigroup: Generating Sets and Cases Revealing Limitations of the Concept of Independence
Authors: Zsolt Lipcsey, Sampson Marshal Imeh
Abstract:
We investigate a certain characterisation for rank of a semigroup by Howie and Ribeiro (1999), to ascertain the relevance of the concept of independence. There are cases where the concept of independence fails to be useful for this purpose. One would expect the basic element to be the maximal independent subset of a given semigroup. However, we construct examples for semigroups where finite basis exist and the basis is larger than the number of independent elements.Keywords: generating sets, independent set, rank, cyclic semigroup, basis, commutative
Procedia PDF Downloads 18915 Digraph Generated by Idempotents in Certain Finite Semigroup of Mappings
Authors: Hassan Ibrahim, Moses Anayo Mbah
Abstract:
The idempotent generators in a finite full transformation and the digraph of full transformation semi group have been an interesting area of research in group theory. In this work, it characterized some idempotent elements in full transformation semigroup T_n by counting the strongly connected and disconnected digraphs, and also the weakly and unilaterally connected digraphs. The order for those digraphs was further obtained in T_n.Keywords: digraphs, indempotent, semigroup, transformation
Procedia PDF Downloads 3714 Regularity and Maximal Congruence in Transformation Semigroups with Fixed Sets
Authors: Chollawat Pookpienlert, Jintana Sanwong
Abstract:
An element a of a semigroup S is called left (right) regular if there exists x in S such that a=xa² (a=a²x) and said to be intra-regular if there exist u,v in such that a=ua²v. Let T(X) be the semigroup of all full transformations on a set X under the composition of maps. For a fixed nonempty subset Y of X, let Fix(X,Y)={α ™ T(X) : yα=y for all y ™ Y}, where yα is the image of y under α. Then Fix(X,Y) is a semigroup of full transformations on X which fix all elements in Y. Here, we characterize left regular, right regular and intra-regular elements of Fix(X,Y) which characterizations are shown as follows: For α ™ Fix(X,Y), (i) α is left regular if and only if Xα\Y = Xα²\Y, (ii) α is right regular if and only if πα = πα², (iii) α is intra-regular if and only if | Xα\Y | = | Xα²\Y | such that Xα = {xα : x ™ X} and πα = {xα⁻¹ : x ™ Xα} in which xα⁻¹ = {a ™ X : aα=x}. Moreover, those regularities are equivalent if Xα\Y is a finite set. In addition, we count the number of those elements of Fix(X,Y) when X is a finite set. Finally, we determine the maximal congruence ρ on Fix(X,Y) when X is finite and Y is a nonempty proper subset of X. If we let | X \Y | = n, then we obtain that ρ = (Fixn x Fixn) ∪ (H ε x H ε) where Fixn = {α ™ Fix(X,Y) : | Xα\Y | < n} and H ε is the group of units of Fix(X,Y). Furthermore, we show that the maximal congruence is unique.Keywords: intra-regular, left regular, maximal congruence, right regular, transformation semigroup
Procedia PDF Downloads 22913 Independence and Path Independence on Cayley Digraphs of Left Groups and Right Groups
Authors: Nuttawoot Nupo, Sayan Panma
Abstract:
A semigroup S is said to be a left (right) zero semigroup if S satisfies the equation xy=x (xy=y) for all x,y in S. In addition, the semigroup S is called a left (right) group if S is isomorphic to the direct product of a group and a left (right) zero semigroup. The Cayley digraph Cay(S,A) of a semigroup S with a connection set A is defined to be a digraph with the vertex set S and the arc set E(Cay(S,A))={(x,xa) | x∈S, a∈A} where A is any subset of S. All sets in this research are assumed to be finite. Let D be a digraph together with a vertex set V and an arc set E. Let u and v be two different vertices in V and I a nonempty subset of V. The vertices u and v are said to be independent if (u,v)∉E and (v,u)∉E. The set I is called an independent set of D if any two different vertices in I are independent. The independence number of D is the maximum cardinality of an independent set of D. Moreover, the vertices u and v are said to be path independent if there is no dipath from u to v and there is no dipath from v to u. The set I is called a path independent set of D if any two different vertices in I are path independent. The path independence number of D is the maximum cardinality of a path independent set of D. In this research, we describe a lower bound and an upper bound of the independence number of Cayley digraphs of left groups and right groups. Some examples corresponding to those bounds are illustrated here. Furthermore, the exact value of the path independence number of Cayley digraphs of left groups and right groups are also presented.Keywords: Cayley digraphs, independence number, left groups, path independence number, right groups
Procedia PDF Downloads 23112 A Variable Structural Control for a Flexible Lamina
Authors: Xuezhang Hou
Abstract:
A control problem of a flexible Lamina formulated by partial differential equations with viscoelastic boundary conditions is studied in this paper. The problem is written in standard form of linear infinite dimensional system in an appropriate energy Hilbert space. The semigroup approach of linear operators is adopted in investigating wellposedness of the closed loop system. A variable structural control for the system is proposed, and meanwhile an equivalent control method is applied to the thin plate system. A significant result on control theory that the thin plate can be approximated by ideal sliding mode in any accuracy in terms of semigroup approach is obtained.Keywords: partial differential equations, flexible lamina, variable structural control, semigroup of linear operators
Procedia PDF Downloads 8511 Explicit Iterative Scheme for Approximating a Common Solution of Generalized Mixed Equilibrium Problem and Fixed Point Problem for a Nonexpansive Semigroup in Hilbert Space
Authors: Mohammad Farid
Abstract:
In this paper, we introduce and study an explicit iterative method based on hybrid extragradient method to approximate a common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup in Hilbert space. Further, we prove that the sequence generated by the proposed iterative scheme converge strongly to the common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup. This common solution is the unique solution of a variational inequality problem and is the optimality condition for a minimization problem. The results presented in this paper are the supplement, extension and generalization of the previously known results in this area.Keywords: generalized mixed equilibrium problem, fixed-point problem, nonexpansive semigroup, variational inequality problem, iterative algorithms, hybrid extragradient method
Procedia PDF Downloads 47510 Methods for Solving Identification Problems
Authors: Fadi Awawdeh
Abstract:
In this work, we highlight the key concepts in using semigroup theory as a methodology used to construct efficient formulas for solving inverse problems. The proposed method depends on some results concerning integral equations. The experimental results show the potential and limitations of the method and imply directions for future work.Keywords: identification problems, semigroup theory, methods for inverse problems, scientific computing
Procedia PDF Downloads 4819 The Construction of the Semigroup Which Is Chernoff Equivalent to Statistical Mixture of Quantizations for the Case of the Harmonic Oscillator
Authors: Leonid Borisov, Yuri Orlov
Abstract:
We obtain explicit formulas of finitely multiple approximations of the equilibrium density matrix for the case of the harmonic oscillator using Chernoff's theorem and the notion of semigroup which is Chernoff equivalent to average semigroup. Also we found explicit formulas for the corresponding approximate Wigner functions and average values of the observable. We consider a superposition of τ -quantizations representing a wide class of linear quantizations. We show that the convergence of the approximations of the average values of the observable is not uniform with respect to the Gibbs parameter. This does not allow to represent approximate expression as the sum of the exact limits and small deviations evenly throughout the temperature range with a given order of approximation.Keywords: Chernoff theorem, Feynman formulas, finitely multiple approximation, harmonic oscillator, Wigner function
Procedia PDF Downloads 4398 A Sliding Model Control for a Hybrid Hyperbolic Dynamic System
Authors: Xuezhang Hou
Abstract:
In the present paper, a hybrid hyperbolic dynamic system formulated by partial differential equations with initial and boundary conditions is considered. First, the system is transformed to an abstract evolution system in an appropriate Hilbert space, and spectral analysis and semigroup generation of the system operator is discussed. Subsequently, a sliding model control problem is proposed and investigated, and an equivalent control method is introduced and applied to the system. Finally, a significant result that the state of the system can be approximated by an ideal sliding mode under control in any accuracy is derived and examined.Keywords: hyperbolic dynamic system, sliding model control, semigroup of linear operators, partial differential equations
Procedia PDF Downloads 1367 Semigroups of Linear Transformations with Fixed Subspaces: Green’s Relations and Ideals
Authors: Yanisa Chaiya, Jintana Sanwong
Abstract:
Let V be a vector space over a field and W a subspace of V. Let Fix(V,W) denote the set of all linear transformations on V with fix all elements in W. In this paper, we show that Fix(V,W) is a semigroup under the composition of maps and describe Green’s relations on this semigroup in terms of images, kernels and the dimensions of subspaces of the quotient space V/W where V/W = {v+W : v is an element in V} with v+W = {v+w : w is an element in W}. Let dim(U) denote the dimension of a vector space U and Vα = {vα : v is an element in V} where vα is an image of v under a linear transformation α. For any cardinal number a let a'= min{b : b > a}. We also show that the ideals of Fix(V,W) are precisely the sets. Fix(r) ={α ∊ Fix(V,W) : dim(Vα/W) < r} where 1 ≤ r ≤ a' and a = dim(V/W). Moreover, we prove that if V is a finite-dimensional vector space, then every ideal of Fix(V,W) is principle.Keywords: Green’s relations, ideals, linear transformation semi-groups, principle ideals
Procedia PDF Downloads 2926 Undirected Endo-Cayley Digraphs of Cyclic Groups of Order Primes
Authors: Chanon Promsakon, Sayan Panma
Abstract:
Let S be a finite semigroup, A a subset of S and f an endomorphism on S. The endo-Cayley digraph of a semigroup S corresponding to a connecting set A and an endomorphism f, denoted by endo − Cayf (S, A) is a digraph whose vertex set is S and a vertex u is adjacent to a vertex v if and only if v = f(u)a for some a ∈ A. A digraph D is called undirected if any edge uv in D, there exists an edge vu in D. We consider the undirectedness of an endo-Cayley of a cyclic group of order prime, Zp. In this work, we investigate conditions for connecting sets and endomorphisms to make endo-Cayley digraphs of cyclic groups of order primes be undirected. Moreover, we give some conditions for an undirected endo-Cayley of cycle group of any order.Keywords: endo-Cayley graph, undirected digraphs, cyclic groups, endomorphism
Procedia PDF Downloads 3505 Semirings of Graphs: An Approach Towards the Algebra of Graphs
Authors: Gete Umbrey, Saifur Rahman
Abstract:
Graphs are found to be most capable in computing, and its abstract structures have been applied in some specific computations and algorithms like in phase encoding controller, processor microcontroller, and synthesis of a CMOS switching network, etc. Being motivated by these works, we develop an independent approach to study semiring structures and various properties by defining the binary operations which in fact, seems analogous to an existing definition in some sense but with a different approach. This work emphasizes specifically on the construction of semigroup and semiring structures on the set of undirected graphs, and their properties are investigated therein. It is expected that the investigation done here may have some interesting applications in theoretical computer science, networking and decision making, and also on joining of two network systems.Keywords: graphs, join and union of graphs, semiring, weighted graphs
Procedia PDF Downloads 1484 A Study on Approximate Controllability of Impulsive Integrodifferential Systems with Non Local Conditions
Authors: Anandhi Santhosh
Abstract:
In order to describe various real-world problems in physical and engineering sciences subject to abrupt changes at certain instants during the evolution process, impulsive differential equations has been used to describe the system model. In this article, the problem of approximate controllability for nonlinear impulsive integrodifferential equations with state-dependent delay is investigated. We study the approximate controllability for nonlinear impulsive integrodifferential system under the assumption that the corresponding linear control system is approximately controllable. Using methods of functional analysis and semigroup theory, sufficient conditions are formulated and proved. Finally, an example is provided to illustrate the proposed theory.Keywords: approximate controllability, impulsive differential system, fixed point theorem, state-dependent delay
Procedia PDF Downloads 3833 A Study on Ideals and Prime Ideals of Sub-Distributive Semirings and Its Applications to Symmetric Fuzzy Numbers
Authors: Rosy Joseph
Abstract:
From an algebraic point of view, Semirings provide the most natural generalization of group theory and ring theory. In the absence of additive inverse in a semiring, one had to impose a weaker condition on the semiring, i.e., the additive cancellative law to study interesting structural properties. In many practical situations, fuzzy numbers are used to model imprecise observations derived from uncertain measurements or linguistic assessments. In this connection, a special class of fuzzy numbers whose shape is symmetric with respect to a vertical line called the symmetric fuzzy numbers i.e., for α ∈ (0, 1] the α − cuts will have a constant mid-point and the upper end of the interval will be a non-increasing function of α, the lower end will be the image of this function, is suitable. Based on this description, arithmetic operations and a ranking technique to order the symmetric fuzzy numbers were dealt with in detail. Wherein it was observed that the structure of the class of symmetric fuzzy numbers forms a commutative semigroup with cancellative property. Also, it forms a multiplicative monoid satisfying sub-distributive property.In this paper, we introduce the algebraic structure, sub-distributive semiring and discuss its various properties viz., ideals and prime ideals of sub-distributive semiring, sub-distributive ring of difference etc. in detail. Symmetric fuzzy numbers are visualized as an illustration.Keywords: semirings, subdistributive ring of difference, subdistributive semiring, symmetric fuzzy numbers
Procedia PDF Downloads 2122 A Convergent Interacting Particle Method for Computing Kpp Front Speeds in Random Flows
Authors: Tan Zhang, Zhongjian Wang, Jack Xin, Zhiwen Zhang
Abstract:
We aim to efficiently compute the spreading speeds of reaction-diffusion-advection (RDA) fronts in divergence-free random flows under the Kolmogorov-Petrovsky-Piskunov (KPP) nonlinearity. We study a stochastic interacting particle method (IPM) for the reduced principal eigenvalue (Lyapunov exponent) problem of an associated linear advection-diffusion operator with spatially random coefficients. The Fourier representation of the random advection field and the Feynman-Kac (FK) formula of the principal eigenvalue (Lyapunov exponent) form the foundation of our method implemented as a genetic evolution algorithm. The particles undergo advection-diffusion and mutation/selection through a fitness function originated in the FK semigroup. We analyze the convergence of the algorithm based on operator splitting and present numerical results on representative flows such as 2D cellular flow and 3D Arnold-Beltrami-Childress (ABC) flow under random perturbations. The 2D examples serve as a consistency check with semi-Lagrangian computation. The 3D results demonstrate that IPM, being mesh-free and self-adaptive, is simple to implement and efficient for computing front spreading speeds in the advection-dominated regime for high-dimensional random flows on unbounded domains where no truncation is needed.Keywords: KPP front speeds, random flows, Feynman-Kac semigroups, interacting particle method, convergence analysis
Procedia PDF Downloads 461 Exponential Stabilization of a Flexible Structure via a Delayed Boundary Control
Authors: N. Smaoui, B. Chentouf
Abstract:
The boundary stabilization problem of the rotating disk-beam system is a topic of interest in research studies. This system involves a flexible beam attached to the center of a disk, and the control and stabilization of this system have been extensively studied. This research focuses on the case where the center of mass is fixed in an inertial frame, and the rotation of the center is non-uniform. The system is represented by a set of nonlinear coupled partial differential equations and ordinary differential equations. The boundary stabilization problem of this system via a delayed boundary control is considered. We assume that the boundary control is either of a force type control or a moment type control and is subject to the presence of a constant time-delay. The aim of this research is threefold: First, we demonstrate that the rotating disk-beam system is well-posed in an appropriate functional space. Then, we establish the exponential stability property of the system. Finally, we provide numerical simulations that illustrate the theoretical findings. The research utilizes the semigroup theory to establish the well-posedness of the system. The resolvent method is then employed to prove the exponential stability property. Finally, the finite element method is used to demonstrate the theoretical results through numerical simulations. The research findings indicate that the rotating disk-beam system can be stabilized using a boundary control with a time delay. The proof of stability is based on the resolvent method and a variation of constants formula. The numerical simulations further illustrate the theoretical results. The findings have potential implications for the design and implementation of control strategies in similar systems. In conclusion, this research demonstrates that the rotating disk-beam system can be stabilized using a boundary control with time delay. The well-posedness and exponential stability properties are established through theoretical analysis, and these findings are further supported by numerical simulations. The research contributes to the understanding and practical application of control strategies for flexible structures, providing insights into the stability of rotating disk-beam systems.Keywords: rotating disk-beam, delayed force control, delayed moment control, torque control, exponential stability
Procedia PDF Downloads 75