Search Results for ""
7251 - 7260 of 13135 for Combinatorial MathematicsSearch Results
A fractal which can be written as a Lindenmayer system with initial string "YF", string rewriting rules "X" -> "YF+XF+Y", "Y" -> "XF-YF-X", and angle 60 degrees.
The conjecture that all integers >1 occur as a value of the totient valence function (i.e., all integers >1 occur as multiplicities). The conjecture was proved by Ford ...
In floating-point arithmetic, the significand is a component of a finite floating-point number containing its significant digits. Generally speaking, the significand can be ...
A simple function is a finite sum sum_(i)a_ichi_(A_i), where the functions chi_(A_i) are characteristic functions on a set A. Another description of a simple function is a ...
Simpson's paradox, also known as the amalgamation paradox, reversal paradox, or Yule-Simpson effect, is a paradox in which a statistical trend appears to be present when data ...
A siteswap is a sequence encountered in juggling in which each term is a positive integer, encoded in binary. The transition rule from one term to the next consists of ...
To color any map on the sphere or the plane requires at most six-colors. This number can easily be reduced to five, and the four-color theorem demonstrates that the necessary ...
In algebraic topology, a p-skeleton is a simplicial subcomplex of K that is the collection of all simplices of K of dimension at most p, denoted K^((p)). The graph obtained ...
Consider a formula in prenex normal form, Q_1x_1...Q_nx_nN. If Q_i is the existential quantifier (1<=i<=n) and x_k, ..., x_m are all the universal quantifier variables such ...
For a braid with M strands, R components, P positive crossings, and N negative crossings, {P-N<=U_++M-R if P>=N; P-N<=U_-+M-R if P<=N, (1) where U_+/- are the smallest number ...
...
View search results from all Wolfram sites (60124 matches)

