Search Results for ""

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

A fixed point for which the stability matrix has equal negative eigenvalues.

An unfolding is the cutting along edges and flattening out of a polyhedron to form a net. Determining how to unfold a polyhedron into a net is tricky. For example, cuts ...

A fixed point for which the stability matrix has equal positive eigenvalues.

The cube is the Platonic solid composed of six square faces that meet each other at right angles and has eight vertices and 12 edges. It is also the uniform polyhedron with ...

The regular dodecahedron, often simply called "the" dodecahedron, is the Platonic solid composed of 20 polyhedron vertices, 30 polyhedron edges, and 12 pentagonal faces, ...

A continuous statistical distribution which arises in the testing of whether two observed samples have the same variance. Let chi_m^2 and chi_n^2 be independent variates ...

In the course of searching for continued fraction identities, Raayoni (2021) and Elimelech et al. (2023) noticed that while the numerator and denominator of continued ...

A random polygon is a polygon generated in some random way. Kendall conjectured that the shape of a random polygon is close to a disk as the area of the polygon becomes large ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...