Search Results for ""

A two-person game where each of the players can take as long as he likes to prepare his move, but the other can take advantage of his hesitation. In this conflict situation, ...

The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...

Two figures are said to be similar when all corresponding angles are equal and all distances are increased (or decreased) in the same ratio, called the ratio of magnification ...

For two random variates X and Y, the correlation is defined bY cor(X,Y)=(cov(X,Y))/(sigma_Xsigma_Y), (1) where sigma_X denotes standard deviation and cov(X,Y) is the ...

A T_1-space is a topological space fulfilling the T1-separation axiom: For any two points x,y in X there exists two open sets U and V such that x in U and y not in U, and y ...

Hex is a two-player game invented by Piet Hein in 1942 while a student at Niels Bohr's Institute for Theoretical Physics, and subsequently and independently by John Nash in ...

Consider the average length of a line segment determined by two points picked at random in the interior of an arbitrary triangle Delta(a,b,c) with side lengths a, b, and c. ...

The de Grey-Haugstrup graphs are two 6-chromatic graphs on 47 and 48 vertices that are unit-distance in 3 dimensions (de Grey and Haugstrup 2020).

Inversion is the process of transforming points P to a corresponding set of points P^' known as their inverse points. Two points P and P^' are said to be inverses with ...

Let two players each have a finite number of pennies (say, n_1 for player one and n_2 for player two). Now, flip one of the pennies (from either player), with each player ...