Additional Information
| Author(s) | Pop, Adina, Pop, Maria Sânziana |
|---|
On some relations on n-monoids
Maria Sânziana Pop ♦ Adina Pop
Abstract
carpathian_2004_20_087_094_abstractFull PDF
carpathian_2004_20_087_094In this paper we introduce the notion of n-monoid, n > 2, and we generalize for n-monoids two relations defined by F. Wehrung on the binary case. These relations can be interpreted as a ”distance” between a n-monoid and the set of n-groups.
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration