Search Results for ""
551 - 560 of 1788 for Finite_difference_methodSearch Results
The projective general unitary group PGU_n(q) is the group obtained from the general unitary group GU_n(q) on factoring the scalar matrices contained in that group.
The projective symplectic group PSp_n(q) is the group obtained from the symplectic group Sp_n(q) on factoring by the scalar matrices contained in that group. PSp_(2m)(q) is ...
If p^k is the highest power of a prime p dividing the order of a finite group G, then a subgroup of G of order p^k is called a Sylow p-subgroup of G.
A p-elementary subgroup of a finite group G is a subgroup H which is the group direct product H=C_n×P, where P is a p-group, C_n is a cyclic group, and p does not divide n.
A secant line, also simply called a secant, is a line passing through two points of a curve. As the two points are brought together (or, more precisely, as one is brought ...
Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...
The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...
A nonlinear deconvolution technique used in deconvolving images from the Hubble Space Telescope before corrective optics were installed.
A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...
The order of a finite field is the number of elements it contains.
...
View search results from all Wolfram sites (32028 matches)

