Search Results for ""

A unit is an element in a ring that has a multiplicative inverse. If a is an algebraic integer which divides every algebraic integer in the field, a is called a unit in that ...

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...

An urelement contains no elements, belongs to some set, and is not identical with the empty set (Moore 1982, p. 3; Rubin 1967, p. 23). "Ur" is a German prefix which is ...

Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...

For a second-order ordinary differential equation, y^('')+p(x)y^'+q(x)y=g(x). (1) Assume that linearly independent solutions y_1(x) and y_2(x) are known to the homogeneous ...

Let a vault consist of two equal half-cylinders of radius r which intersect at right angles so that the lines of their intersections (the "groins") terminate in the ...

If W is a k-dimensional subspace of a vector space V with inner product <,>, then it is possible to project vectors from V to W. The most familiar projection is when W is the ...

A weak snark is a cyclically 4-edge connected cubic graph with edge chromatic number 4 and girth at least 4 (Brinkmann et al. 2013). Weak snarks therefore represent a more ...

The notion of weak amenability was first introduced by Bade et al. (1987), who termed a commutative Banach algebra A "weakly amenable" if every continuous derivation from A ...

A prime number is said to be weakly prime if changing a single digit to every other possible digit produces a composite number when performed on each digit. The first few ...