Search Results for ""

Spinor fields describing particles of zero rest mass satisfy the so-called zero rest mass equations. Examples of zero rest mass particles include the neutrino (a fermion) and ...

The constants C_n defined by C_n=[int_0^infty|d/(dt)((sint)/t)^n|dt]-1. (1) These constants can also be written as the sums C_n=2sum_(k=1)^infty(1+x_k^2)^(-n/2), (2) and ...

Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the ...

A von Neumann regular ring is a ring R such that for all a in R, there exists a b in R satisfying a=aba (Jacobson 1989, p. 196). More formally, a ring R is regular in the ...

The minimal polynomial of an algebraic number zeta is the unique irreducible monic polynomial of smallest degree p(x) with rational coefficients such that p(zeta)=0 and whose ...

Consider an n×n (0, 1)-matrix such as [a_(11) a_(23) ; a_(22) a_(34); a_(21) a_(33) ; a_(32) a_(44); a_(31) a_(43) ; a_(42) a_(54); a_(41) a_(53) ; a_(52) a_(64)] (1) for ...

Inscribe two triangles DeltaA_1B_1C_1 and DeltaA_2B_2C_2 in a reference triangle DeltaABC such that A = ∠AB_1C_1=∠AC_2B_2 (1) B = ∠BC_1A_1=∠BA_2C_2 (2) C = ∠CA_1B_1=∠CB_2A_2. ...

A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...

In August 2002, M. Agrawal and colleagues announced a deterministic algorithm for determining if a number is prime that runs in polynomial time (Agrawal et al. 2004). While ...