Results 21 to 30 of about 174,866,847 (300)

Enumerating finite class-2-nilpotent groups on 2 generators [PDF]

open access: yes, 2009
We compute the numbers g(n,2,2) of nilpotent groups of order n, of class atmost 2 generated by at most 2 generators, by giving an explicit formula for theDirichlet generating function \sum_{n=1}^\infty g(n,2,2)n^{-s}
Voll, Christopher
core   +2 more sources

Fukaya categories of surfaces, spherical objects and mapping class groups

open access: yesForum of Mathematics, Sigma, 2021
We prove that every spherical object in the derived Fukaya category of a closed surface of genus at least $2$ whose Chern character represents a nonzero Hochschild homology class is quasi-isomorphic to a simple closed curve equipped with a rank $1 ...
Denis Auroux, Ivan Smith
doaj   +1 more source

Finding a class of 2-groups; pp. 370–374 [PDF]

open access: yesProceedings of the Estonian Academy of Sciences, 2010
Let n ³ ≥3 be an integer and Cm denote a cyclic group of order m. All groups which can be presented as a semidirect products (C2n x C2n) ⋋C4 are described. These groups are given by generators and defining relations.
Tatjana Tamberg
doaj   +1 more source

Uniform system for grouping of steels in welding manufacture by ISO/TR 15608

open access: yesЛитьë и металлургия, 2020
Recommendations to assign steel grades most commonly used in industry and energy of the Republic of Belarus to a specific group and subgroup of the international standard ISO/TR 15608 are presented.
T. I. Bendik   +3 more
doaj   +1 more source

Class-preserving Coleman automorphisms of some classes of finite groups

open access: yesOpen Mathematics, 2022
The normalizer problem of integral group rings has been studied extensively in recent years due to its connection with the longstanding isomorphism problem of integral group rings.
Hai Jingjing, Li Zhengxing, Ling Xian
doaj   +1 more source

Research on a Class of Special Quasi TA-Neutrosophic Extended Triplet: TA-Groups [PDF]

open access: yesNeutrosophic Sets and Systems, 2023
Tarski associative groupoid (TA-groupoid) and Tarski associative neutrosophic extended triplet groupoid (TA-NET-groupoid) are two interesting structures in non-associative algebra. In this paper, a new concept of TA-group is proposed based on TA-groupoid,
Mingming Chen, Yudan Du, Xiaogang An
doaj   +1 more source

$p$-groups with maximal elementary abelian subgroups of rank $2$ [PDF]

open access: yes, 2010
Let p be an odd prime number and G a finite p-group. We prove that if the rank of G is greater than p, then G has no maximal elementary abelian subgroup of rank 2.
Mazza, Nadia, Glauberman, George
core   +4 more sources

On the Class Group and the Local Class Group of a Pullback

open access: yesJournal of Algebra, 1996
Let \(M\) be a non-zero maximal ideal of an integral domain \(T\), \(k=T/M\), \(\varphi: T\to k\) the natural homomorphism, and \(D\) a proper subring of \(k\). Let \(R\) be the pullback \[ \begin{tikzcd} R \ar[r] \ar[d] & D\ar[d] \\ T\ar[r,"\varphi"'] & k=T/M \quad .
FONTANA, Marco, Gabelli S.
openaire   +5 more sources

Every abelian group is a class group [PDF]

open access: yesPacific Journal of Mathematics, 1966
Let T be the set of minimal primes of a Krull domain A. If S is a subset of T9 we form B = n AP for PeS and study the relation of the class group of B to that of A. We find that the class group of B is always a homomorphic image of that of A. We use this type of construction to obtain a Krull domain with specified class group and then alter such a ...
openaire   +2 more sources

A class of c-groups [PDF]

open access: yesJournal of the Australian Mathematical Society, 1969
In a paper by Polimeni [3] the concept of a c-group was introduced. A group is called a c-group if and only if every subnormal subgroup is characteristic. His paper claims to characterize finite soluble c-groups, which we will call fsc-groups. There are some errors in this paper; see the forthcoming review by K. W. Gruenberg in Mathematical Reviews.
Cimana, A. R., Gagen, T. M.
openaire   +2 more sources

Home - About - Disclaimer - Privacy