Search Results for ""

In logic, the term "homomorphism" is used in a manner similar to but a bit different from its usage in abstract algebra. The usage in logic is a special case of a "morphism" ...

The point T at which the lines through the polygon vertices of a triangle perpendicular to the corresponding sides of the first Brocard triangle, are concurrent. The Tarry ...

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

The number two (2) is the second positive integer and the first prime number. It is even, and is the only even prime (the primes other than 2 are called the odd primes). The ...

Let s(n)=sigma(n)-n, where sigma(n) is the divisor function and s(n) is the restricted divisor function. Then the sequence of numbers s^0(n)=n,s^1(n)=s(n),s^2(n)=s(s(n)),... ...

An Andreini tessellation is a three-dimensional equivalent of a semiregular tessellation. There are 28 such tessellations.

If a map f:G->G^' from a group G to a group G^' satisfies f(ab)=f(b)f(a) for all a,b in G, then f is said to be an antihomomorphism. Moreover, if G and G^' are isomorphic, ...

A valuation for which |x|<=1 implies |1+x|<=C for the constant C=1 (independent of x). Such a valuation does not satisfy the strong triangle inequality |x+y|<=max(|x|,|y|).

A group in which any decreasing chain of distinct subgroups terminates after a finite number.