Search Results for ""

A set is a finite or infinite collection of objects in which order has no significance, and multiplicity is generally also ignored (unlike a list or multiset). Members of a ...

The nth-order Sierpiński tetrahedron graph is the connectivity graph of black triangles in the nth iteration of the tetrix fractal. The first three iterations are shown ...

A formula of first-order logic is said to be in Skolemized form (sometimes also called Skolem standard form or universal form) if it is of the form forall x_1... forall x_nM, ...

The group of all nonsingular n×n stochastic matrices over a field F. It is denoted S(n,F). If p is prime and F is the finite field of order q=p^m, S(n,q) is written instead ...

Chebyshev-Gauss quadrature, also called Chebyshev quadrature, is a Gaussian quadrature over the interval [-1,1] with weighting function W(x)=(1-x^2)^(-1/2) (Abramowitz and ...

The first Brocard point Omega is the interior point Omega (also denoted tau_1 or Z_1) of a triangle DeltaABC with points labeled in counterclockwise order for which the ...

In 1757, V. Riccati first recorded the generalizations of the hyperbolic functions defined by F_(n,r)^alpha(x)=sum_(k=0)^infty(alpha^k)/((nk+r)!)x^(nk+r), (1) for r=0, ..., ...

A minimal surface and double algebraic surface of 15th order and fifth class which can be given by parametric equations x(u,v) = 2sinhucosv-2/3sinh(3u)cos(3v) (1) y(u,v) = ...

An L-algebraic number is a number theta in (0,1) which satisfies sum_(k=0)^nc_kL(theta^k)=0, (1) where L(x) is the Rogers L-function and c_k are integers not all equal to 0 ...

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