Search Results for ""

Generally speaking, a Green's function is an integral kernel that can be used to solve differential equations from a large number of families including simpler examples such ...

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 line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

The Möbius strip, also called the twisted cylinder (Henle 1994, p. 110), is a one-sided nonorientable surface obtained by cutting a closed band into a single strip, giving ...

A random number is a number chosen as if by chance from some specified distribution such that selection of a large set of these numbers reproduces the underlying ...

The Sierpiński sieve is a fractal described by Sierpiński in 1915 and appearing in Italian art from the 13th century (Wolfram 2002, p. 43). It is also called the Sierpiński ...

An nth-rank tensor in m-dimensional space is a mathematical object that has n indices and m^n components and obeys certain transformation rules. Each index of a tensor ranges ...

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

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