Search Results for ""

A sequence defined from a finite sequence a_0, a_1, ..., a_n by defining a_(n+1)=max_(i)(a_i+a_(n-i)).

Let (A,<=) be a partially ordered set. Then an element m in A is said to be maximal if, for all a in A, m!<=a. Alternatively, an element m in A is maximal such that if m<=a ...

A maximal sum-free set is a set {a_1,a_2,...,a_n} of distinct natural numbers such that a maximum l of them satisfy a_(i_j)+a_(i_k)!=a_m, for 1<=j<k<=l, 1<=m<=n.

A set having the largest number k of distinct residue classes modulo m so that no subset has zero sum.

The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components (Ford ...

A method used by Gauss to solve the quadratic Diophantine equation of the form mx^2+ny^2=A (Dickson 2005, pp. 391 and 407).

The minimum excluded value. The mex of a set S of nonnegative integers is the least nonnegative integer not in the set.

A sequence defined from a finite sequence a_0, a_1, ..., a_n by defining a_(n+1)=mex_(i)(a_i+a_(n-i)), where mex is the mex (minimum excluded value).

Given a collection of sets, a member set that is not a proper subset of another member set is called a minimal set. Minimal sets are important in graph theory, since many ...

A morphism f:Y->X in a category is a monomorphism if, for any two morphisms u,v:Z->Y, fu=fv implies that u=v. In the categories of sets, groups, modules, etc., a monomorphism ...