TOPICS
Search

Search Results for ""


11631 - 11640 of 13135 for Computational GeometrySearch Results
The Riemann theta function is a complex function of g complex variables that occurs in the construction of quasi-periodic solutions of various equations in mathematical ...
There are a couple of versions of this theorem. Basically, it says that any bounded linear functional T on the space of compactly supported continuous functions on X is the ...
The extension ring obtained from a commutative unit ring (other than the trivial ring) when allowing division by all non-zero divisors. The ring of fractions of an integral ...
The Risch algorithm is a decision procedure for indefinite integration that determines whether a given integral is elementary, and if so, returns a closed-form result for the ...
Consider the inequality sigma(n)<e^gammanlnlnn for integer n>1, where sigma(n) is the divisor function and gamma is the Euler-Mascheroni constant. This holds for 7, 11, 13, ...
The Rogers-Selberg identities are a set of three analytic q-series identities of Rogers-Ramanujan-type appearing as equation 33, 32, and 31 in Slater (1952), A(q) = ...
A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...
A Room square (named after T. G. Room) of order n (for n even) is an arrangement in an (n-1)×(n-1) square matrix of n objects such that each cell is either empty or holds ...
A rooted graph is a graph in which one node is labeled in a special way so as to distinguish it from other nodes. The special node is called the root of the graph. The rooted ...
The prime number theorem shows that the nth prime number p_n has the asymptotic value p_n∼nlnn (1) as n->infty (Havil 2003, p. 182). Rosser's theorem makes this a rigorous ...

...