Search Results for ""

The index I associated to a symmetric, non-degenerate, and bilinear g over a finite-dimensional vector space V is a nonnegative integer defined by I=max_(W in S)(dimW) where ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

A K-rational point is a point (X,Y) on an algebraic curve f(X,Y)=0, where X and Y are in a field K. For example, rational point in the field Q of ordinary rational numbers is ...

The binary quadratic form F=<a,b,c> is said to be reduced if the following conditions hold. Let D=b^2-4ac be the discriminant, then 1. If D is negative, F is reduced if ...

A system in which words (expressions) of a formal language can be transformed according to a finite set of rewrite rules is called a reduction system. While reduction systems ...

Given a commutative unit ring R and a filtration F:... subset= I_2 subset= I_1 subset= I_0=R (1) of ideals of R, the Rees ring of R with respect to F is R_+(F)=I_0 direct sum ...

Let X be a normed space and X^(**)=(X^*)^* denote the second dual vector space of X. The canonical map x|->x^^ defined by x^^(f)=f(x),f in X^* gives an isometric linear ...

Regular expressions define formal languages as sets of strings over a finite alphabet. Let sigma denote a selected alphabet. Then emptyset is a regular expression that ...

Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...