Search Results for ""

Condorcet's jury theorem states that given a group of voters (a "jury") independently choosing by majority vote between a correct outcome with probability 0<=p<=1 and an ...

Pairs of partitions for a single number whose Ferrers diagrams transform into each other when reflected about the line y=-x, with the coordinates of the upper left dot taken ...

The empire problem, also known as the m-pire problem) asks for the maximum number of colors needed to color countries such that no two countries sharing a common border have ...

A mathematical structure first introduced by Kolyvagin (1990) and defined as follows. Let T be a finite-dimensional p-adic representation of the Galois group of a number ...

For a field K with multiplicative identity 1, consider the numbers 2=1+1, 3=1+1+1, 4=1+1+1+1, etc. Either these numbers are all different, in which case we say that K has ...

A free Abelian group is a group G with a subset which generates the group G with the only relation being ab=ba. That is, it has no group torsion. All such groups are a direct ...

The group theoretical term for what is known to physicists, by way of its connection with matrix traces, as the trace. The powerful group orthogonality theorem gives a number ...

Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...

Given two topological spaces M and N, place an equivalence relationship on the continuous maps f:M->N using homotopies, and write f_1∼f_2 if f_1 is homotopic to f_2. Roughly ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...