Search Results for ""

Multivariate zeta function, also called multiple zeta values, multivariate zeta constants (Bailey et al. 2006, p. 43), multi-zeta values (Bailey et al. 2006, p. 17), and ...

A countable set is a set that is either finite or denumerable. However, some authors (e.g., Ciesielski 1997, p. 64) use the definition "equipollent to the finite ordinals," ...

Let P be a prime ideal in D_m not containing m. Then (Phi(P))=P^(sumtsigma_t^(-1)), where the sum is over all 1<=t<m which are relatively prime to m. Here D_m is the ring of ...

The longhorn graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["LonghornGraph"].

The R graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RGraph"].

The Eiffel Tower graph is the graph on 7 vertices illustrated above. (Note that Koren et al. (2003) use the term 'Eiffel Tower graph' to refer instead to the (3,2)-fan ...

The net graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["NetGraph"]. The bipartite double graph of the net graph is ...

A necessary and sufficient condition for a sequence S_i to converge. The Cauchy criterion is satisfied when, for all epsilon>0, there is a fixed number N such that ...

The underlying set of the fundamental group of X is the set of based homotopy classes from the circle to X, denoted [S^1,X]. For general spaces X and Y, there is no natural ...

In general, the opposite of trivial.