All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 12 Next

Displaying 221 – 240 of 2554

Showing per page

Algebraic analysis in structures with the Kaplansky-Jacobson property

D. Przeworska-Rolewicz (2005)

Studia Mathematica

In 1950 N. Jacobson proved that if u is an element of a ring with unit such that u has more than one right inverse, then it has infinitely many right inverses. He also mentioned that I. Kaplansky proved this in another way. Recently, K. P. Shum and Y. Q. Gao gave a new (non-constructive) proof of the Kaplansky-Jacobson theorem for monoids admitting a ring structure. We generalize that theorem to monoids without any ring structure and we show the consequences of the generalized Kaplansky-Jacobson...

Algebraic and graph-theoretic properties of infinite n -posets

Zoltán Ésik, Zoltán L. Németh (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A Σ -labeled n -poset is an (at most) countable set, labeled in the set Σ , equipped with n partial orders. The collection of all Σ -labeled n -posets is naturally equipped with n binary product operations and n ω -ary product operations. Moreover, the ω -ary product operations give rise to n ...

Algebraic and graph-theoretic properties of infinite n-posets

Zoltán Ésik, Zoltán L. Németh (2010)

RAIRO - Theoretical Informatics and Applications

A Σ-labeled n-poset is an (at most) countable set, labeled in the set Σ, equipped with n partial orders. The collection of all Σ-labeled n-posets is naturally equipped with n binary product operations and nω-ary product operations. Moreover, the ω-ary product operations give rise to nω-power operations. We show that those Σ-labeled n-posets that can be generated from the singletons by the binary and ω-ary product operations form the free algebra on Σ in a variety axiomatizable by an infinite collection...

Algebraic approach to locally finite trees with one end

Bohdan Zelinka (2003)

Mathematica Bohemica

Let T be an infinite locally finite tree. We say that T has exactly one end, if in T any two one-way infinite paths have a common rest (infinite subpath). The paper describes the structure of such trees and tries to formalize it by algebraic means, namely by means of acyclic monounary algebras or tree semilattices. In these algebraic structures the homomorpisms and direct products are considered and investigated with the aim of showing, whether they give algebras with the required properties. At...

All completely regular elements in H y p G ( n )

Ampika Boonmee, Sorasak Leeratanavalee (2013)

Discussiones Mathematicae - General Algebra and Applications

In Universal Algebra, identities are used to classify algebras into collections, called varieties and hyperidentities are use to classify varieties into collections, called hypervarities. The concept of a hypersubstitution is a tool to study hyperidentities and hypervarieties. Generalized hypersubstitutions and strong identities generalize the concepts of a hypersubstitution and of a hyperidentity, respectively. The set of all generalized hypersubstitutions forms a monoid. In...

Amenability properties of Figà-Talamanca-Herz algebras on inverse semigroups

Hasan Pourmahmood-Aghababa (2016)

Studia Mathematica

This paper continues the joint work with A. R. Medghalchi (2012) and the author’s recent work (2015). For an inverse semigroup S, it is shown that A p ( S ) has a bounded approximate identity if and only if l¹(S) is amenable (a generalization of Leptin’s theorem) and that A(S), the Fourier algebra of S, is operator amenable if and only if l¹(S) is amenable (a generalization of Ruan’s theorem).

Currently displaying 221 – 240 of 2554