Search Results for ""
11621 - 11630 of 13135 for Reynolds numberSearch Results

The word configuration is sometimes used to describe a finite collection of points p=(p_1,...,p_n), p_i in R^d, where R^d is a Euclidean space. The term "configuration" also ...
A contingency table, sometimes called a two-way frequency table, is a tabular mechanism with at least two rows and two columns used in statistics to present categorical data ...
Conway games were introduced by J. H. Conway in 1976 to provide a formal structure for analyzing games satisfying certain requirements: 1. There are two players, Left and ...
The cosecant cscz is the function defined by cscz = 1/(sinz) (1) = (2i)/(e^(iz)-e^(-iz)), (2) where sinz is the sine. The cosecant is implemented in the Wolfram Language as ...
The Costa surface is a complete minimal embedded surface of finite topology (i.e., it has no boundary and does not intersect itself). It has genus 1 with three punctures ...
The cotangent function cotz is the function defined by cotz = 1/(tanz) (1) = (i(e^(iz)+e^(-iz)))/(e^(iz)-e^(-iz)) (2) = (i(e^(2iz)+1))/(e^(2iz)-1), (3) where tanz is the ...
If a, b, c, and d are points in the extended complex plane C^*, their cross ratio, also called the cross-ratio (Courant and Robbins 1996, p. 172; Durell 1928, p. 73), ...
A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges ...
Cubic graphs, also called trivalent graphs, are graphs all of whose nodes have degree 3 (i.e., 3-regular graphs). Cubic graphs on n nodes exists only for even n (Harary 1994, ...
A cubic polyhedral graph is a graph that is both cubic and polyhedral. The numbers of cubical polyhedral graphs on n=2, 4, ... nodes are 0, 1, 1, 2, 5, 14, 50, 233, 1249, ... ...

...