Klein four-group Created 2026-09-24 Updated 2026-09-24
The Klein four-group is the abelian group with three nonidentity elements, all of order two.
Composition series Created 2026-09-24 Updated 2026-09-28
Cauchy theorem for groups Created 2026-09-24 Updated 2026-10-03
Sylow theorems Created 2026-09-24 Updated 2026-10-03
If with , then has subgroups of order , every -subgroup lies in one, and all such Sylow subgroups are conjugate. Their number satisfies and .
Dihedral group Created 2026-09-24 Updated 2026-09-24
General linear group over a finite field Created 2026-09-24 Updated 2026-09-24
Simple group Created 2026-09-24 Updated 2026-09-29
Dicyclic group Created 2026-09-24 Updated 2026-10-07
Quaternion group Created 2026-09-24 Updated 2026-09-24
Symmetric group Created 2026-09-24 Updated 2026-09-24
P-group Created 2026-09-24 Updated 2026-09-24
Alternating group Created 2026-09-24 Updated 2026-10-05
Normal and separable implies Galois Created 2026-09-24 Updated 2026-09-24
A separable extension has embeddings in an algebraic closure, and normality makes every one an automorphism of . Hence a finite normal separable extension is Galois.
Galois group Created 2026-09-24 Updated 2026-10-07
The Galois group consists of the field automorphisms of that fix pointwise. For a finite Galois extension, its order is .
Dirichlet discrete Laplacian Created 2026-09-24 Updated 2026-09-24
On interior points, the one-dimensional centered second-difference matrix with homogeneous Dirichlet boundaries has eigenvalues
Courant number Created 2026-09-24 Updated 2026-09-29
The Courant number is the dimensionless ratio of physical propagation during one time step to one spatial grid spacing, commonly .
von Neumann stability analysis Created 2026-09-24 Updated 2026-10-14
Von Neumann analysis inserts the Fourier mode into a constant-coefficient difference scheme. A one-step method is stable in the discrete -norm when its amplification factor satisfies for every resolvable wavenumber.
Forward difference operator Created 2026-09-24 Updated 2026-10-03
Central finite difference Created 2026-09-24 Updated 2026-10-14
Monochromatic set Created 2026-09-24 Updated 2026-10-14
A subset is monochromatic for a finite coloring if there is a color such thatEquivalently, the restriction of a function is a constant function, or lies in one colour class . The word describes agreement of colors; it does not require to equal an entire colour class.
For example, color the integers by integer parity, using red for even and blue for odd. The set is monochromatic, whereas is not. If the colored objects are edges, a monochromatic triangle in a graph means that its three edges form a monochromatic set. In a coloring of -element subsets of a set , a homogeneous set for a colouring means that the collection of all -element subsets of is monochromatic. For pairs, this is a complete graph on whose edges all have one color, rather than a coloring of the vertices in .
There are unlisted articles, also show them or only show them.