Search Results for ""

A partition p is said to contain another partition q if the Ferrers diagram of p contains the Ferrers diagram of q. For example, {3,3,2} (left figure) contains both {3,3,1} ...

The length of the largest-sized square contained within the Ferrers diagram of a partition. Its size can be determined using DurfeeSquare[f] in the Wolfram Language package ...

A formula for the number of Young tableaux associated with a given Ferrers diagram. In each box, write the sum of one plus the number of boxes horizontally to the right and ...

The most common "sine integral" is defined as Si(z)=int_0^z(sint)/tdt (1) Si(z) is the function implemented in the Wolfram Language as the function SinIntegral[z]. Si(z) is ...

An iterated map is a map that is applied repeatedly to an object. The Wolfram Language function NestList[f, expr, n] gives a list of the results of iterating the function f n ...

A functional graph is a directed graph in which each vertex has outdegree one, and can therefore be specified by a function mapping {1,...,n} onto itself. Functional graphs ...

Let f(x) be a finite and measurable function in (-infty,infty), and let epsilon be freely chosen. Then there is a function g(x) such that 1. g(x) is continuous in ...

Let S be a collection of subsets of a set X and let mu:S->[0,infty] be a set function. The function mu is called a premeasure provided that mu is finitely additive, countably ...

Let f(x) be a real continuous monotonic strictly increasing function on the interval [0,a] with f(0)=0 and b<=f(a), then ab<=int_0^af(x)dx+int_0^bf^(-1)(y)dy, where f^(-1)(y) ...

A positive value of n for which x-phi(x)=n has no solution, where phi(x) is the totient function. The first few are 10, 26, 34, 50, 52, ... (OEIS A005278).