Search Results for ""

A modulo multiplication group is a finite group M_m of residue classes prime to m under multiplication mod m. M_m is Abelian of group order phi(m), where phi(m) is the ...

The word modulus has several different meanings in mathematics with respect to complex numbers, congruences, elliptic integrals, quadratic invariants, sets, etc. The modulus ...

The rule (F,F=>G)/G, where => means "implies," which is the sole rule of inference in propositional calculus. This rule states that if each of F and F=>G is either an axiom ...

Modus tollens is a valid argument form in propositional calculus in which p and q are propositions. If p implies q, and q is false, then p is false. Also known as an indirect ...

The unique 8_3 configuration. It is transitive and self-dual, but cannot be realized in the real projective plane. Its Levi graph is the Möbius-Kantor graph.

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...

The equation x_1^2+x_2^2+...+x_n^2-2x_0x_infty=0 represents an n-dimensional hypersphere S^n as a quadratic hypersurface in an (n+1)-dimensional real projective space ...

The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...

A Möbius ladder, sometimes called a Möbius wheel (Jakobson and Rivin 1999), of order n is a simple graph obtained by introducing a twist in a prism graph of order n that is ...