Search Results for ""

In continuum percolation theory, the so-called germ-grain model is an obvious generalization of both the Boolean and Boolean-Poisson models which is driven by an arbitrary ...

An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...

An inverse function of an Abelian integral. Abelian functions have two variables and four periods, and can be defined by Theta(v,tau;q^'; ...

An abstract machine is a model of a computer system (considered either as hardware or software) constructed to allow a detailed and precise analysis of how the computer ...

The adjacency list representation of a graph consists of n lists one for each vertex v_i, 1<=i<=n, which gives the vertices to which v_i is adjacent. The adjacency lists of a ...

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...

In the algebraic geometry of Grothendieck, a stack refers to a sheaf of categories. In particular, a stack is a presheaf of categories in which the following descent ...

A quantity such as a polynomial discriminant which remains unchanged under a given class of algebraic transformations. Such invariants were originally called ...

A class of fibered knots and links which arises in algebraic geometry. An algebraic link is formed by connecting the NW and NE strings and the SW and SE strings of an ...

For some constant alpha_0, alpha(f,z)<alpha_0 implies that z is an approximate zero of f, where alpha(f,z)=(|f(z)|)/(|f^'(z)|)sup_(k>1)|(f^((k))(z))/(k!f^'(z))|^(1/(k-1)). ...