Search Results for ""

The projective general linear group PGL_n(q) is the group obtained from the general linear group GL_n(q) on factoring by the scalar matrices contained in that group.

The Rudvalis group is the sporadic group Ru of order |Ru| = 145926144000 (1) = 2^(14)·3^3·5^3·7·13·29. (2) It is implemented in the Wolfram Language as RudvalisGroupRu[].

The group of all nonsingular n×n stochastic matrices over a field F. It is denoted S(n,F). If p is prime and F is the finite field of order q=p^m, S(n,q) is written instead ...

The Suzuki group is the sporadic group Suz of order |Suz| = 448345497600 (1) = 2^(13)·3^7·5^2·7·11·13. (2) It is implemented in the Wolfram Language as SuzukiGroupSuz[].

The Thompson group is the sporadic group Th of order |Th| = 90745943887872000 (1) = 2^(15)·3^(10)·5^3·7^2·13·19·31. (2) It is implemented in the Wolfram Language as ...

A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...

For some constant alpha_0, alpha(f,z)<alpha_0 implies that z is an approximate zero of f, where alpha(f,z)=(|f(z)|)/(|f^'(z)|)sup_(k>1)|(f^((k))(z))/(k!f^'(z))|^(1/(k-1)). ...

The first Göllnitz-Gordon identity states that the number of partitions of n in which the minimal difference between parts is at least 2, and at least 4 between even parts, ...

The finite simple groups of Lie-type. They include four families of linear simple groups: PSL(n,q) (the projective special linear group), PSU(n,q) (the projective special ...