Search Results for ""

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 ...

Five point geometry is a finite geometry subject to the following three axioms: 1. there exist exactly five points, 2. each two distinct points have exactly one line on both ...

Simply stated, floating-point arithmetic is arithmetic performed on floating-point representations by any number of automated devices. Traditionally, this definition is ...

Four line geometry is a finite geometry subject to the following three axioms: 1. there exist exactly four lines, 2. any two distinct lines have exactly one point of on both ...

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 tabulation of raw data obtained by dividing it into classes of some size and computing the number of data elements (or their fraction out of the total) falling within ...

This is sometimes knows as the "bars and stars" method. Suppose a recipe called for 5 pinches of spice, out of 9 spices. Each possibility is an arrangement of 5 spices ...

The second-order ordinary differential equation (1-x^2)y^('')-2(mu+1)xy^'+(nu-mu)(nu+mu+1)y=0 (1) sometimes called the hyperspherical differential equation (Iyanaga and ...

The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...