Results 101 to 110 of about 3,737,715 (136)
Some of the next articles are maybe not open access.

FINITE GROUPS WITH CENTRALIZER CONDITION

Mathematics of the USSR-Izvestiya, 1967
In the present article we study finite groups whose non-primary maximal nilpotent subgroups have pairwise trivial intersection. The results obtained carry over to locally finite groups.
openaire   +2 more sources

The use of GIS and Remote Sensing Data in Determining the Condition of Green Areas in Kyiv

16th International Conference Monitoring of Geological Processes and Ecological Condition of the Environment, 2022
N. Korohoda, O. Halahan, O. Kovtoniuk
semanticscholar   +1 more source

Finiteness Conditions for Semigroups

1999
The study of finiteness conditions for semigroups consists in giving some conditions which are satisfied by finite semigroups and which are such as to assure the finiteness of them. In this study one of the properties which is generally required of a semigroup is that of being finitely generated.
Aldo de Luca, Stefano Varricchio
openaire   +1 more source

Finiteness Conditions for Modules

1987
In this book all rings considered are associative rings with unit unless otherwise stated. We write R for such a ring, 1 ∈ R is its unit element. A left R-module is an abelian group (the group law is denoted additively) with a scalar multiplication R × M → M, (a,x) ↦ ax satisfying the following properties: (1.) (a+b)x = ax + bx for x ∈ M, a, ∈ R
Constantin Nǎstǎsescu   +1 more
openaire   +1 more source

Finiteness Conditions for Modules

1974
The first round of generalities is over, and it is now time for us to apply this formal machinery to the study of specific classes of rings and modules. We begin in this chapter with an investigation of the structure of classes of modules having certain natural finiteness properties. In the next chapter we return to the rings themselves.
Frank W. Anderson, Kent R. Fuller
openaire   +1 more source

Finiteness Conditions for Lattices

1987
Let ≤ denote a partial ordering on a nonempty set L and let < be defined by: a < b with a,b ∈ L if and only if a ≤ b and a ≠ b. If a,b ∈ L and b ≤ a then a is said to contain b. If M is a subset of L, then an a ∈ L such that x ≤ a, resp. a ≤ x, for all x ∈ M is said to be an upper, resp. lower, bound for the set M.
Constantin Nǎstǎsescu   +1 more
openaire   +1 more source

Monitoring of the condition of agricultural crops based on the use of clustering methods

15th International Conference Monitoring of Geological Processes and Ecological Condition of the Environment, 2021
H. Hnatiienko, V. Domrachev, V. Saiko
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy