Search Results for ""

The Sherman-Morrison formula is a formula that allows a perturbed matrix to be computed for a change to a given matrix A. If the change can be written in the form u tensor v ...

The Shi-Krotov-Solé graph is a weakly regular graph on 1024 vertices with regular parameters (nu,k,lambda,mu)=(1024,33,2,(0,2)). It is distance-regular but not ...

A short exact sequence of groups A, B, and C is given by two maps alpha:A->B and beta:B->C and is written 0->A->B->C->0. (1) Because it is an exact sequence, alpha is ...

The shortest path problem seeks to find the shortest path (a.k.a. graph geodesic) connecting two specific vertices (u,v) of a directed or undirected graph. The length of the ...

A Julia set with c=-0.390541-0.586788i. The fractal somewhat resembles the better known Mandelbrot set.

There are at least two Siegel's theorems. The first states that an elliptic curve can have only a finite number of points with integer coordinates. The second states that if ...

A fractal which can be written as a Lindenmayer system with initial string "YF", string rewriting rules "X" -> "YF+XF+Y", "Y" -> "XF-YF-X", and angle 60 degrees.

Let the sum of squares function r_k(n) denote the number of representations of n by k squares, then the summatory function of r_2(k)/k has the asymptotic expansion ...

The conjecture that all integers >1 occur as a value of the totient valence function (i.e., all integers >1 occur as multiplicities). The conjecture was proved by Ford ...

For any M, there exists a t^' such that the sequence n^2+t^', where n=1, 2, ... contains at least M primes.