Search Results for ""

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 ...

Let A and B be any sets, and let |X| be the cardinal number of a set X. Then cardinal exponentiation is defined by |A|^(|B|)=|set of all functions from B into A| (Ciesielski ...

If r is the inradius of a circle inscribed in a right triangle with sides a and b and hypotenuse c, then r=1/2(a+b-c). (1) A Sangaku problem dated 1803 from the Gumma ...

There are two distinct notions of connectivity in a directed graph. A directed graph is weakly connected if there is an undirected path between any pair of vertices, and ...

An infinite sequence of circles such that every four consecutive circles are mutually tangent, and the circles' radii ..., R_(-n), ..., R_(-1), R_0, R_1, R_2, R_3, R_4, ..., ...

A cyclic polygon is a polygon with vertices upon which a circle can be circumscribed. Since every triangle has a circumcircle, every triangle is cyclic. It is conjectured ...

A Dyck path is a staircase walk from (0,0) to (n,n) that lies strictly below (but may touch) the diagonal y=x. The number of Dyck paths of order n is given by the Catalan ...

An even permutation is a permutation obtainable from an even number of two-element swaps, i.e., a permutation with permutation symbol equal to +1. For initial set {1,2,3,4}, ...

An exact sequence is a sequence of maps alpha_i:A_i->A_(i+1) (1) between a sequence of spaces A_i, which satisfies Im(alpha_i)=Ker(alpha_(i+1)), (2) where Im denotes the ...

An exponential moving average, also known as an exponentially weighted moving average and abbreviated EMA or EWMA, is a moving filter that applied weights to older values in ...