Search Results for ""

Let L be a language of first-order predicate logic, let I be an indexing set, and for each i in I, let A_i be a structure of the language L. Let u be an ultrafilter in the ...

A unit matrix is an integer matrix consisting of all 1s. The m×n unit matrix is often denoted J_(mn), or J_n if m=n. Square unit matrices J_n have determinant 0 for n>=2. An ...

Although the multiplication of one vector by another is not uniquely defined (cf. scalar multiplication, which is multiplication of a vector by a scalar), several types of ...

Let sum_(n=1)^(infty)u_n(x) be a series of functions all defined for a set E of values of x. If there is a convergent series of constants sum_(n=1)^inftyM_n, such that ...

A zero-symmetric graph is a vertex-transitive cubic graph whose edges are partitioned into three orbits by its automorphism group. The figures above show some small ...

A Boolean algebra is a mathematical structure that is similar to a Boolean ring, but that is defined using the meet and join operators instead of the usual addition and ...

By the duality principle, for every polyhedron, there exists another polyhedron in which faces and polyhedron vertices occupy complementary locations. This polyhedron is ...

The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...

When the index nu is real, the functions J_nu(z), J_nu^'(z), Y_nu(z), and Y_nu^'(z) each have an infinite number of real zeros, all of which are simple with the possible ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...