Search Results for ""

The second part of Pollard rho factorization method concerns detection of the fact that a sequence has become periodic. Pollard's original suggestion was to use the idea ...

An n-bridge knot is a knot with bridge number n. The set of 2-bridge knots is identical to the set of rational knots. If L is a 2-bridge knot, then the BLM/Ho polynomial Q ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...

A Brier number is a number that is both a Riesel number and a Sierpiński number of the second kind, i.e., a number n such that for all k>=1, the numbers n·2^k+1 and n·2^k-1 ...

Let p_n/q_n be the sequence of convergents of the continued fraction of a number alpha. Then a Brjuno number is an irrational number such that ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...

An algorithm which finds rational function extrapolations of the form R_(i(i+1)...(i+m))=(P_mu(x))/(P_nu(x))=(p_0+p_1x+...+p_mux^mu)/(q_0+q_1x+...+q_nux^nu) and can be used ...

Gives a matrix representation b_i of a braid group in terms of (n-1)×(n-1) matrices. A -t always appears in the (i,i) position. b_1 = [-t 0 0 ... 0; -1 1 0 ... 0; 0 0 1 ... ...