Results 21 to 30 of about 2,231 (145)
Radicals and idempotents II [PDF]
, 2022 Continuing the study of interactions between radical theory and corners, subrings of the form eAe, where e is an idempotent of a ring A, we examine radicals characterized by the presence or absence of idempotents of various types, relative versions of ...
Barry Gardner (14737198) +1 more
core
Idempotents and structures of rings [PDF]
, 2016 Recall that an n-by-n generalized matrix ring is defined in terms of sets of rings (Formula presented.)-bimodules (Formula presented.) and bimodule homomorphisms (Formula presented.), where the set of diagonal matrix units (Formula presented.) form a ...
Birkenmeier, G. F. +2 more
core +1 more source
Bounds for the number of idempotents in finite rings [PDF]
, 2022 We find bounds for the number of idempotents in a ring of matrices over an arbitrary finite commutative ring. Using these results, we find a bound on the number of idempotents in an arbitrary finite ring, whereby we improve upon the currently known ...
Dolžan, David
core +1 more source
On inverse categories with split idempotents [PDF]
, 2015 summary:We present some special properties of inverse categories with split idempotents. First, we examine a Clifford-Leech type theorem relative to such inverse categories.
Schwab, Emil Daniel, Schwab, Emil
core +1 more source
Algebras generated by two idempotents [PDF]
, 1981 It is shown that a noncommutative simple algebra generated over a field F by two idempotents is necessarily the ring of 2×2 matrices over a simple extension of F, and that every matrix ring over a field K can be generated over K by three ...
Laffey, Thomas J., Thomas J. Laffey
core +1 more source
CoRR, 2013 Together with a characteristic function, idempotent permutations uniquely determine idempotent maps, as well as their linearly ordered arrangement simultaneously. Furthermore, in-place linear time transformations are possible between them. Hence, they may be important for succinct data structures, information storing, sorting and searching.
openaire +2 more sources
On Discrete Idempotent Paths [PDF]
, 2019 The set of discrete lattice paths from (0, 0) to (n, n) with North and East steps (i.e. words w $\in$ { x, y } * such that |w| x = |w| y = n) has a canonical monoid structure inherited from the bijection with the set of join-continuous maps from the chain { 0, 1,. .. , n } to itself.
openaire +2 more sources
Lifting Idempotents in Associative Pairs [PDF]
, 1999 In 1977, Nicholson developed the theory of suitable rings (Trans. Amer. Math. Soc.229 (1977), 269–278), namely, those in which idempotents lift modulo every left (right) ideal.
Sánchez Campos, Esperanza +5 more
core +1 more source
The Annals of Mathematical Statistics, 1966 The author introduces a lemma to prove rather special theorems on the independence of quadratic forms.
openaire +3 more sources
Idempotents in Cyclic Codes [PDF]
, 2012 Cyclic codes give us the most probable method by which we may detect and correct data transmission errors. These codes depend on the development of advanced mathematical concepts.
NC DOCKS at East Carolina University +1 more
core