Search Results for ""

A group generated by the elements P_i for i=1, ..., n subject to (P_iP_j)^(M_(ij))=1, where M_(ij) are the elements of a Coxeter matrix. Coxeter used the notation [3^(p,q,r)] ...

A cyclic graph is a graph containing at least one graph cycle. A graph that is not cyclic is said to be acyclic. A cyclic graph possessing exactly one (undirected, simple) ...

A set is denumerable iff it is equipollent to the finite ordinal numbers. (Moore 1982, p. 6; Rubin 1967, p. 107; Suppes 1972, pp. 151-152). However, Ciesielski (1997, p. 64) ...

The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...

Suppose that V is a group representation of G, and W is a group representation of H. Then the vector space tensor product V tensor W is a group representation of the group ...

Let T_n(x) be an arbitrary trigonometric polynomial T_n(x)=1/2a_0+{sum_(k=1)^n[a_kcos(kx)+b_ksin(kx)]} (1) with real coefficients, let f be a function that is integrable over ...

Fermat's sandwich theorem states that 26 is the only number sandwiched between a perfect square number (5^2=25) and a perfect cubic number (3^3=27). According to Singh ...

The Fibonacci factorial constant is the constant appearing in the asymptotic growth of the fibonorials (aka. Fibonacci factorials) n!_F. It is given by the infinite product ...

Let S be a nonempty set, then a filter on S is a nonempty collection F of subsets of S having the following properties: 1. emptyset not in F, 2. If A,B in F, then A ...

A group is called a free group if no relation exists between its group generators other than the relationship between an element and its inverse required as one of the ...