Search Results for ""

Macdonald's constant term conjectures are related to root systems of Lie algebras (Macdonald 1982, Andrews 1986). They can be regarded as generalizations of Dyson's ...

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...

Consider the Euler product zeta(s)=product_(k=1)^infty1/(1-1/(p_k^s)), (1) where zeta(s) is the Riemann zeta function and p_k is the kth prime. zeta(1)=infty, but taking the ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. A vertex coloring that minimize ...

The nearest integer function, also called nint or the round function, is defined such that nint(x) is the integer closest to x. While the notation |_x] is sometimes used to ...

The negabinary representation of a number n is its representation in base -2 (i.e., base negative 2). It is therefore given by the coefficients a_na_(n-1)...a_1a_0 in n = ...

The Nevanlinna Prize is awarded by the International Mathematical Union to outstanding contributors to the mathematical aspects of information science. The International ...

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...

The pentaflake is a fractal with 5-fold symmetry. As illustrated above, five pentagons can be arranged around an identical pentagon to form the first iteration of the ...

An involution of a set S is a permutation of S which does not contain any permutation cycles of length >2 (i.e., it consists exclusively of fixed points and transpositions). ...