Search Results for ""

In celestial mechanics, the fixed path a planet traces as it moves around the sun is called an orbit. When a group G acts on a set X (this process is called a group action), ...

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...

A Hasse diagram is a graphical rendering of a partially ordered set displayed via the cover relation of the partially ordered set with an implied upward orientation. A point ...

A collection of equations satisfies the Hasse principle if, whenever one of the equations has solutions in R and all the Q_p, then the equations have solutions in the ...

Given a square n×n nonsingular integer matrix A, there exists an n×n unimodular matrix U and an n×n matrix H (known as the Hermite normal form of A) such that AU=H. ...

A homogeneous ideal I in a graded ring R= direct sum A_i is an ideal generated by a set of homogeneous elements, i.e., each one is contained in only one of the A_i. For ...

"The" I graph is the path graph on two vertices: P_2. An I-graph I(n,j,k) for 1<=j,k<n and j,k!=n/2 is a generalization of a generalized Petersen graph and has vertex set ...

Let x be a real number, and let R be the set of positive real numbers mu for which 0<|x-p/q|<1/(q^mu) (1) has (at most) finitely many solutions p/q for p and q integers. Then ...

Find the minimum number f(n) of subsets in a separating family for a set of n elements, where a separating family is a set of subsets in which each pair of adjacent elements ...

For every k>=1, let C_k be the set of composite numbers n>k such that if 1<a<n, GCD(a,n)=1 (where GCD is the greatest common divisor), then a^(n-k)=1 (mod n). Special cases ...