Search Results for ""

The great rhombicosidodecahedral graph is the Archimedean graph on 120 vertices and 180 edges that is the skeleton of the great rhombicosidodecahedron as well as the uniform ...

The ancient Greeks used the 24 letters of their alphabet plus three special signs called episemons--vau or digamma or stigma (6), koppa or qoppa (90), and san or sampi ...

The gyroid, illustrated above, is an infinitely connected periodic minimal surface containing no straight lines (Osserman 1986) that was discovered by Schoen (1970). ...

The Hatzel graph is a planar hypohamiltonian graph on 57 vertices that was the smallest known example of such a graph until the discovery of the Zamfirescu graph on 48 ...

The Heaviside step function is a mathematical function denoted H(x), or sometimes theta(x) or u(x) (Abramowitz and Stegun 1972, p. 1020), and also known as the "unit step ...

The helm graph H_n is the graph obtained from an n-wheel graph by adjoining a pendant edge at each node of the cycle. Helm graphs are graceful (Gallian 2018), with the odd ...

Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...

The recursive sequence generated by the recurrence equation Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2)), with Q(1)=Q(2)=1. The first few values are 1, 1, 2, 3, 3, 4, 5, 5, 6, 6, ... (OEIS ...

Homology is a concept that is used in many branches of algebra and topology. Historically, the term "homology" was first used in a topological sense by Poincaré. To him, it ...

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...