Search Results for ""
931 - 940 of 1669 for Landaus ProblemsSearch Results
The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...
The term "square" can be used to mean either a square number ("x^2 is the square of x") or a geometric figure consisting of a convex quadrilateral with sides of equal length ...
A plane-filling arrangement of plane figures or its generalization to higher dimensions. Formally, a tiling is a collection of disjoint open sets, the closures of which cover ...
The Ulam sequence {a_i}=(u,v) is defined by a_1=u, a_2=v, with the general term a_n for n>2 given by the least integer expressible uniquely as the sum of two distinct earlier ...
A prime gap of length n is a run of n-1 consecutive composite numbers between two successive primes. Therefore, the difference between two successive primes p_k and p_(k+1) ...
Consider three mutually tangent circles, and draw their inner Soddy circle. Then draw the inner Soddy circles of this circle with each pair of the original three, and ...
A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...
In general, "a" calculus is an abstract theory developed in a purely formal way. "The" calculus, more properly called analysis (or real analysis or, in older literature, ...
A branch of mathematics that is a sort of generalization of calculus. Calculus of variations seeks to find the path, curve, surface, etc., for which a given function has a ...
A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...
...
View search results from all Wolfram sites (22307 matches)

