Search Results for ""

The Young tableau (plural, "tableaux") of a Ferrers diagram is obtained by placing the numbers 1, ..., n in the n boxes of the diagram. A "standard" Young tableau is a Young ...

Percolation, the fundamental notion at the heart of percolation theory, is a difficult idea to define precisely though it is quite easy to describe qualitatively. From the ...

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

The sinc function sinc(x), also called the "sampling function," is a function that arises frequently in signal processing and the theory of Fourier transforms. The full name ...

A (-1,1)-matrix is a matrix whose elements consist only of the numbers -1 or 1. For an n×n (-1,1)-matrix, the largest possible determinants (Hadamard's maximum determinant ...

An acyclic graph is a graph having no graph cycles. Acyclic graphs are bipartite. A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is ...

Suppose that X is a vector space over the field of complex or real numbers. Then the set of all linear functionals on X forms a vector space called the algebraic conjugate ...

Let K be a field, and A a K-algebra. Elements y_1, ..., y_n are algebraically independent over K if the natural surjection K[Y_1,...,Y_n]->K[y_1,...,y_n] is an isomorphism. ...

Consider the circle map. If K is nonzero, then the motion is periodic in some finite region surrounding each rational Omega. This execution of periodic motion in response to ...

A Banach algebra is an algebra B over a field F endowed with a norm ||·|| such that B is a Banach space under the norm ||·|| and ||xy||<=||x||||y||. F is frequently taken to ...