TOPICS
Search

Search Results for ""


3181 - 3190 of 13135 for Combinatorial AnalysisSearch Results
The (n+1)×(n+1) tridiagonal matrix (also called the Clement matrix) defined by S_n=[0 n 0 0 ... 0; 1 0 n-1 0 ... 0; 0 2 0 n-2 ... 0; | | ... ... ... |; 0 0 0 n-1 0 1; 0 0 0 0 ...
The function K_n(x_0,x)=K_n(x,x_0)^_=K_n(x^_,x^__0) which is useful in the study of many polynomials.
The problem of deciding if two knots in three-space are equivalent such that one can be continuously deformed into another.
A knot diagram which does not specify whether crossings are under- or overcrossings.
A theory of Hamiltonian cycles.
A conjecture concerning primes.
Quantifies deviation from translational invariance by describing the distribution of gaps within a set at multiple scales. The more lacunar a set, the more heterogeneous the ...
Let z=re^(itheta)=x+iy be a complex number, then inequality |(zexp(sqrt(1-z^2)))/(1+sqrt(1-z^2))|<=1 (1) holds in the lens-shaped region illustrated above. Written explicitly ...
A distribution with a high peak so that the kurtosis excess satisfies gamma_2>0.
n sets of s trials each, with the probability of success p constant in each set. var(x/n)=spq+s(s-1)sigma_p^2, where sigma_p^2 is the variance of p_i.
1 ... 316|317|318|319|320|321|322 ... 1314 Previous Next

...