scholarly journals Prime i-Ideals in Ordered n-ary Semigroups

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 491
Author(s):  
Patchara Pornsurat ◽  
Pakorn Palakawong na Ayutthaya ◽  
Bundit Pibaljommee
Keyword(s):  
Nonempty Subset

We study the concept of i-ideal of an ordered n-ary semigroup and give a construction of the i-ideal of an ordered n-ary semigroup generated by its nonempty subset. Moreover, we study the notions of prime, weakly prime, semiprime and weakly semiprime ideals of an ordered n-ary semigroup.

scholarly journals Hyperfinite and standard unifications for physical theories

2001 ◽  
Vol 28 (2) ◽  
pp. 93-102 ◽  
Author(s):  
Robert A. Herrmann
Keyword(s):  
Nonempty Subset ◽  
Natural Systems ◽  
Consequence Operators

A set of physical theories is represented by a nonempty subset{SNjV|j∈ℕ}of the lattice of consequence operators defined on a languageΛ. It is established that there exists a unifying injection𝒮defined on the nonempty set of significant representations for natural systemsM⊂Λ. IfW∈M, then𝒮Wis a hyperfinite ultralogic and⋃{SNjV(W)|j∈ℕ}=𝒮W(*W)∩Λ. A “product” hyperfinite ultralogicΠis defined on internal subsets of the product set*Λmand is shown to represent the application of𝒮to{W1,…,Wm}⊂M. There also exists a standard unifying injectionSWsuch that𝒮W(*W)⊂*SW(*W).

scholarly journals Decomposable Convexities in Graphs and Hypergraphs

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Francesco M. Malvestuto
Keyword(s):  
Convex Hull ◽  
Convex Sets ◽  
Nonempty Subset ◽  
Convex Set ◽  
Convex Geometry ◽  
Convexity Space ◽  
Vertex Set ◽  
Convex Geometries ◽  
Acyclic Hypergraph ◽  
Maximal Clusters

Given a connected hypergraph with vertex set V, a convexity space on is a subset of the powerset of V that contains ∅, V, and the singletons; furthermore, is closed under intersection and every set in is connected in . The members of are called convex sets. The convex hull of a subset X of V is the smallest convex set containing X. By a cluster of we mean any nonempty subset of V in which every two vertices are separated by no convex set. We say that a convexity space on is decomposable if it satisfies the following three axioms: (i) the maximal clusters of form an acyclic hypergraph, (ii) every maximal cluster of is a convex set, and (iii) for every nonempty vertex set X, a vertex does not belong to the convex hull of X if and only if it is separated from X by a convex cluster. We prove that a decomposable convexity space on is fully specified by the maximal clusters of in that (1) there is a closed formula which expresses the convex hull of a set in terms of certain convex clusters of and (2) is a convex geometry if and only if the subspaces of induced by maximal clusters of are all convex geometries. Finally, we prove the decomposability of some known convexities in graphs and hypergraphs taken from the literature (such as “monophonic” and “canonical” convexities in hypergraphs and “all-paths” convexity in graphs).

scholarly journals Green’s Relations on a Semigroup of Transformations with Restricted Range that Preserves an Equivalence Relation and a Cross-Section

Mathematics ◽  
2018 ◽  
Vol 6 (8) ◽  
pp. 134
Author(s):  
Chollawat Pookpienlert ◽  
Preeyanuch Honyam ◽  
Jintana Sanwong
Keyword(s):  
Cross Section ◽  
Equivalence Relation ◽  
Nonempty Subset ◽  
Identity Relation ◽  
Green’S Relations ◽  
Restricted Range ◽  
Green's Relations ◽  
Semigroup Of Transformations

Let T(X,Y) be the semigroup consisting of all total transformations from X into a fixed nonempty subset Y of X. For an equivalence relation ρ on X, let ρ^ be the restriction of ρ on Y, R a cross-section of Y/ρ^ and define T(X,Y,ρ,R) to be the set of all total transformations α from X into Y such that α preserves both ρ (if (a,b)∈ρ, then (aα,bα)∈ρ) and R (if r∈R, then rα∈R). T(X,Y,ρ,R) is then a subsemigroup of T(X,Y). In this paper, we give descriptions of Green’s relations on T(X,Y,ρ,R), and these results extend the results on T(X,Y) and T(X,ρ,R) when taking ρ to be the identity relation and Y=X, respectively.

