Search Results for ""

The word adjoint has a number of related meanings. In linear algebra, it refers to the conjugate transpose and is most commonly denoted A^(H). The analogous concept applied ...

Let X be an alphabet (i.e., a finite and nonempty set), and call its member letters. A word on X is a finite sequence of letters a_1...a_n, where a_1,...,a_n in X. Denote the ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

An Appell sequence is a Sheffer sequence for (g(t),t). Roman (1984, pp. 86-106) summarizes properties of Appell sequences and gives a number of specific examples. The ...

"At least one" is a mathematical term meaning one or more. It is commonly used in situations where existence can be established but it is not known how to determine the total ...

A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). An augmenting path for a ...

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...

The binary logarithm log_2x is the logarithm to base 2. The notation lgx is sometimes used to denote this function in number theoretic literature. However, because Russian ...

Bit rate (i.e., bits per second, abbreviated bps) is a measure of the number of data bits (digital 0s and 1s) transmitted each second in a digital communications channel. If ...

Let (x_0x_1x_2...) be a sequence over a finite alphabet A (all the entries are elements of A). Define the block growth function B(n) of a sequence to be the number of ...