Search Results for ""

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

An n-dimensional manifold M is said to be a homotopy sphere, if it is homotopy equivalent to the n-sphere S^n. Thus no homotopy group can distinguish between M and S^n. The ...

A formula for the number of Young tableaux associated with a given Ferrers diagram. In each box, write the sum of one plus the number of boxes horizontally to the right and ...

A polynomial map phi_(f), with f=(f_1,...,f_n) in (K[X_1,...,X_n])^m in a field K is called invertible if there exist g_1,...,g_m in K[X_1,...,x_n] such that ...

Finding the densest not necessarily periodic sphere packing.

Every Möbius strip dissection of unequal squares can be glued along its edge to produce a dissection of the Klein bottle. There are no other ways to tile a Klein bottle with ...

n divides a^n-a for all integers a iff n is squarefree and (p-1)|(n-1) for all prime divisors p of n. Carmichael numbers satisfy this criterion.

The conjecture that the Artin L-function of any n-dimensional complex representation of the Galois group of a finite extension of the rational numbers Q is an Artin ...

A type of diagram invented by Lewis Carroll (the name is an abbreviation of "Lewis") that can be used to determine the number of minimal covers of n numbers with k members.

Let each sphere in a sphere packing expand uniformly until it touches its neighbors on flat faces. Call the resulting polyhedron the local cell. Then the local density is ...