Uniform Harmonic Approximation with Continuous Extension to the Boundary

1988 ◽  
Vol 40 (6) ◽  
pp. 1375-1388 ◽  
Author(s):  
M. Goldstein ◽  
W. H. Ow
Keyword(s):  
Complex Plane ◽  
Nonempty Subset ◽  
Harmonic Approximation ◽  
Continuous Extension ◽  
Partial Derivatives ◽  
Extended Plane ◽  
The One ◽  
Image Position ◽  
One Point Compactification

Let G be a domain in the complex plane and F a nonempty subset of G such that F is the closure in G of its interior F0. We will say f ∊ C1(F) if f is continuous on F and possesses continuous first partial derivatives in F which extend continuously to F as finite-valued functions. Let G* – F be connected and locally connected, f ∊ C1(F) be harmonic in F0, and E be a subset of ∂F ∩ ∂G (here G* denotes the one-point compactification of G and the boundaries ∂F, ∂G are taken in the extended plane). Suppose there is a sequence 〈hn〉 of functions harmonic in G such thatuniformly on F as n → ∞.

On Asymptotic Centers and Fixed Points of Nonexpansive Mappings

1980 ◽  
Vol 32 (2) ◽  
pp. 421-430 ◽  
Author(s):  
Teck-Cheong Lim
Keyword(s):  
Banach Space ◽  
Fixed Points ◽  
Nonempty Subset ◽  
Nonexpansive Mappings ◽  
Chebyshev Center ◽  
Bounded Subset ◽  
Uniformly Convex ◽  
Weakly Compact ◽  
Asymptotic Centers ◽  
Image Position

Let X be a Banach space and B a bounded subset of X. For each x ∈ X, define R(x) = sup{‖x – y‖ : y ∈ B}. If C is a nonempty subset of X, we call the number R = inƒ{R(x) : x ∈ C} the Chebyshev radius of B in C and the set the Chebyshev center of B in C. It is well known that if C is weakly compact and convex, then and if, in addition, X is uniformly convex, then the Chebyshev center is unique; see e.g., [9].Let {Bα : α ∈ ∧} be a decreasing net of bounded subsets of X. For each x ∈ X and each α ∈ ∧, define

A Note on "Implicit Mann Fixed Point Iterations for Pseudo-Contractive Mappings"

2011 ◽  
Vol 393-395 ◽  
pp. 543-545
Author(s):  
Hong Jun Li ◽  
Yong Fu Su
Keyword(s):  
Fixed Point ◽  
Convergence Theorem ◽  
Nonempty Subset ◽  
Applied Mathematics ◽  
Iteration Process ◽  
Implicit Iteration Process ◽  
Contractive Mappings ◽  
Contractive Map ◽  
Fixed Point Iterations ◽  
Implicit Iteration

Ljubomir Ciric, Arif Rafiq, Nenad Cakic, Jeong Sheok Umed [ Implicit Mann fixed point iterations for pseudo-contractive mappings, Applied Mathematics Letters 22 (2009) 581-584] introduced and investigated a modified Mann implicit iteration process for continuous hemi-contractive map. They proved the relatively convergence theorem. However, the content of mann theorem is fuzzy. In this paper, we will give some comments . Let be a Banach space and be a nonempty subset of . A mapping is called hemi-contractive (see [1]) if and In [1], the authors introduced and investigated a modified Mann implicit iteration process for continuous hemi-contractive map. They proved the following convergence theorem.

scholarly journals Some New Classes of Open Distance-Pattern Uniform Graphs

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Bibin K. Jose
Keyword(s):  
Nonempty Subset ◽  
Chordal Graphs ◽  
Outerplanar Graph ◽  
Outerplanar Graphs ◽  
Induced Subgraphs ◽  
Minimum Cardinality ◽  
Maximal Outerplanar Graphs ◽  
Split Graphs ◽  
Strongly Chordal Graphs

