Results 261 to 270 of about 7,060,020 (301)
Some of the next articles are maybe not open access.
The Annals of Mathematics, 1955
odd order are soluble. We shall use the term involution for a group element of order 2. If m is the total number of involutions of 65 and if we set n = g/m, the same method shows that 65 contains a normal subgroup V distinct from 5 such that the index of V is either 2 or is less than [n(n + 2)/2]!
Brauer, Richard, Fowler, K. A.
openaire +2 more sources
odd order are soluble. We shall use the term involution for a group element of order 2. If m is the total number of involutions of 65 and if we set n = g/m, the same method shows that 65 contains a normal subgroup V distinct from 5 such that the index of V is either 2 or is less than [n(n + 2)/2]!
Brauer, Richard, Fowler, K. A.
openaire +2 more sources
The Largest Group Contained in the Order Completion of a Totally Ordered Group
p-Adic Numbers, Ultrametric Analysis and Applications, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muci, Adrialy, Olivos, Elena
openaire +1 more source
Algebra and Logic, 2003
\textit{P. Dehornoy} [J. Knot Theory Ramifications 4, No. 1, 33-79 (1995; Zbl 0873.20030)] has proved that the braid group \(B(n)\) possesses a right linear order, i.e., a right linear order such that \(x\leq y\) implies \(xz\leq yz\) for any \(x,y,z\in B(n)\).
openaire +2 more sources
\textit{P. Dehornoy} [J. Knot Theory Ramifications 4, No. 1, 33-79 (1995; Zbl 0873.20030)] has proved that the braid group \(B(n)\) possesses a right linear order, i.e., a right linear order such that \(x\leq y\) implies \(xz\leq yz\) for any \(x,y,z\in B(n)\).
openaire +2 more sources
1999
Recent progress in computational representation theory is surveyed. As an application of some methods for constructing ordinary character tables Brauer pairs among 2-groups of order up to 28 are determined. Furthermore the present status of the library of the tables of marks for simple groups which is available in GAPis described.
Bettina Eick, Eamonn A. O'Brien
openaire +2 more sources
Recent progress in computational representation theory is surveyed. As an application of some methods for constructing ordinary character tables Brauer pairs among 2-groups of order up to 28 are determined. Furthermore the present status of the library of the tables of marks for simple groups which is available in GAPis described.
Bettina Eick, Eamonn A. O'Brien
openaire +2 more sources
On determining the order of a group
Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976The recent past has seen a proliferation of algorithms designed to carry out a variety of calculations with groups. Chief among these is a family of algorithms for determining the order of a group. While computing the order of a group is often of great interest in itself, the importance of many of these algorithms lies in the fact that they also ...
openaire +1 more source
ON THE ORDERS OF AUTOMORPHISM GROUPS OF FINITE GROUPS
Bulletin of the London Mathematical Society, 2005Summary: In the Kourovka notebook, Deaconescu asks whether \(|\Aut G|\geq\varphi(|G|)\) for all finite groups \(G\), where \(\varphi\) denotes the Euler totient function, and whether \(G\) is cyclic whenever \(|\Aut G|=\varphi(|G|)\). Both questions are answered in the negative in this paper.
Bray, John N., Wilson, Robert A.
openaire +2 more sources
Order-automorphism groups of Archimedean ordered groups
Canadian Mathematical BulletinAbstractThe group of order-preserving automorphisms of a finitely generated Archimedean ordered group of rank $2$ is either infinite cyclic or trivial according as the ratio in $\mathbb {R}$ of the generators of the subgroup is or is not quadratic over $\mathbb {Q}.$ In the case of an Archimedean ordered group of rank $2$ that is not finitely ...
openaire +2 more sources
Ordered groups and ordered geometries
Journal of Geometry, 2014The authors study the relationship between ordered geometries and ordered groups. They show that a singular metric plane in the sense of \textit{F. Bachmann} [Ebene Spiegelungsgeometrie. Eine Vorlesung über Hjelmslev-Gruppen. Mannheim etc.: BI-Wissenschaftsverlag (1989; Zbl 0681.51001)] can be ordered if and only if the translation group admits an ...
Struve, Rolf, Struve, Horst
openaire +1 more source
DIAGRAM GROUPS, BRAID GROUPS, AND ORDERABILITY
Journal of Knot Theory and Its Ramifications, 2003We prove that all diagram groups (in the sense of Guba and Sapir) are left-orderable. The proof is in two steps: firstly, it is proved that all diagram groups inject in a certain braid group on infinitely many strings, and secondly, this group is then shown to be left-orderable.
openaire +2 more sources

