Search Results for ""

A module M over a unit ring R is called faithfully flat if the tensor product functor - tensor _RM is exact and faithful. A faithfully flat module is always flat and ...

The modular group Gamma is the set of all transformations w of the form w(t)=(at+b)/(ct+d), where a, b, c, and d are integers and ad-bc=1. A Gamma-modular function is then ...

A gigantic prime is a prime with 10000 or more decimal digits. The first few gigantic primes are given by 10^(9999)+n for n=33603, 55377, 70999, 78571, 97779, 131673, 139579, ...

The second-order ordinary differential equation (d^2y)/(dx^2)+[theta_0+2sum_(n=1)^inftytheta_ncos(2nx)]y=0, (1) where theta_n are fixed constants. A general solution can be ...

The solid cut from a horizontal cylinder of length L and radius R by a single plane oriented parallel to the cylinder's axis of symmetry (i.e., a portion of a horizontal ...

For an n×n matrix, let S denote any permutation e_1, e_2, ..., e_n of the set of numbers 1, 2, ..., n, and let chi^((lambda))(S) be the character of the symmetric group ...

The largest area of intersection of a solid body by a plane parallel to a given plane, also called the "HA measurement."

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

The level set of a differentiable function f:R^n->R corresponding to a real value c is the set of points {(x_1,...,x_n) in R^n:f(x_1,...,x_n)=c}. For example, the level set ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...