TOPICS
Search

Search Results for ""


891 - 900 of 13134 for binomial theorySearch Results
An almost alternating link with a single component.
An almost unit is a nonunit in the integral domain of formal power series with a nonzero first coefficient, P=a_1x+a_2x^2+..., where a_1!=0. Under the operation of ...
A knot diagram which has alternating under- and overcrossings as the knot projection is traversed. The first knot which does not have an alternating diagram has 8 crossings.
Let K_1^n and K_2^n be disjoint bicollared knots in R^(n+1) or S^(n+1) and let U denote the open region between them. Then the closure of U is a closed annulus S^n×[0,1]. ...
An anyon is a projective representation of a Lie group.
A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...
Let P be the set of primes, and let Q_p and Z_p(t) be the fields of p-adic numbers and formal power series over Z_p=(0,1,...,p-1). Further, suppose that D is a "nonprincipal ...
A maximal subgraph of an undirected graph such that any two edges in the subgraph lie on a common simple cycle.
The two recursive sequences U_n = mU_(n-1)+U_(n-2) (1) V_n = mV_(n-1)+V_(n-2) (2) with U_0=0, U_1=1 and V_0=2, V_1=m, can be solved for the individual U_n and V_n. They are ...
The chromatic number of a graph is at most the maximum vertex degree Delta, unless the graph is complete or an odd cycle, in which case Delta+1 colors are required.
1 ... 87|88|89|90|91|92|93 ... 1314 Previous Next

...