Search Results for ""

Let F(n) be a family of partitions of n and let F(n,d) denote the set of partitions in F(n) with Durfee square of size d. The Durfee polynomial of F(n) is then defined as the ...

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

The Dutch windmill graph D_3^((m)), also called a friendship graph, is the graph obtained by taking m copies of the cycle graph C_3 with a vertex in common (Gallian 2007), ...

Dyads extend vectors to provide an alternative description to second tensor rank tensors. A dyad D(A,B) of a pair of vectors A and B is defined by D(A,B)=AB. The dot product ...

The simplest algebraic language, denoted D. If X is the alphabet {x,x^_}, then D is the set of words u of X which satisfy 1. |u|_x=|u|_(x^_), where |u|_x is the numbers of ...

The surface with three cross-caps (Francis and Collins 1993, Francis and Weeks 1999).

Handles and cross-handles are equivalent in the presence of a cross-cap.

For any two ergodic measure-preserving transformations on nonatomic probability spaces, there is an isomorphism between the two probability spaces carrying orbits onto orbits.

Let Jones and Smith be the only two contestants in an election that will end in a deadlock when all votes for Jones (J) and Smith (S) are counted. What is the expectation ...

The Eberlein polynomials of degree 2k and variable x are the orthogonal polynomials arising in the Johnson scheme that may be defined by E_k^((n,v))(x) = ...