Search Results for ""

One of the polynomials obtained by taking powers of the Brahmagupta matrix. They satisfy the recurrence relation x_(n+1) = xx_n+tyy_n (1) y_(n+1) = xy_n+yx_n. (2) A list of ...

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 real-valued stochastic process {B(t):t>=0} is a Brownian motion which starts at x in R if the following properties are satisfied: 1. B(0)=x. 2. For all times ...

A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...

A connected set is a set that cannot be partitioned into two nonempty subsets which are open in the relative topology induced on the set. Equivalently, it is a set which ...

A cyclotomic field Q(zeta) is obtained by adjoining a primitive root of unity zeta, say zeta^n=1, to the rational numbers Q. Since zeta is primitive, zeta^k is also an nth ...

A series suma(n)e^(-lambda(n)z), where a(n) and z are complex and {lambda(n)} is a monotonic increasing sequence of real numbers. The numbers lambda(n) are called the ...

Euclidean n-space, sometimes called Cartesian space or simply n-space, is the space of all n-tuples of real numbers, (x_1, x_2, ..., x_n). Such n-tuples are sometimes called ...

A shuffle of a deck of cards obtained by successively exchanging the cards in position 1, 2, ..., n with cards in randomly chosen positions. For 4<=n<=17, the most frequent ...