Search Results for ""

A symmetric bilinear form on a vector space V is a bilinear function Q:V×V->R (1) which satisfies Q(v,w)=Q(w,v). For example, if A is a n×n symmetric matrix, then ...

The triakis icosahedral graph is Archimedean dual graph which is the skeleton of the triakis icosahedron. It is implemented in the Wolfram Language as ...

A set of positive integers is called weakly triple-free if, for any integer x, the set {x,2x,3x} !subset= S. For example, all subsets of {1,2,3,4,5} are weakly triple-free ...

The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...

The constant e with decimal expansion e=2.718281828459045235360287471352662497757... (OEIS A001113) can be computed to 10^9 digits of precision in 10 CPU-minutes on modern ...

An Abelian group is a group for which the elements commute (i.e., AB=BA for all elements A and B). Abelian groups therefore correspond to groups with symmetric multiplication ...

Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...

The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...

For every positive integer n, there exists a circle which contains exactly n lattice points in its interior. H. Steinhaus proved that for every positive integer n, there ...

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...