Search Results for ""

An E_8 polytope is a polytope having the symmetry of the exceptional simple Lie groups E_8 of dimension 248. There are 255 uniform polytopes with E_8 symmetry in 8 ...

The Euler-Gergonne-Soddy circle, a term coined here for the first time, is the circumcircle of the Euler-Gergonne-Soddy triangle. Since the Euler-Gergonne-Soddy triangle is a ...

Euler's continued fraction is the name given by Borwein et al. (2004, p. 30) to Euler's formula for the inverse tangent, ...

The extangents circle is the circumcircle of the extangents triangle. Its center function is a complicated 9th-order polynomial and its circle function is a complicated ...

Given a field F and an extension field K superset= F, if alpha in K is an algebraic element over F, the minimal polynomial of alpha over F is the unique monic irreducible ...

Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...

The finite group C_2×C_6 is the finite group of order 12 that is the group direct product of the cyclic group C2 and cyclic group C6. It is one of the two Abelian groups of ...

The Fischer groups are the three sporadic groups Fi_(22), Fi_(23), and Fi_(24)^'. These groups were discovered during the investigation of 3-transposition groups. The Fischer ...

A graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...

The maximum possible weight of a fractional clique of a graph G is called the fractional clique number of G, denoted omega^*(G) (Godsil and Royle 2001, pp. 136-137) or ...