Search Results for ""

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.

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.

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...

An agreement in which all parties feel as if they have received the best deal.

The conjecture that Frey's elliptic curve was not modular. The conjecture was quickly proved by Ribet (Ribet's theorem) in 1986, and was an important step in the proof of ...