TOPICS
Search

Search Results for ""


1931 - 1940 of 4217 for Strong Lawof Small NumbersSearch Results
Let a sequence {a_i}_(i=1)^infty be strictly increasing and composed of nonnegative integers. Call A(x) the number of terms not exceeding x. Then the density is given by ...
Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...
A spectrum sequence is a sequence formed by successive multiples of a real number a rounded down to the nearest integer s_n=|_na_|. If a is irrational, the spectrum is called ...
A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...
A two-graph (V,Delta) on nodes V is a collection Delta of unordered triples of the vertices (the so-called "odd triples") such that each 4-tuple of V contains an even number ...
The depth of a vertex v in a rooted tree as the number of edges from v to the root vertex. A function to return the depth of a vertex v in a tree g may be implemented in a ...
On an algebraic curve, the sum of the number of coincidences at a noncuspidal point C is the sum of the orders of the infinitesimal distances from a nearby point P to the ...
If there is a (nu,nu^') correspondence between two curves of curve genus p and p^' and the number of branch points properly counted are beta and beta^', then ...
Diagonalize a form over the rationals to diag[p^a·A,p^b·B,...], where all the entries are integers and A, B, ... are relatively prime to p. Then the p-signature of the form ...
Let x_0 be a rational number in the closed interval [0,1], and generate a sequence using the map x_(n+1)=2x_n (mod 1). (1) Then the number of periodic map orbits of period p ...
1 ... 191|192|193|194|195|196|197 ... 422 Previous Next

...