Search Results for ""

A field is any set of elements that satisfies the field axioms for both addition and multiplication and is a commutative division algebra. An archaic name for a field is ...

For a field K with multiplicative identity 1, consider the numbers 2=1+1, 3=1+1+1, 4=1+1+1+1, etc. Either these numbers are all different, in which case we say that K has ...

A finite field is a field with a finite field order (i.e., number of elements), also called a Galois field. The order of a finite field is always a prime or a power of a ...

By choosing appropriate rules, it is possible to achieve many forms of synchronization within cellular automata. One version, known as the firing squad synchronization ...

Simply stated, floating-point algebra is algebra performed on floating-point representations by any number of automated devices. Traditionally, this definition is phrased so ...

Simply stated, floating-point arithmetic is arithmetic performed on floating-point representations by any number of automated devices. Traditionally, this definition is ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

A problem listed in a fall issue of Gazeta Matematică in the mid-1970s posed the question if x_1>0 and x_(n+1)=(1+1/(x_n))^n (1) for n=1, 2, ..., then are there any values ...

The folded n-cube graph, perhaps better termed "folded hypercube graph," is a graph obtained by merging vertices of the n-hypercube graph Q_n that are antipodal, i.e., lie at ...

Consider the forms Q for which the generic characters chi_i(Q) are equal to some preassigned array of signs e_i=1 or -1, e_1,e_2,...,e_r, subject to product_(i=1)^(r)e_i=1. ...