Search Results for ""

Stanley and Wilf conjectured (Bona 1997, Arratia 1999), that for every permutation pattern sigma, there is a constant c(sigma)<infty such that for all n, ...

A set of numbers obeying a pattern like the following: 91·37 = 3367 (1) 9901·3367 = 33336667 (2) 999001·333667 = 333333666667 (3) 99990001·33336667 = 3333333366666667 (4) 4^2 ...

Let F(n,sigma) denote the number of permutations on the symmetric group S_n which avoid sigma in S_k as a subpattern, where "tau contains sigma as a subpattern" is ...

The complexity of a pattern parameterized as the shortest algorithm required to reproduce it. Also known as bit complexity.

A circular pattern obtained by superposing parallel equally spaced lines on a set of concentric circles of increasing radii, then coloring the regions in chessboard fashion. ...

A fractal produced by iteration of the equation z_(n+1)=z_n^2 (mod m) which results in a Moiré-like pattern.

In the illusion illustrated above, when the concentric square borders with rounded edges are rotated slowly, the entire pattern appears to pulsate radially.

A zero tensor is a tensor of any rank and with any pattern of covariant and contravariant indices all of whose components are equal to 0 (Weinberg 1972, p. 38).

The quincunx is the pattern of five dots that appears on the "5" side of a 6-sided die. The word derives from the Latin words for both one and five. The Galton board is ...

A plot of y_i versus the estimator e_i=y^^_i-y_i. Random scatter indicates the model is probably good. A pattern indicates a problem with the model. If the spread in e_i ...