TOPICS
Search

Search Results for ""


2091 - 2100 of 13134 for binomial theorySearch Results
The set of all edge automorphisms of G, denoted Aut^*(G). Let L(G) be the line graph of a graph G. Then the edge automorphism group Aut^*(G) is isomorphic to Aut(L(G)), ...
The edge multiplicity of a given end vertex in a multigraph is the number of multiple edges sharing that end vertex. The maximum edge multiplicity in such a graph is known as ...
The edge set of a graph is simply a set of all edges of the graph. The cardinality of the edge set for a given graph g is known as the edge count of g. The edge set for a ...
Edge splitting is the reverse of edge contraction.
Let (X,B,mu) be a measure space and let E be a measurable set with mu(E)<infty. Let {f_n} be a sequence of measurable functions on E such that each f_n is finite almost ...
The Eisenstein units are the Eisenstein integers +/-1, +/-omega, +/-omega^2, where omega = 1/2(-1+isqrt(3)) (1) omega^2 = 1/2(-1-isqrt(3)). (2)
E(a,b)/p denotes the elliptic group modulo p whose elements are 1 and infty together with the pairs of integers (x,y) with 0<=x,y<p satisfying y^2=x^3+ax+b (mod p) (1) with a ...
A knot K is an n-embeddable knot if it can be placed on a genus n standard embedded surface without crossings, but K cannot be placed on any standardly embedded surface of ...
Given a module M over a unit ring R, the set End_R(M) of its module endomorphisms is a ring with respect to the addition of maps, (f+g)(x)=f(x)+g(x), for all x in M, and the ...
A modular form which is not allowed to have poles in the upper half-plane H or at iinfty.
1 ... 207|208|209|210|211|212|213 ... 1314 Previous Next

...