Search Results for ""
1971 - 1980 of 13135 for random number generatorSearch Results
Given a real m×n matrix A, there are four associated vector subspaces which are known colloquially as its fundamental subspaces, namely the column spaces and the null spaces ...
There are (at least) two graphs associated with Horton, illustrated above. The first is a graph on 96 nodes providing a counterexample to the Tutte conjecture that every ...
Lauricella functions are generalizations of the Gauss hypergeometric functions to multiple variables. Four such generalizations were investigated by Lauricella (1893), and ...
Let G be a Lie group and let rho be a group representation of G on C^n (for some natural number n), which is continuous in the sense that the function G×C^n->C^n defined by ...
A polyhedron compound is an arrangement of a number of interpenetrating polyhedra, either all the same or of several distinct types, usually having visually attractive ...
A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...
The topology on the Cartesian product X×Y of two topological spaces whose open sets are the unions of subsets A×B, where A and B are open subsets of X and Y, respectively. ...
A recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of recurrence relation, the entire class of objects can ...
A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...
Stanley's theorem states that the total number of 1s that occur among all unordered partitions of a positive integer is equal to the sum of the numbers of distinct members of ...
...
View search results from all Wolfram sites (185340 matches)

