TOPICS
Search

Search Results for ""


1701 - 1710 of 13134 for complexity theorySearch Results
For a set S, the span is defined by maxS-minS, where max is the maximum and min is the minimum.
An operator T which commutes with all shift operators E^a, so TE^a=E^aT for all real a in a field. Any two shift-invariant operators commute.
An operator E such that E^ap(x)=p(x+a).
Let f(1)=1, and let f(n) be the number of occurrences of n in a nondecreasing sequence of integers. then the first few values of f(n) are 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, ... ...
A local source is a node of a directed graph with no entering edges (Borowski and Borwein 1991, p. 401; left figure), and a global source (often simply called a source) is a ...
A graphical partitioning based on the eigenvalues and eigenvectors of the Laplacian matrix of a graph.
A polynomial which is not necessarily an invariant of a link. It is related to the dichroic polynomial. It is defined by the skein relationship ...
A stack F on a topological space X is said to be a stack of groupoids if for each open subset U subset= X, the category F(U) is a groupoid.
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 ...
Let P(L) be the set of all prime ideals of L, and define r(a)={P|a not in P}. Then the Stone space of L is the topological space defined on P(L) by postulating that the sets ...
1 ... 168|169|170|171|172|173|174 ... 1314 Previous Next

...