Search Results for ""

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 ...

A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

A power series in a variable z is an infinite sum of the form sum_(i=0)^inftya_iz^i, where a_i are integers, real numbers, complex numbers, or any other quantities of a given ...

Find the minimum size square capable of bounding n equal squares arranged in any configuration. The first few cases are illustrated above (Friedman). The only packings which ...

The wallpaper groups are the 17 possible plane symmetry groups. They are commonly represented using Hermann-Mauguin-like symbols or in orbifold notation (Zwillinger 1995, p. ...

The 5.1.2 fifth-order Diophantine equation A^5=B^5+C^5 (1) is a special case of Fermat's last theorem with n=5, and so has no solution. improving on the results on Lander et ...

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...

The Klein bottle is a closed nonorientable surface of Euler characteristic 0 (Dodson and Parker 1997, p. 125) that has no inside or outside, originally described by Felix ...