Search Results for ""

The edge count of a graph g, commonly denoted M(g) or E(g) and sometimes also called the edge number, is the number of edges in g. In other words, it is the cardinality of ...

A group action G×X->X is effective if there are no trivial actions. In particular, this means that there is no element of the group (besides the identity element) which does ...

The Egawa graph with parameters (p,s) is a distance-regular but not distance-transitive graph on 16^p4^s nodes. These graphs generalize the Doob graphs and give (s,4)-Hamming ...

The functions E_1(x) = (x^2e^x)/((e^x-1)^2) (1) E_2(x) = x/(e^x-1) (2) E_3(x) = ln(1-e^(-x)) (3) E_4(x) = x/(e^x-1)-ln(1-e^(-x)). (4) E_1(x) has an inflection point at (5) ...

Eisenstein's irreducibility criterion is a sufficient condition assuring that an integer polynomial p(x) is irreducible in the polynomial ring Q[x]. The polynomial ...

A graph G with m edges is said to be elegant if the vertices of G can be labeled with distinct integers (0,1,2,...,m) in such a way that the set of values on the edges ...

The group of an elliptic curve which has been transformed to the form y^2=x^3+ax+b is the set of K-rational points, including the single point at infinity. The group law ...

An elliptic curve is the set of solutions to an equation of the form y^2+a_1xy+a_3y=x^3+a_2x^2+a_4x+a_6. (1) By changing variables, y->2y+a_1x+a_3, assuming the field ...

The elliptic exponential function eexp_(a,b)(u) gives the value of x in the elliptic logarithm eln_(a,b)(x)=1/2int_infty^x(dt)/(sqrt(t^3+at^2+bt)) for a and b real such that ...

The elliptic logarithm is generalization of integrals of the form int_infty^x(dt)/(sqrt(t^2+at)), for a real, which can be expressed in terms of logarithmic and inverse ...