TOPICS
Search

Search Results for ""


341 - 350 of 750 for Knuth Bendix Completion AlgorithmSearch Results
A piecewise function is a function that is defined on a sequence of intervals. A common example is the absolute value, |x|={-x for x<0; 0 for x=0; x for x>0. (1) Piecewise ...
The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas ...
If replacing each number by its square in a magic square produces another magic square, the square is said to be a bimagic square. Bimagic squares are also called doubly ...
Let B_t={B_t(omega)/omega in Omega}, t>=0, be one-dimensional Brownian motion. Integration with respect to B_t was defined by Itô (1951). A basic result of the theory is that ...
There are several different definitions of the term "unital" used throughout various branches of mathematics. In geometric combinatorics, a block design of the form (q^3+1, ...
Consider expressions built up from variables and constants using function symbols. If v_1, ..., v_n are variables and t_1, ..., t_n are expressions, then a set of mappings ...
The permanent is an analog of a determinant where all the signs in the expansion by minors are taken as positive. The permanent of a matrix A is the coefficient of x_1...x_n ...
A node which is one graph edge further away from a given node in a rooted tree.
A solitaire game played with cards. The chance of winning is 1/13, and the arithmetic mean of the number of cards turned up is 42.4.
A matrix with 0 determinant whose determinant becomes nonzero when any element on or below the diagonal is changed from 0 to 1. An example is M=[1 -1 0 0; 0 0 -1 0; 1 1 1 -1; ...
1 ... 32|33|34|35|36|37|38 ... 75 Previous Next

...