Search Results for ""

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

A relationship between knot polynomials for links in different orientations (denoted below as L_+, L_0, and L_-). J. H. Conway was the first to realize that the Alexander ...

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).

Every dense linear order complete set without endpoints having at most omega disjoint intervals is order isomorphic to the continuum of real numbers, where omega is the set ...

A theorem which specifies the structure of the generic unitary representation of the Weyl relations and thus establishes the equivalence of Heisenberg's matrix mechanics and ...

The structure constant is defined as iepsilon_(ijk), where epsilon_(ijk) is the permutation symbol. The structure constant forms the starting point for the development of Lie ...

A Poulet number whose divisors d all satisfy d|2^d-2. The first few are 341, 1387, 2047, 2701, 3277, 4033, 4369, 4681, 5461, 7957, 8321, ... (OEIS A050217).

A symmetry group is a group of symmetry-preserving operations, i.e., rotations, reflections, and inversions (Arfken 1985, p. 245).

If n>1, (a,n)=1 (i.e., a and n are relatively prime), and m is the least integer >sqrt(n), then there exist an x and y such that ay=+/-x (mod n) where 0<x<m and 0<y<m (Nagell ...

The torus grid graph T_(m,n) is the graph formed from the graph Cartesian product C_m square C_n of the cycle graphs C_m and C_n. C_m square C_n is isomorphic to C_n square ...