Search Results for ""

Let F(nu) and G(nu) be the Fourier transforms of f(t) and g(t), respectively. Then int_(-infty)^inftyf(t)g^_(t)dt ...

A puzzle involving disentangling a set of rings from a looped double rod, originally used by French peasants to lock chests (Steinhaus 1999). The word "baguenaudier" means ...

Suppose that E(G) (the commuting product of all components of G) is simple and G contains a semisimple group involution. Then there is some semisimple group involution x such ...

A numerical knot invariant. For a tame knot K, the bridge index is the least bridge number of all planar representations of the knot. The bridge index of the unknot is ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

A prime factorization algorithm.

A measure algebra which has many properties associated with the convolution measure algebra of a group, but no algebraic structure is assumed for the underlying space.

A game in which the possible moves are the same for each player in any position. All positions in all impartial games form an additive Abelian group. For impartial games in ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

The kernel of a ring homomorphism f:R-->S is the set of all elements of R which are mapped to zero. It is the kernel of f as a homomorphism of additive groups. It is an ideal ...