Search Results for ""

Let f(t) and g(t) be arbitrary functions of time t with Fourier transforms. Take f(t) = F_nu^(-1)[F(nu)](t)=int_(-infty)^inftyF(nu)e^(2piinut)dnu (1) g(t) = ...

The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...

Let a, b, and c be the side lengths of a reference triangle DeltaABC. Now let A_b be a point on the extension of the segment CA beyond A such that AA_b=a. Similarly, define ...

Conway games were introduced by J. H. Conway in 1976 to provide a formal structure for analyzing games satisfying certain requirements: 1. There are two players, Left and ...

There are a number of graphs associated with J. H. Conway. The first is the unique rank-3 strongly regular graph with parameters (nu,k,lambda,mu)=(1408,567,246,216) with ...

The automorphism group Co_1 of the Leech lattice modulo a center of order two is called "the" Conway group. There are 15 exceptional conjugacy classes of the Conway group. ...

A notation for polyhedra which begins by specifying a "seed" polyhedron using a capital letter. The Platonic solids are denoted T (tetrahedron), O (octahedron), C (cube), I ...

The Conway polynomial del _L(x), sometimes known as the Conway-Alexander polynomial, is a modified version of the Alexander polynomial Delta_L(x) that was formulated by J. H. ...

Construct a 5×5×5 cube from thirteen 1×2×4 blocks, one 2×2×2 block, one 1×2×2, and three 1×1×3 blocks.

The look and say sequence generated from a starting digit of 3, as given by Vardi (1991).