Search Results for ""

The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...

In general, a frieze consists of repeated copies of a single motif. b ; a d; c Conway and Guy (1996) define a frieze pattern as an arrangement of numbers at the intersection ...

The Frobenius norm, sometimes also called the Euclidean norm (a term unfortunately also used for the vector L^2-norm), is matrix norm of an m×n matrix A defined as the square ...

A graph G is fully reconstructible in C^d if the graph is determined from its d-dimensional measurement variety. If G is globally rigid in R^d on n>=d+2 vertices, then G is ...

An integer d is a fundamental discriminant if it is not equal to 1, not divisible by any square of any odd prime, and satisfies d=1 (mod 4) or d=8,12 (mod 16). The function ...

A set of algebraic invariants for a quantic such that any invariant of the quantic is expressible as a polynomial in members of the set. Gordan (1868) proved the existence of ...

Any symmetric polynomial (respectively, symmetric rational function) can be expressed as a polynomial (respectively, rational function) in the elementary symmetric ...

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...

Let C=C^+ union C^- (where C^+ intersection C^-=emptyset) be the disjoint union of two finite components C^+ and C^-. Let alpha and beta be two involutions on C, each of ...

Finch (2010) gives an overview of known results for random Gaussian triangles. Let the vertices of a triangle in n dimensions be normal (normal) variates. The probability ...