Search Results for ""

Regular expressions define formal languages as sets of strings over a finite alphabet. Let sigma denote a selected alphabet. Then emptyset is a regular expression that ...

Given a hypergeometric or generalized hypergeometric function _pF_q(a_1,...,a_p;b_1,...,b_q;z), the corresponding regularized hypergeometric function is defined by where ...

If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.

A smooth manifold M=(M,g) is said to be semi-Riemannian if the indexMetric Tensor Index of g is nonzero. Alternatively, a smooth manifold is semi-Riemannian provided that it ...

Slovin's formula, somtimes also spelled "Sloven's forumula (e.g., Altares et al. 2003, p. 13), is an ad hoc formula lacking mathematical rigor (Ryan 2013) that gives an ...

Given the sum-of-factorials function Sigma(n)=sum_(k=1)^nk!, SW(p) is the smallest integer for p prime such that Sigma[SW(p)] is divisible by p. If pSigma(n) for all n<p, ...

The Sombor energy of a graph is defined as the graph energy of its Sombor matrix, i.e., the sum of the absolute values of the eigenvalues of its Sombor matrix.

Whirls are figures constructed by nesting a sequence of polygons (each having the same number of sides), each slightly smaller and rotated relative to the previous one. The ...

A Z-number is a real number xi such that 0<=frac[(3/2)^kxi]<1/2 for all k=1, 2, ..., where frac(x) is the fractional part of x. Mahler (1968) showed that there is at most one ...

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...