TOPICS
Search

Search Results for ""


2131 - 2140 of 13135 for Lagrange Number Diophantine EquationSearch Results
A place nu of a number field k is an isomorphism class of field maps k onto a dense subfield of a nondiscrete locally compact field k_nu. In the function field case, let F be ...
A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...
A flexagon-like structure created by connecting the ends of a strip of four squares after folding along 45 degrees diagonals. Using a number of folding movements, it is ...
The term folium means "leaf" in Latin and refers and refers to a plane curve having "leaf-shaped" rounded lobes. There are a number of different sorts of folia, including ...
The term "fractal dimension" is sometimes used to refer to what is more commonly called the capacity dimension of a fractal (which is, roughly speaking, the exponent D in the ...
Let G be a simple connected graph, and take 0<=i<=d(G), where d(G) is the graph diameter. Then G has global parameters c_i (respectively a_i, b_i) if the number of vertices ...
For all n, there exists a k such that the kth term of the Goodstein sequence G_k(n)=0. In other words, every Goodstein sequence converges to 0. The secret underlying ...
A graceful permutation sigma on n letters is a permutation such that {|sigma(i)-sigma(i+1)|:i=1,2,...,n-1}={1,2,...,n-1}. For example, there are four graceful permutations on ...
The intensity measure mu of a point process X relative to a Borel set B subset R^d is defined to be the expected number of points of X falling in B. Symbolically, ...
The sum I over all internal (circular) nodes of the paths from the root of an extended binary tree to each node. For example, in the tree above, the internal path length is ...
1 ... 211|212|213|214|215|216|217 ... 1314 Previous Next

...