Search Results for ""

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

The geometry of the Lie group R semidirect product with R^2, where R acts on R^2 by (t,(x,y))->(e^tx,e^(-t)y).

The Stiefel manifold of orthonormal k-frames in R^n is the collection of vectors (v_1, ..., v_k) where v_i is in R^n for all i, and the k-tuple (v_1, ..., v_k) is ...

The group of all nonsingular n×n stochastic matrices over a field F. It is denoted S(n,F). If p is prime and F is the finite field of order q=p^m, S(n,q) is written instead ...

Tetrahedron picking is the process of picking tetrahedra at random within a given shape in 3 or higher dimensions. The most natural definition of a random tetrahedron is one ...

1000=10^3. The word "thousand" appears in common expressions in a number of languages, for example, "a thousand pardons" in English and "tusen takk" ("a thousand thanks") in ...

The application of characteristic p methods in commutative algebra, which is a synthesis of some areas of commutative algebra and algebraic geometry.

An extension field of a field F that is not algebraic over F, i.e., an extension field that has at least one element that is transcendental over F. For example, the field of ...

The triangle space T is the set of triples (a,b,c) of real numbers that are side lengths of a (Euclidean) triangle, i.e., T={(a,b,c):0<a<b+c,0<b<c+a,0<c<a+b} (Kimberling ...

The trimean is defined to be TM=1/4(H_1+2M+H_2), where H_i are the hinges and M is the statistical median. Press et al. (1992) call this Tukey's trimean. It is an L-estimate.