Search Results for ""

A partial algebra is a pair A=(A,(f_i^A)_(i in I)), where for each i in I, there are an ordinal number alpha_i and a set X_i subset= A^(alpha_i) such that f_i^A is a function ...

A random composition of a number n in k parts is one of the (n+k-1; n) possible compositions of n, where (n; k) is a binomial coefficient. A random composition can be given ...

A set function is a function whose domain is a collection of sets. In many instances in real analysis, a set function is a function which associates an affinely extended real ...

Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...

A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...

The depth of a vertex v in a rooted tree as the number of edges from v to the root vertex. A function to return the depth of a vertex v in a tree g may be implemented in a ...

If there is a (nu,nu^') correspondence between two curves of curve genus p and p^' and the number of branch points properly counted are beta and beta^', then ...

Diagonalize a form over the rationals to diag[p^a·A,p^b·B,...], where all the entries are integers and A, B, ... are relatively prime to p. Then the p-signature of the form ...

In August 2002, M. Agrawal and colleagues announced a deterministic algorithm for determining if a number is prime that runs in polynomial time (Agrawal et al. 2004). While ...

A connected graph G is said to be t-tough if, for every integer k>1, G cannot be split into k different connected components by the removal of fewer than tk vertices. The ...