Search Results for ""

The triangle DeltaN_1N_2N_3 formed by joining a set of three Neuberg centers (i.e., centers of the Neuberg circles) obtained from the edges of a given triangle DeltaA_1A_2A_3 ...

The Games graph is a strongly regular graph on 729 vertices with parameters (nu,k,lambda,mu)=(729,112,1,20). It is distance-regular but not distance-transitive with ...

An adaptive Gaussian quadrature method for numerical integration in which error is estimation based on evaluation at special points known as "Kronrod points." By suitably ...

The Greek problems of antiquity were a set of geometric problems whose solution was sought using only compass and straightedge: 1. circle squaring. 2. cube duplication. 3. ...

A plane path on a set of equally spaced lattice points, starting at the origin, where the first step is one unit to the north or south, the second step is two units to the ...

The plane figure formed by a sequence of circles C_1, C_2, C_3, ... that are all tangent to each other at the same point and such that the sequence of radii converges to ...

An interpretation of first-order logic consists of a non-empty domain D and mappings for function and predicate symbols. Every n-place function symbol is mapped to a function ...

Let G_1, G_2, ..., G_t be a t-graph edge coloring of the complete graph K_n, where for each i=1, 2, ..., t, G_i is the spanning subgraph of K_n consisting of all graph edges ...

A Kirkman triple system of order v=6n+3 is a Steiner triple system with parallelism (Ball and Coxeter 1987), i.e., one with the following additional stipulation: the set of ...

Kloosterman's sum is defined by S(u,v,n)=sum_(h)exp[(2pii(uh+vh^_))/n], (1) where h runs through a complete set of residues relatively prime to n and h^_ is defined by hh^_=1 ...