Search Results for ""

Gelfond's theorem, also called the Gelfond-Schneider theorem, states that a^b is transcendental if 1. a is algebraic !=0,1 and 2. b is algebraic and irrational. This provides ...

Ore (1962) noted that not only does a tree possesses a unique shortest path between any two vertices, but that there also exist also other connected graphs having the same ...

A group G is said to act on a set X when there is a map phi:G×X->X such that the following conditions hold for all elements x in X. 1. phi(e,x)=x where e is the identity ...

A representation of a group G is a group action of G on a vector space V by invertible linear maps. For example, the group of two elements Z_2={0,1} has a representation phi ...

Given two randomly chosen n×n integer matrices, what is the probability D(n) that the corresponding determinants are relatively prime? Hafner et al. (1993) showed that ...

There are at least two definitions of hypercomplex numbers. Clifford algebraists call their higher dimensional numbers hypercomplex, even though they do not share all the ...

Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...

The Kubo-Martin-Schwinger (KMS) condition is a kind of boundary-value condition which naturally emerges in quantum statistical mechanics and related areas. Given a quantum ...

A combinatorial conjecture formulated by Kneser (1955). It states that whenever the n-subsets of a (2n+k)-set are divided into k+1 classes, then two disjoint subsets end up ...

Minkowski's conjecture states that every lattice tiling of R^n by unit hypercubes contains two hypercubes that meet in an (n-1)-dimensional face. Minkowski first considered ...