Search Results for ""

Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...

Based on methods developer in collaboration with M. Leclert, Catalan (1865) computed the constant K=0.915965594177... (OEIS A006752) now known as Catalans' constant to 9 ...

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...

In the technical combinatorial sense, an a-ary necklace of length n is a string of n characters, each of a possible types. Rotation is ignored, in the sense that b_1b_2...b_n ...

The Petersen family of graphs, not to be confused with generalized Petersen graphs, are a set of seven graphs obtained from the Petersen graph (or complete graph K_6) by del ...

A special function is a function (usually named after an early investigator of its properties) having a particular use in mathematical physics or some other branch of ...

A "weird number" is a number that is abundant (i.e., the sum of proper divisors is greater than the number) without being pseudoperfect (i.e., no subset of the proper ...

A connective in logic known as the "exclusive or," or exclusive disjunction. It yields true if exactly one (but not both) of two conditions is true. The XOR operation does ...