Search Results for ""
291 - 300 of 663 for Tree DiagramSearch Results
A partition whose conjugate partition is equivalent to itself. The Ferrers diagrams corresponding to the self-conjugate partitions for 3<=n<=10 are illustrated above. The ...
The number of staircase walks on a grid with m horizontal lines and n vertical lines is given by (m+n; m)=((m+n)!)/(m!n!) (Vilenkin 1971, Mohanty 1979, Narayana 1979, Finch ...
Inference of the truth of an unknown result obtained by noting its similarity to a result already known to be true. In the hands of a skilled mathematician, analogy can be a ...
A generalization of the Bulirsch-Stoer algorithm for solving ordinary differential equations.
Integers (lambda,mu) for a and b that satisfy Bézout's identity lambdaa+mub=GCD(a,b) are called Bézout numbers. For integers a_1, ..., a_n, the Bézout numbers are a set of ...
Let the nth composition of a function f(x) be denoted f^((n))(x), such that f^((0))(x)=x and f^((1))(x)=f(x). Denote the composition of f and g by f degreesg(x)=f(g(x)), and ...
The study of the nature and properties of bifurcations.
Involving two variables, as opposed to many (multivariate), or one (univariate).
If a is a point in the open unit disk, then the Blaschke factor is defined by B_a(z)=(z-a)/(1-a^_z), where a^_ is the complex conjugate of a. Blaschke factors allow the ...
A Brunnian link is a set of n linked loops such that each proper sublink is trivial, so that the removal of any component leaves a set of trivial unlinked unknots. The ...
...
View search results from all Wolfram sites (4378 matches)

