Search Results for ""

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

There are three types of so-called fundamental forms. The most important are the first and second (since the third can be expressed in terms of these). The fundamental forms ...

Two mathematical objects are said to be homotopic if one can be continuously deformed into the other. For example, the real line is homotopic to a single point, as is any ...

An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...

An interval is a connected portion of the real line. If the endpoints a and b are finite and are included, the interval is called closed and is denoted [a,b]. If the ...

The Kronecker-Weber theorem, sometimes known as the Kronecker-Weber-Hilbert theorem, is one of the earliest known results in class field theory. In layman's terms, the ...

A grand unified theory of mathematics which includes the search for a generalization of Artin reciprocity (known as Langlands reciprocity) to non-Abelian Galois extensions of ...

The lattice method is an alternative to long multiplication for numbers. In this approach, a lattice is first constructed, sized to fit the numbers being multiplied. If we ...

Let L_n be the n×n matrix whose (i,j)th entry is 1 if j divides i and 0 otherwise, let Phi_n be the n×n diagonal matrix diag(phi(1),phi(2),...,phi(n)), where phi(n) is the ...

A linear transformation between two vector spaces V and W is a map T:V->W such that the following hold: 1. T(v_1+v_2)=T(v_1)+T(v_2) for any vectors v_1 and v_2 in V, and 2. ...