Search Results for ""

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 ...

In geometry, an endpoint is one of the two points at the boundary of a line segment. In analysis, an endpoint is one of the two points at the boundary of a closed interval or ...

Endraß surfaces are a pair of octic surfaces which have 168 ordinary double points. This is the maximum number known to exist for an octic surface, although the rigorous ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

Let f(z) = z+a_1+a_2z^(-1)+a_3z^(-2)+... (1) = zsum_(n=0)^(infty)a_nz^(-n) (2) = zg(1/z) (3) be a Laurent polynomial with a_0=1. Then the Faber polynomial P_m(f) in f(z) of ...

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

A general space based on the line element ds=F(x^1,...,x^n;dx^1,...,dx^n), with F(x,y)>0 for y!=0 a function on the tangent bundle T(M), and homogeneous of degree 1 in y. ...

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...

Let f(x) be a monic polynomial of degree d with discriminant Delta. Then an odd integer n with (n,f(0)Delta)=1 is called a Frobenius pseudoprime with respect to f(x) if it ...

An irrational number x can be called GK-regular (defined here for the first time) if the distribution of its continued fraction coefficients is the Gauss-Kuzmin distribution. ...