Search Results for ""

Let n be a positive integer and r(n) the number of (not necessarily distinct) prime factors of n (with r(1)=0). Let O(m) be the number of positive integers <=m with an odd ...

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...

A Pólya plot is a plot of the vector field of (R[f(z)],-I[f(z)]) of a complex function f(z). Several examples are shown above. Pólya plots can be created in the Wolfram ...

The polynomial giving the number of colorings with m colors of a structure defined by a permutation group.

A polyabolo is an analog of the polyomino composed of n isosceles right triangles joined along edges of the same length. Polyaboloes are sometimes also called polytans ...

The statistics h_(r,s,...) defined such that <h_(r,s,...)>=mu_rmu_s..., where mu_r is a central moment. These statistics generalize h-statistics and were originally called ...

A polyare is a polyform formed from a polyomino by removing of half of each square such that at least half of the original join between squares is retained. The first few ...

Let p(d) be the probability that a random walk on a d-D lattice returns to the origin. In 1921, Pólya proved that p(1)=p(2)=1, (1) but p(d)<1 (2) for d>2. Watson (1939), ...

A polybe is a polyform formed from a polycubes by removing of half of each cube such that at least half of the original join between cubes is retained. The numbers of polybes ...

Polycairos are polyforms obtained from the Cairo tessellation, illustrated above. The numbers of polycairos with n=1, 2, ... components are 1, 2, 5, 17, 55, 206, 781, 3099, ...