Search Results for ""

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...

The Pauli matrices, also called the Pauli spin matrices, are complex matrices that arise in Pauli's treatment of spin in quantum mechanics. They are defined by sigma_1 = ...

The (26,8)-Paulus graph having the largest possible graph automorphism group order of all 26-node Paulus graphs (namely 120) is sometimes known as the ...

The Paulus graphs are the 15 strongly regular graphs on 25 nodes with parameters (nu,k,lambda,mu)=(25,12,5,6) and the 10 strongly regular graphs on 26 nodes with parameters ...

The paw graph is the 3-pan graph, which is also isomorphic to the (3,1)-tadpole graph. It is implemented in the Wolfram Language as GraphData["PawGraph"].

Given an integer e>=2, the Payam number E_+/-(e) is the smallest positive odd integer k such that for every positive integer n, the number k·2^n+/-1 is not divisible by any ...

An m×n matrix which gives the possible outcome of a two-person zero-sum game when player A has m possible moves and player B n moves. The analysis of the matrix in order to ...

The eighth proposition in the third book of the Elements is one of Euclid's most complex propositions. It shows that a segment through an outside point D and a circle is ...

The Peano-Gosper curve is a plane-filling function originally called a "flowsnake" by R. W. Gosper and M. Gardner. Mandelbrot (1977) subsequently coined the name Peano-Gosper ...

The theory of natural numbers defined by the five Peano's axioms. Paris and Harrington (1977) gave the first "natural" example of a statement which is true for the integers ...