Results 1 to 10 of about 2,430,096 (99)
On Periodic Shunkov’s Groups with Almost Layer-finite Normalizers of Finite Subgroups
Известия Иркутского государственного университета: Серия "Математика", 2021 Layer-finite groups first appeared in the work by S.~N.~Chernikov (1945). Almost layer-finite groups are extensions of layer-finite groups by finite groups.
V.I. Senashov
doaj +1 more source
On Periodic Groups of Shunkov with the Chernikov Centralizers of Involutions
Известия Иркутского государственного университета: Серия "Математика", 2020 Layer-finite groups first appeared in the work by S.~N.~Chernikov (1945). Almost layer-finite groups are extensions of layer-finite groups by finite groups.
V.I. Senashov
doaj +1 more source
IDEALS AND FINITENESS CONDITIONS FOR SUBSEMIGROUPS [PDF]
Glasgow Mathematical Journal, 2013 AbstractIn this paper we consider a number of finiteness conditions for semigroups related to their ideal structure, and ask whether such conditions are preserved by sub- or supersemigroups with finite Rees or Green index. Specific properties under consideration include stability,$\mathcal{D}=\mathcal{J}$and minimal conditions on ideals.
Gray, Robert Duncan +3 more
openaire +6 more sources
A commutativity‐or‐finiteness condition for rings [PDF]
International Journal of Mathematics and Mathematical Sciences, 2004 We show that a ring with only finitely many noncentral subrings must be either commutative or finite.
Abraham A. Klein, Howard E. Bell
openaire +3 more sources
ON SEPARABILITY FINITENESS CONDITIONS IN SEMIGROUPS [PDF]
Journal of the Australian Mathematical Society, 2021 AbstractTaking residual finiteness as a starting point, we consider three related finiteness properties: weak subsemigroup separability, strong subsemigroup separability and complete separability. We investigate whether each of these properties is inherited by Schützenberger groups.
CRAIG MILLER +3 more
openaire +4 more sources
Finiteness Conditions for Strictness Analysis
DAIMI Report Series, 1993 We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work both in the syntax-directed nature of the approach and in the ability to deal with Wadler's method for analysing lists. Limitations of the method are indicated.
Flemming Nielson, Hanne Riis Nielson
openaire +3 more sources
Finiteness Conditions for a Group of Finite Exponent
Journal of Algebra, 1993 A periodic group \(G\) all of whose \(d\)-generator subgroups (for fixed \(d > 1\)) are solvable need not itself be solvable (Golod), and similarly for nilpotence. However if \(G\) is finite, then the solvability of every 2- generator subgroup entails the solvability of \(G\) (Thompson), and likewise for nilpotence.
openaire +2 more sources
A finiteness condition for rewriting systems
Theoretical Computer Science, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Craig C. Squier +2 more
openaire +1 more source
A uniqueness condition for finite measures [PDF]
Proceedings of the American Mathematical Society, 1990 Let μ \mu and
openaire +1 more source
On finite exchangeability and conditional independence [PDF]
Electronic Journal of Statistics, 2020 25 pages, 2 ...
openaire +5 more sources