Search Results for ""

The least common denominator of a collection of fractions (p_1)/(q_1),...,(p_n)/(q_n) is the least common multiple LCM(q_1,...,q_n) of their denominators.

Let S={x_1,...,x_n} be a set of n distinct positive integers. Then the matrix [S]_n having the least common multiple LCM(x_i,x_j) of x_i and x_j as its i,jth entry is called ...

Suppose that {f_n} is a sequence of measurable functions, that f_n->f pointwise almost everywhere as n->infty, and that |f_n|<=g for all n, where g is integrable. Then f is ...

Given a point P and a line AB, draw the perpendicular through P and call it PC. Let PD be any other line from P which meets CB in D. In a hyperbolic geometry, as D moves off ...

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...

A tree not having the complete bipartite graph K_(1,2) with base at the vertex of degree two as a limb (Lu et al. 1993, Lu 1996).

A random process whose future probabilities are determined by its most recent values. A stochastic process x(t) is called Markov if for every n and t_1<t_2...<t_n, we have ...

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...

The middle levels conjecture, also known as revolving door conjecture, posits that the middle layer graph has a Hamilton cycle for every n>=1. The conjecture was proved by ...

The minimum vertex degree, sometimes simply called the minimum degree, of a graph G is the smallest vertex degree of G, denoted delta.