Search results

Page title matches

• information type = combinatorics| connective = of}}
3 KB (437 words) - 00:17, 26 November 2012

Page text matches

• ...cusses the element structure of the [[alternating group]] $A_n$ of finite degree $n$. Note that for $n = 0,1$, the alter ...oup $S_n$. $A_n$ is viewed naturally as the subgroup of $S_n$ comprising even permutations.
7 KB (1,139 words) - 22:58, 30 May 2012
• {{conjecture|additive combinatorics}} ...d-order abelian group]] and $A, B$ be subsets of $G$ of equal cardinality. Then, there is a bijection $\varphi:A \to B$
1 KB (159 words) - 03:33, 26 November 2012
• connective = of}} This article discusses [[symmetric group:S3]], the symmetric group of degree three. We denote its elements as acting on the set $\{ 1,2,3 \} 31 KB (4,384 words) - 16:38, 30 August 2015 • connective = of}} ...usses the element structure of [[symmetric group:S4]], the symmetric group of degree four. We denote its elements as acting on the set [itex]\{ 1,2,3,4 \ 40 KB (5,250 words) - 19:34, 29 June 2014 • | [[Orbit-counting theorem]] || Burnside's lemma, Cauchy-Frobenius lemma || Combinatorics, orbit counting ...lies solvable]] || Burnside's [itex]p^aq^b$ theorem || Forces groups of certain orders to be [[solvable group|solvable]].
479 bytes (59 words) - 01:34, 8 March 2011
• connective = of}} ...linear representation theory of the [[alternating group]] $A_n$ of finite degree $n$. Note that for $n = 0,1$, the alter
8 KB (1,072 words) - 05:00, 19 August 2012
• ...of degree two]] and some other related groups, both for a [[finite field]] of size $q$ and for related rings. ...led explanations of the order formulas''', see [[order formulas for linear groups]].
9 KB (1,399 words) - 22:29, 19 September 2012
• information type = combinatorics| connective = of}}
6 KB (840 words) - 20:07, 30 May 2015
• ...>n \ge 1[/itex] and some other related groups, both for a [[finite field]] of size $q$ and for related rings. ==For a finite field of size $q$==
35 KB (6,346 words) - 01:27, 8 July 2019
• #redirect [[combinatorics of symmetric groups]]
47 bytes (5 words) - 00:07, 26 November 2012
• information type = combinatorics| connective = of}}
3 KB (437 words) - 00:17, 26 November 2012
• ...–Navarro conjecture for covering groups of the symmetric and alternating groups in odd characteristic| journalname = Journal of Algebraic Combinatorics|
833 bytes (90 words) - 14:21, 25 May 2014