Search Results for ""

The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...

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

Cayley's cubic surface is the unique cubic surface having four ordinary double points (Hunt), the maximum possible for cubic surface (Endraß). The Cayley cubic is invariant ...

The function [x] which gives the smallest integer >=x, shown as the thick curve in the above plot. Schroeder (1991) calls the ceiling function symbols the "gallows" because ...

The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...

Let X_1,X_2,...,X_N be a set of N independent random variates and each X_i have an arbitrary probability distribution P(x_1,...,x_N) with mean mu_i and a finite variance ...

The nth central trinomial coefficient is defined as the coefficient of x^n in the expansion of (1+x+x^2)^n. It is therefore the middle column of the trinomial triangle, i.e., ...

A Chaitin's constant, also called a Chaitin omega number, introduced by Chaitin (1975), is the halting probability of a universal prefix-free (self-delimiting) Turing ...

The first few terms in the continued fraction of the Champernowne constant are [0; 8, 9, 1, 149083, 1, 1, 1, 4, 1, 1, 1, 3, 4, 1, 1, 1, 15, 45754...10987, 6, 1, 1, 21, ...] ...

The Champernowne constant has decimal expansion C=0.1234567891011... (OEIS A033307). The Earls sequence (starting position of n copies of the digit n) for e is given for n=1, ...