Search Results for ""

An odd alternating permutation number, more commonly called an Euler number or secant number.

The de Grey-Haugstrup graphs are two 6-chromatic graphs on 47 and 48 vertices that are unit-distance in 3 dimensions (de Grey and Haugstrup 2020).

A k-colored graph is a labeled k-colorable graph together with its coloring function (Finch 2003).

A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...

A q-analog of the multinomial coefficient, defined as ([a_1+...+a_n]_q!)/([a_1]_q!...[a_n]_q!), where [n]_q! is a q-factorial.

A t-(v,k,lambda) block design (abbreviated t-design) is an incidence structure of points and blocks such that the following hold: 1. There are v points, 2. Each block ...

The Bernoulli distribution is a discrete distribution having two possible outcomes labelled by n=0 and n=1 in which n=1 ("success") occurs with probability p and n=0 ...

Roman (1984, p. 26) defines "the" binomial identity as the equation p_n(x+y)=sum_(k=0)^n(n; k)p_k(y)p_(n-k)(x). (1) Iff the sequence p_n(x) satisfies this identity for all y ...

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

The Hartley Transform is an integral transform which shares some features with the Fourier transform, but which, in the most common convention, multiplies the integral kernel ...