Search Results for ""

The graph tensor product, also called the graph cardinal product (Imrich 1998), graph categorical product, graph conjunction, graph direct product (Hammack et al. 2016), ...

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...

Primorial primes are primes of the form p_n#+/-1, where p_n# is the primorial of p_n. A coordinated search for such primes is being conducted on PrimeGrid. p_n#-1 is prime ...

Let A and B be two algebras over the same signature Sigma, with carriers A and B, respectively (cf. universal algebra). B is a subalgebra of A if B subset= A and every ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

Just as many interesting integer sequences can be defined and their properties studied, it is often of interest to additionally determine which of their elements are prime. ...

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

Suppose that V is a group representation of G, and W is a group representation of H. Then the vector space tensor product V tensor W is a group representation of the group ...

An extension of a group H by a group N is a group G with a normal subgroup M such that M=N and G/M=H. This information can be encoded into a short exact sequence of groups ...