Search Results for ""

Green's identities are a set of three vector derivative/integral identities which can be derived starting with the vector derivative identities del ·(psidel phi)=psidel ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

Let f be an entire function of finite order lambda and {a_j} the zeros of f, listed with multiplicity, then the rank p of f is defined as the least positive integer such that ...

Given two randomly chosen n×n integer matrices, what is the probability D(n) that the corresponding determinants are relatively prime? Hafner et al. (1993) showed that ...

The Hamming graph H(d,q), sometimes also denoted q^d, is the graph Cartesian product of d copies of the complete graph K_q. H(d,q) therefore has q^d vertices. H(d,q) has ...

The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...

A Hermitian metric on a complex vector bundle assigns a Hermitian inner product to every fiber bundle. The basic example is the trivial bundle pi:U×C^k->U, where U is an open ...

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

The icosahedral group I_h is the group of symmetries of the icosahedron and dodecahedron having order 120, equivalent to the group direct product A_5×Z_2 of the alternating ...

p^x is an infinitary divisor of p^y (with y>0) if p^x|_(y-1)p^y, where d|_kn denotes a k-ary Divisor (Guy 1994, p. 54). Infinitary divisors therefore generalize the concept ...