Search Results for ""

Let R be a ring, and let I be an ideal of R. The correspondence A<->A/I is an inclusion preserving bijection between the set of subrings A of R that contain I and the set of ...

The maximum possible weight of a fractional clique of a graph G is called the fractional clique number of G, denoted omega^*(G) (Godsil and Royle 2001, pp. 136-137) or ...

In 1750, Benjamin Franklin constructed the above 8×8 semimagic square having magic constant 260. Any half-row or half-column in this square totals 130, and the four corners ...

A Fredholm integral equation of the first kind is an integral equation of the form f(x)=int_a^bK(x,t)phi(t)dt, (1) where K(x,t) is the kernel and phi(t) is an unknown ...

Fredholm's theorem states that, if A is an m×n matrix, then the orthogonal complement of the row space of A is the null space of A, and the orthogonal complement of the ...

Let a^p+b^p=c^p be a solution to Fermat's last theorem. Then the corresponding Frey curve is y^2=x(x-a^p)(x+b^p). (1) Ribet (1990a) showed that such curves cannot be modular, ...

A friendly number is a number that is a member of a friendly pair or a higher-order friendly n-tuple. Numbers that are not friendly are said to be solitary. There are some ...

The Frobenius number is the largest value b for which the Frobenius equation a_1x_1+a_2x_2+...+a_nx_n=b, (1) has no solution, where the a_i are positive integers, b is an ...

Frucht's theorem states that every finite group is the automorphism group of a finite undirected graph. This was conjectured by König (1936) and proved by Frucht (1939). In ...

The full width at half maximum (FWHM) is a parameter commonly used to describe the width of a "bump" on a curve or function. It is given by the distance between points on the ...