Search Results for ""

The evolute of Cayley's sextic with parametrization x = 4acos^3(1/3theta)cost (1) y = 4acos^3(1/3theta)sint (2) is given by x_e = 1/4[2+3cos(2/3t)-cos(2t)] (3) y_e = ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...

The Soicher graphs are three distance-regular graphs on 5346, 486, and 315 vertices, respectively. The first two are also distance-transitive but the third is not. The second ...

The Parts graphs are a set of unit-distance graphs with chromatic number five derived by Jaan Parts in 2019-2020 (Parts 2020a). They provide some of the smallest known ...

If (1-z)^(a+b-c)_2F_1(2a,2b;2c;z)=sum_(n=0)^inftya_nz^n, then where (a)_n is a Pochhammer symbol and _2F_1(a,b;c;z) is a hypergeometric function.

The number of coincidences of a (nu,nu^') correspondence of value gamma on a curve of curve genus p is given by nu+nu^'+2pgamma.

The metric of Felix Klein's model for hyperbolic geometry, g_(11) = (a^2(1-x_2^2))/((1-x_1^2-x_2^2)^2) (1) g_(12) = (a^2x_1x_2)/((1-x_1^2-x_2^2)^2) (2) g_(22) = ...

There are (at least) two graphs associated with Ellingham and Horton. These graphs on 54 and 78 nodes respectively, illustrated above, are examples of 3-connected bicubic ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...