Search Results for ""
6541 - 6550 of 13135 for Combinatorial MathematicsSearch Results
The ruliad may be defined as the entangled limit of everything that is computationally possible, i.e., the result of following all possible computational rules in all ...
Scherk's two minimal surfaces were discovered by Scherk in 1834. They were the first new surfaces discovered since Meusnier in 1776. Beautiful images of wood sculptures of ...
Self-recursion is a recursion that is defined in terms of itself, resulting in an ill-defined infinite regress. The formula for the volume of a cylinder leads to the ...
A sequential substitution system is a substitution system in which a string is scanned from left to right for the first occurrence of the first rule pattern. If the pattern ...
The Siegel theta function is a Gamma_n-invariant meromorphic function on the space of all p×p symmetric complex matrices Z=X+iY with positive definite imaginary part. It is ...
There appears to be no term in standard use for a graph with graph crossing number 1. Furthermore, the terms "almost planar" and "1-planar" are used in the literature for ...
A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...
A stacked (or generalized) prism graph Y_(m,n) is a simple graph given by the graph Cartesian product Y_(m,n)=C_m square P_n (Gallian 2007) for positive integers m,n with ...
A state diagram is a labeled directed graph together with state information that can be used to indicate that certain paths on in a system may be traversed only in a certain ...
A subset is a portion of a set. B is a subset of A (written B subset= A) iff every member of B is a member of A. If B is a proper subset of A (i.e., a subset other than the ...
...
View search results from all Wolfram sites (60124 matches)

