Search Results for ""

The term in rigidity theory for the edges of a graph.

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

There exists a system of distinct representatives for a family of sets S_1, S_2, ..., S_m iff the union of any k of these sets contains at least k elements for all k from 1 ...

A sequence of positive integers {a_n} such that sum1/(a_nb_n) is irrational for all integer sequences {b_n}. Erdős showed that {2^(2^n)}={1,2,4,16,256,...} (OEIS A001146) is ...

If algebraic integers alpha_1, ..., alpha_n are linearly independent over Q, then e^(alpha_1), ..., e^(alpha_n) are algebraically independent over Q. The ...

The least number of crossings that occur in any projection of a link. In general, it is difficult to find the crossing number of a given link. Knots and links are generally ...

subjMathematics:Discrete Mathematics:Graph Theory:Cliques The maximal clique polynomial C_G(x) for the graph G may be defined as the polynomial ...

Let q be a positive integer, then Gamma_0(q) is defined as the set of all matrices [a b; c d] in the modular group Gamma Gamma with c=0 (mod q). Gamma_0(q) is a subgroup of ...

A lattice which satisfies the identity (x ^ y) v (x ^ z)=x ^ (y v (x ^ z)) is said to be modular.

An important result in ergodic theory. It states that any two "Bernoulli schemes" with the same measure-theoretic entropy are measure-theoretically isomorphic.