Search Results for ""

A minimal free resolution of a finitely generated graded module M over a commutative Noetherian Z-graded ring R in which all maps are homogeneous module homomorphisms, i.e., ...

A cycle of a finite group G is a minimal set of elements {A^0,A^1,...,A^n} such that A^0=A^n=I, where I is the identity element. A diagram of a group showing every cycle in ...

A holyhedron is polyhedron whose faces and holes are all finite-sided polygons and that contains at least one hole whose boundary shares no point with a face boundary. D. ...

By analogy with the lemniscate functions, hyperbolic lemniscate functions can also be defined arcsinhlemnx = int_0^x(1+t^4)^(1/2)dt (1) = x_2F_1(-1/2,1/4;5/4;-x^4) (2) ...

In determinant expansion by minors, the minimal number of transpositions of adjacent columns in a square matrix needed to turn the matrix representing a permutation of ...

The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...

If mu is a real measure (i.e., a measure that takes on real values), then one can decompose it according to where it is positive and negative. The positive variation is ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

Jung's theorem states that the generalized diameter D of a compact set X in R^n satisfies D>=Rsqrt((2(n+1))/n), where R is the circumradius of X (Danzer et al. 1963). This ...

The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...