Search Results for ""

Let G=SL(n,C). If lambda in Z^n is the highest weight of an irreducible holomorphic representation V of G, (i.e., lambda is a dominant integral weight), then the G-map ...

Let T be a tree defined on a metric over a set of paths such that the distance between paths p and q is 1/n, where n is the number of nodes shared by p and q. Let A be a ...

A codeword is an element of an error-correcting code C. If C has length n, then a codeword in C has the form (c_1,c_2,...,c_n), where each c_i is a letter in the alphabet of ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.

A lattice which satisfies the identities (x ^ y) v (x ^ z)=x ^ (y v z) (x v y) ^ (x v z)=x v (y ^ z) is said to be distributive.

For any integers a_i with 1<=a_1<a_2<...<a_k<=n, the proportion of permutations in the symmetric group S_n whose cyclic decompositions contain no cycles of lengths a_1, a_2, ...

A term of endearment used by algebraic topologists when talking about their favorite power tools such as Abelian groups, bundles, homology groups, homotopy groups, K-theory, ...

Let p be an odd prime and b a positive integer not divisible by p. Then for each positive odd integer 2k-1<p, let r_k be r_k=(2k-1)b (mod p) with 0<r_k<p, and let t be the ...

The term in rigidity theory for the edges of a graph.