Search Results for ""

A solitaire game played with cards. The chance of winning is 1/13, and the arithmetic mean of the number of cards turned up is 42.4.

A codeword is an element of an error-correcting code C. If C has length n, then a codeword in C has the form (c_1,c_2,...,c_n), where each c_i is a letter in the alphabet of ...

If S is an infinite set, then the collection F_S={A subset= S:S-A is finite} is a filter called the cofinite (or Fréchet) filter on S.

A flat disk that acts as a two-sided die.

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

An axiomatic theory (such as a geometry) is said to be complete if each valid statement in the theory is capable of being proven true or false.

Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.

The graph corresponding to the complete k-ary tree on n nodes is implemented in the Wolfram Language as KaryTree[n, k].

The set P^2 is the set of all equivalence classes [a,b,c] of ordered triples (a,b,c) in C^3\(0,0,0) under the equivalence relation (a,b,c)∼(a^',b^',c^') if ...

An n-component of a graph G is a maximal n-connected subgraph.