Search Results for ""

A Young tableau chosen at random from those having a given shape. A random tableau can be generated by RandomTableau[shape] in the Wolfram Language package Combinatorica` . ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

If L^~ is a linear operator on a function space, then f is an eigenfunction for L^~ and lambda is the associated eigenvalue whenever L^~f=lambdaf. Renteln and Dundes (2005) ...

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

When a Young tableau is constructed using the so-called insertion algorithm, an element starts in some position on the first row, from which it may later be bumped. In ...

A sequence which arises in the hypothetical reproduction of a population of rabbits. Let the substitution system map 0->1 correspond to young rabbits growing old, and 1->10 ...

A plane partition which is invariant under permutation of the three axes and which is equal to its complement (i.e., the collection of cubes that are in a given box but do ...

The point of concurrence of the joins of the vertices of a triangle and the points of contact of an inconic of the triangle (Veblen and Young 1938, p. 111; Eddy and Fritsch ...

There are two awards that each go by the name "Ramanujan Prize": the SASTRA Ramanujan Prize and the ICTP Ramanujan Prize for Young Mathematicians from Developing Countries. ...

In the early 1950s, Ernst Straus asked 1. Is every region illuminable from every point in the region? 2. Is every region illuminable from at least one point in the region? ...