Search Results for ""

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

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

The double graph of a given graph G is constructed by making two copies of G (including the initial edge set of each) and adding edges u_1v_2 and v_1u_2 for every edge uv of ...

Let C be a smooth geometrically connected projective curve over F_q with q=p^s a prime power. Let infty be a fixed closed point of X but not necessarily F_q-rational. A ...

The set containing no elements, commonly denoted emptyset or emptyset, the former of which is used in this work. These correspond to Wolfram Language and TeX characters ...

The Diophantine equation sum_(j=1)^(m-1)j^n=m^n. Erdős conjectured that there is no solution to this equation other than the trivial solution 1^1+2^1=3^1, although this ...

By choosing appropriate rules, it is possible to achieve many forms of synchronization within cellular automata. One version, known as the firing squad synchronization ...

A manifold with a Riemannian metric that has zero curvature is a flat manifold. The basic example is Euclidean space with the usual metric ds^2=sum_(i)dx_i^2. In fact, any ...

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 l(x) be an nth degree polynomial with zeros at x_1, ..., x_n. Then the fundamental Hermite interpolating polynomials of the first and second kinds are defined by ...