Results 91 to 100 of about 866 (222)
Semigroups of order-decreasing transformations
Let X be a totally ordered set and consider the semigroups of orderdecreasing (increasing) full (partial, partial one-to-one) transformations of X. In this Thesis the study of order-increasing full (partial, partial one-to-one) transformations has been
Umar, Abdullahi
core
On Signed Full Transformation Semigroup of a Finite Set
If we define [n] = {1,2,3,...,n} and [n*] = {±1,±2,±3...,±n}. A map α: [n] → [n*] is called a signed transformation on [n]. The collection of all these maps together with composition forms a semigroup called a signed transformation semigroup. Given that
Mbah, Moses Anayo +2 more
core +1 more source
Two-Sided Zero-Divisor Graphs of Order-Preserving and A-Decreasing Finite Transformation Semigroups
Let On(A) be the order-preserving and A-decreasing finite transformation semigroup on Xn = {1, 2, …, n}. It is known that On(A) has zero element if and only if 1 ∈ A. In this paper, we investigate zero-divisor graphs of On(A) where 1 ∈ A and n ≥ 4. First,
Kemal Toker, Muhammet Uysal
doaj +1 more source
UNIVERSAL COMPACTIFICATIONS OF TRANSFORMATION SEMIGROUPS [PDF]
We extend the notion of semigroup compactification to the class of transformation semigroups, and determine the compactifications which are universal with respect to some topological properties.
doaj
An efficient and mathematically sound method for simulating the distributions of telecommunication signals is the star-like semigroup convolution model. A rigorous operator-theoretic measure of signal strength is provided by the (S3I), which is obtained ...
Sulaiman Awwal Akinwunmi +1 more
doaj +1 more source
The global dissipative and multipeakon dissipative behavior of the two-component Camassa-Holm shallow water system after wave breaking was studied in this paper.
Yujuan Wang +2 more
doaj +1 more source
The Algebraic View of Computation: Implementation, Interpretation and Time
Computational implementations are special relations between what is computed and what computes it. Though the word “isomorphism” appears in philosophical discussions about the nature of implementations, it is used only metaphorically. Here we
Attila Egri-Nagy
doaj +1 more source
Let T(X) be a full transformation semigroup on a nonempty set X. The Cayley digraph Γ of a semigroup T(X) with respect to the Green’s L $\mathcal{L}$ -class is a digraph with vertex set T(X) and two vertices α, β ∈ T(X) are adjacent as an arc (α, β ...
Chaiya Yanisa +2 more
doaj +1 more source
On the Syntactic Monoids Associated with a Class of Synchronized Codes
A complete code C over an alphabet A is called synchronized if there exist x,y∈C* such that xA*∩A*y⊆C*. In this paper we describe the syntactic monoid Syn(C+) of C+ for a complete synchronized code C over A such that C+, the semigroup generated by C, is ...
Shou-feng Wang
doaj +1 more source
This paper deals with the stabilization problem of first-order hyperbolic partial differential equations (PDEs) with spatial-temporal actuation over the full physical domains.
Xin Yu +4 more
doaj +1 more source

