scholarly journals Algorithms for permutability in finite groups

2013 ◽  
Vol 11 (11) ◽  
Author(s):  
Adolfo Ballester-Bolinches ◽  
Enric Cosme-Llópez ◽  
Ramón Esteban-Romero
Keyword(s):  
Computer Algebra ◽  
Finite Groups ◽  
Computer Algebra System ◽  
Permutable Subgroups ◽  
Sylow Permutable

AbstractIn this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.

scholarly journals ON GENERALISED PRONORMAL SUBGROUPS OF FINITE GROUPS

2014 ◽  
Vol 56 (3) ◽  
pp. 691-703 ◽  
Author(s):  
A. BALLESTER-BOLINCHES ◽  
J. C. BEIDLEMAN ◽  
A. D. FELDMAN ◽  
M. F. RAGLAND
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Subnormal Subgroup ◽  
Normal Subgroups ◽  
Transitive Relation ◽  
Formula Group ◽  
Permutable Subgroups ◽  
Sylow Permutable ◽  
A Finite Group ◽  
Subnormal Subgroups

AbstractFor a formation $\mathfrak F$, a subgroup M of a finite group G is said to be $\mathfrak F$-pronormal in G if for each g ∈ G, there exists x ∈ 〈U,Ug〉$\mathfrak F$ such that Ux = Ug. Let f be a subgroup embedding functor such that f(G) contains the set of normal subgroups of G and is contained in the set of Sylow-permutable subgroups of G for every finite group G. Given such an f, let fT denote the class of finite groups in which f(G) is the set of subnormal subgroups of G; this is the class of all finite groups G in which to be in f(G) is a transitive relation in G. A subgroup M of a finite group G is said to be $\mathfrak F$-normal in G if G/CoreG(M) belongs to $\mathfrak F$. A subgroup U of a finite group G is called K-$\mathfrak F$-subnormal in G if either U = G or there exist subgroups U = U0 ≤ U1 ≤ . . . ≤ Un = G such that Ui–1 is either normal or $\mathfrak F$-normal in Ui, for i = 1,2, …, n. We call a finite group G an $fT_{\mathfrak F}$-group if every K-$\mathfrak F$-subnormal subgroup of G is in f(G). In this paper, we analyse for certain formations $\mathfrak F$ the structure of $fT_{\mathfrak F}$-groups. We pay special attention to the $\mathfrak F$-pronormal subgroups in this analysis.

On Sylow permutable subgroups of finite groups

2017 ◽  
Vol 29 (6) ◽  
Author(s):  
Adolfo Ballester-Bolinches ◽  
Hermann Heineken ◽  
Francesca Spagnuolo
Keyword(s):  
Finite Groups ◽  
Permutable Subgroups ◽  
Sylow Permutable

AbstractA subgroup

scholarly journals Generation of finite groups with cyclic Sylow subgroups

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Heiko Dietrich ◽  
Darren Low
Keyword(s):  
Computational Methods ◽  
Computer Algebra ◽  
Finite Groups ◽  
Computer Algebra System ◽  
Sylow Subgroups ◽  
Free Order

AbstractM. C. Slattery [Generation of groups of square-free order, J. Symbolic Comput.42 (2007), 6, 668–677] described computational methods to enumerate, construct and identify finite groups of squarefree order. We generalise Slattery’s result to the class of finite groups that have cyclic Sylow subgroups and provide an implementation for the computer algebra system GAP.

scholarly journals Study of conditions of existence of irreducible representations of finite groups by means of computer algebra system GAP

2021 ◽  
Vol 15 ◽  
pp. 105
Author(s):  
K.S. Mordak
Keyword(s):  
Computer Algebra ◽  
Finite Groups ◽  
Computer Algebra System ◽  
Irreducible Representations ◽  
Representations Of Finite Groups

We consider the criterion of existence of exact irreducible representations of finite groups and construct the algorithm that allows to verify it by means of computer algebra system GAP.

Generation of Correlated Logistic-Normal Random Variates for Medical Decision Trees

1998 ◽  
Vol 37 (03) ◽  
pp. 235-238 ◽  
Author(s):  
M. El-Taha ◽  
D. E. Clark
Keyword(s):  
Monte Carlo ◽  
Decision Trees ◽  
Computer Algebra ◽  
Taylor Series ◽  
Computer Algebra System ◽  
Random Variable ◽  
Monte Carlo Analysis ◽  
Normal Random Variable ◽  
Medical Decision ◽  
Theoretical Results

AbstractA Logistic-Normal random variable (Y) is obtained from a Normal random variable (X) by the relation Y = (ex)/(1 + ex). In Monte-Carlo analysis of decision trees, Logistic-Normal random variates may be used to model the branching probabilities. In some cases, the probabilities to be modeled may not be independent, and a method for generating correlated Logistic-Normal random variates would be useful. A technique for generating correlated Normal random variates has been previously described. Using Taylor Series approximations and the algebraic definitions of variance and covariance, we describe methods for estimating the means, variances, and covariances of Normal random variates which, after translation using the above formula, will result in Logistic-Normal random variates having approximately the desired means, variances, and covariances. Multiple simulations of the method using the Mathematica computer algebra system show satisfactory agreement with the theoretical results.

The Maple computer algebra system: A review

1995 ◽  
Vol 10 (3) ◽  
pp. 329-337 ◽  
Author(s):  
John Hutton ◽  
James Hutton
Keyword(s):  
Computer Algebra ◽  
Computer Algebra System ◽  
System A
Sign in / Sign up

Export Citation Format

Share Document