Search Results for ""
21 - 30 of 13135 for Combinatorial AnalysisSearch Results
Given a system of ordinary differential equations of the form d/(dt)[x; y; v_x; v_y]=-[0 0 -1 0; 0 0 0 -1; Phi_(xx)(t) Phi_(yx)(t) 0 0; Phi_(xy)(t) Phi_(yy)(t) 0 0][x; y; ...
Pathological functions that are continuous but differentiable only on a set of points of measure zero are sometimes known as monsters of real analysis. Examples include the ...
Analysis of data ordered by the time the data were collected (usually spaced at equal intervals), called a time series. Common examples of a time series are daily temperature ...
The Season 2 episode "Soft Target" (2006) of the television crime drama NUMB3RS features linear discriminant analysis.
A procedure for determining the behavior of an nth order ordinary differential equation at a removable singularity without actually solving the equation. Consider ...
Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...
The use of techniques from algebra, topology, and geometry in the solution of combinatorial problems, or the use of combinatorial methods to attack problems in these areas ...
An arrangement of overlapping circles which cover the entire plane. A lower bound for a covering using equivalent circles is 2pi/sqrt(27) (Williams 1979, p. 51).
If F is a family of more than n bounded closed convex sets in Euclidean n-space R^n, and if every H_n (where H_n is the Helly number) members of F have at least one point in ...
Let A_n be the set of all sequences that contain all sequences {a_k}_(k=0)^n where a_0=1 and all other a_i=+/-1, and define c_k=sum_(j=0)^(n-k)a_ja_(j+k). Then the merit ...
...
View search results from all Wolfram sites (195209 matches)

