TOPICS
Search

Search Results for ""


5451 - 5460 of 13135 for Square Triangular NumberSearch Results
If f(z) is continuous in a region D and satisfies ∮_gammafdz=0 for all closed contours gamma in D, then f(z) is analytic in D. Morera's theorem does not require simple ...
An algebraic loop L is a Moufang loop if all triples of elements x, y, and z in L satisfy the Moufang identities, i.e., if 1. z(x(zy))=((zx)z)y, 2. x(z(yz))=((xz)y)z, 3. ...
A multidimensional point process is a measurable function from a probability space (Omega,A,P) into (X,Sigma) where X is the set of all finite or countable subsets of R^d not ...
An N-cluster is a point lattice configuration in which the distance between every pair of points is an integer, no three points are collinear, and no four points are ...
Consider a power series in a complex variable z g(z)=sum_(n=0)^inftya_nz^n (1) that is convergent within the open disk D:|z|<R. Convergence is limited to within D by the ...
The Nechushtan graph, illustrated above, is a 10-vertex 5-chromatic graph that is unit-distance in 3 dimensions. It was used by Nechushtan (2002) in the construction of of a ...
The Nørlund polynomial (note that the spelling Nörlund also appears in various publications) is a name given by Carlitz (1960) and Adelberg (1997) to the polynomial ...
A golden rhombohedron is a trigonal trapezohedron (and therefore rhombohedron with congruent rhombic faces) whose faces consist of six equal golden rhombi. There are two ...
Let alpha and beta be any ordinal numbers, then ordinal exponentiation is defined so that if beta=0 then alpha^beta=1. If beta is not a limit ordinal, then choose gamma such ...
An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...
1 ... 543|544|545|546|547|548|549 ... 1314 Previous Next

...