Search Results for ""
3801 - 3810 of 13135 for Discrete SetSearch Results
The tangent numbers, also called a zag number, and given by T_n=(2^(2n)(2^(2n)-1)|B_(2n)|)/(2n), (1) where B_n is a Bernoulli number, are numbers that can be defined either ...
The theta series of a lattice is the generating function for the number of vectors with norm n in the lattice. Theta series for a number of lattices are implemented in the ...
In general, a topological index, sometimes also known as a graph-theoretic index, is a numerical invariant of a chemical graph (Plavšić et al. 1993). Particular topological ...
Triangle geometry is the study of the properties of triangles, including associated triangle centers, triangle lines, central circles, triangle cubics, and many others. These ...
A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...
Let {f_n} and {a_n} be sequences with f_n>=f_(n+1)>0 for n=1, 2, ..., then |sum_(n=1)^ma_nf_n|<=Af_1, where A=max{|a_1|,|a_1+a_2|,...,|a_1+a_2+...+a_m|}.
An additive function is an arithmetic function such that whenever positive integers a and b are relatively prime, f(ab)=f(a)+f(b). An example of an additive function is ...
A mathematical object S is said to be additively closed if a,b in S implies that a+b in S.
The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...
Any link can be represented by a closed braid.
...
View search results from all Wolfram sites (47352 matches)

