Search Results for ""

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...

An injective module is the dual notion to the projective module. A module M over a unit ring R is called injective iff whenever M is contained as a submodule in a module N, ...

Let three equal circles with centers J_A, J_B, and J_C intersect in a single point H and intersect pairwise in the points A, B, and C. Then the circumcircle O of the ...

The Löwenheim-Skolem theorem is a fundamental result in model theory which states that if a countable theory has a model, then it has a countable model. Furthermore, it has a ...

A maze, also known as a labyrinth, as is a set of passages (with impermeable walls). The goal of the maze is to start at one given point and find a path through the passages ...

Multivariate zeta function, also called multiple zeta values, multivariate zeta constants (Bailey et al. 2006, p. 43), multi-zeta values (Bailey et al. 2006, p. 17), and ...

The Poincaré hyperbolic disk is a two-dimensional space having hyperbolic geometry defined as the disk {x in R^2:|x|<1}, with hyperbolic metric ...

A projective module generalizes the concept of the free module. A module M over a nonzero unit ring R is projective iff it is a direct summand of a free module, i.e., of some ...

The rascal triangle is a number triangle with numbers arranged in staggered rows such that a_(n,r)=n(r-n)+1. (1) The published study of this triangle seems to have originated ...

The resolution principle, due to Robinson (1965), is a method of theorem proving that proceeds by constructing refutation proofs, i.e., proofs by contradiction. This method ...