Given an arbitrary nonempty subset M of vertices in a graph G=(V,E), each vertex u in G is associated with the set fMo(u)={d(u,v):v∈M,u≠v} and called its open M-distance-pattern. The graph G is called open distance-pattern uniform (odpu-) graph if there exists a subset M of V(G) such that fMo(u)=fMo(v) for all u,v∈V(G), and M is called an open distance-pattern uniform (odpu-) set of G. The minimum cardinality of an odpu-set in G, if it exists, is called the odpu-number of G and is denoted by od(G). Given some property P, we establish characterization of odpu-graph with property P. In this paper, we characterize odpu-chordal graphs, and thereby characterize interval graphs, split graphs, strongly chordal graphs, maximal outerplanar graphs, and ptolemaic graphs that are odpu-graphs. We also characterize odpu-self-complementary graphs, odpu-distance-hereditary graphs, and odpu-cographs. We prove that the odpu-number of cographs is even and establish that any graph G can be embedded into a self-complementary odpu-graph H, such that G and G¯ are induced subgraphs of H. We also prove that the odpu-number of a maximal outerplanar graph is either 2 or 5.

scholarly journals On the Set Version of Selectively Star-CCC Spaces

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Ljubiša D. R. Kočinac ◽  
Sumit Singh
Keyword(s):  
Nonempty Subset ◽  
Topological Properties ◽  
Open Problems ◽  
The Relationship

A space X is said to be set selectively star-ccc if for each nonempty subset B of X , for each collection U of open sets in X such that B ¯ ⊂ ∪ U , and for each sequence A n : n ∈ ℕ of maximal cellular open families in X , there is a sequence A n : n ∈ ℕ such that, for each n ∈ ℕ , A n ∈ A n and B ⊂ St ∪ n ∈ ℕ A n , U . In this paper, we introduce set selectively star-ccc spaces and investigate the relationship between set selectively star-ccc and other related spaces. We also study the topological properties of set selectively star-ccc spaces. Some open problems are posed.

scholarly journals Remarks on uniformly symmetrically continuous functions

2016 ◽  
Vol 09 (03) ◽  
pp. 1650069
Author(s):  
Tammatada Khemaratchatakumthorn ◽  
Prapanpong Pongsriiam
Keyword(s):  
Real Line ◽  
Nonempty Subset ◽  
Continuous Functions ◽  
The Real ◽  
Definition Of ◽  
Symmetrically Continuous Functions ◽  
Uniformly Continuous

We give the definition of uniform symmetric continuity for functions defined on a nonempty subset of the real line. Then we investigate the properties of uniformly symmetrically continuous functions and compare them with those of symmetrically continuous functions and uniformly continuous functions. We obtain some characterizations of uniformly symmetrically continuous functions. Several examples are also given.

scholarly journals Controllability of the Semilinear Heat Equation with Impulses and Delay on the State

2015 ◽  
Vol 2 (1) ◽  
Author(s):  
Hugo Leiva
Keyword(s):  
Continuous Function ◽  
Characteristic Function ◽  
Heat Equation ◽  
Bounded Domain ◽  
Distributed Control ◽  
Approximate Controllability ◽  
Nonempty Subset ◽  
Nonlinear Functions ◽  
Semilinear Heat Equation ◽  
Approximately Controllable

AbstractIn this paper we prove the interior approximate controllability of the following Semilinear Heat Equation with Impulses and Delaywhere Ω is a bounded domain in RN(N ≥ 1), φ : [−r, 0] × Ω → ℝ is a continuous function, ! is an open nonempty subset of Ω, 1ω denotes the characteristic function of the set ! and the distributed control u be- longs to L2([0, τ]; L2(Ω; )). Here r ≥ 0 is the delay and the nonlinear functions f , Ik : [0, τ] × ℝ × ℝ → ℝ are smooth enough, such thatUnder this condition we prove the following statement: For all open nonempty subset ! of Ω the system is approximately controllable on [0, τ], for all τ > 0.

Sign in / Sign up

Export Citation Format

Share Document