نتایج جستجو برای: proximally commuting mappings

تعداد نتایج: 29855  

Journal: :journal of linear and topological algebra (jlta) 0
m azadi department of mathematics, islamic azad university, centeral tehran branch, tehran, iran. h amadi department of mathematics, islamic azad university, centeral tehran branch, tehran, iran.

in this paper we study the existence of commuting regular elements, verifying the notion left (right) commuting regular elements and its properties in the groupoid g(n) . also we show that g(n) contains commuting regular subsemigroup and give a necessary and sucient condition for the groupoid g(n) to be commuting regular.

‎Let $G$ be a finite non-abelian group with center $Z(G)$‎. ‎The non-commuting graph of $G$ is a simple undirected graph whose vertex set is $Gsetminus Z(G)$ and two vertices $x$ and $y$ are adjacent if and only if $xy ne yx$‎. ‎In this paper‎, we compute Laplacian energy of the non-commuting graphs of some classes of finite non-abelian groups‎..

2004
NASEER SHAHZAD

Let S be a subset of a normed space X = (X ,‖ · ‖) and T and I self-mappings of X . Then T is called (1) nonexpansive on S if ‖Tx− Ty‖ ≤ ‖x− y‖ for all x, y ∈ S; (2) Inonexpansive on S if ‖Tx − Ty‖ ≤ ‖Ix − I y‖ for all x, y ∈ S; (3) I-contraction on S if there exists k ∈ [0,1) such that ‖Tx − Ty‖ ≤ k‖Ix − I y‖ for all x, y ∈ S. The set of fixed points of T (resp., I) is denoted by F(T) (resp., ...

Journal: :Set-valued and Variational Analysis 2021

In this article we study some geometric properties of proximally smooth sets. First, introduce a modification the metric projection and prove its existence. Then provide an algorithm for constructing rectifiable curve between two sufficiently close points set in uniformly convex Banach space, with moduli smoothness convexity power type. Our returns reasonably short set, is iterative uses our pr...

Journal: :bulletin of the iranian mathematical society 2013
a. azad s. fouladi r. orfi

let g be a group. a subset x of g is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in x. if |x| ≥ |y | for any other set of pairwise non-commuting elements y in g, then x is said to be a maximal subset of pairwise non-commuting elements. in this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

Let G be a group. A subset X of G is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in X. If |X| ≥ |Y | for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید