Search Results for ""

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 ...

There are two distinct entities both known as the Lagrange number. The more common one arises in rational approximation theory (Conway and Guy 1996), while the other refers ...

Consider a line segment of length 1, and pick a point x at random between [0,1]. This point x divides the line into line segments of length x and 1-x. If a set of points are ...

The Lotka-Volterra equations describe an ecological predator-prey (or parasite-host) model which assumes that, for a set of fixed positive constants A (the growth rate of ...

The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...

A permutation problem invented by Cayley. Let the numbers 1, 2, ..., n be written on a set of cards, and shuffle this deck of cards. Now, start counting using the top card. ...