Search Results for ""

Bridge is a card game played with a normal deck of 52 cards. The number of possible distinct 13-card hands is N=(52; 13)=635013559600, (1) where (n; k) is a binomial ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...

A hypothetic building design problem in optimization with constraints proposed by Bhatti (2000, pp. 3-5). To save energy costs for heating and cooling, an architect wishes to ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

Given a chord PQ of a circle, draw any other two chords AB and CD passing through its midpoint. Call the points where AD and BC meet PQ X and Y. Then M is also the midpoint ...

Cantor dust is a fractal that can be constructed using string rewriting beginning with a cell [0] and iterating the rules {0->[0 0 0; 0 0 0; 0 0 0],1->[1 0 1; 0 0 0; 1 0 1]}. ...

The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...

A number of spellings of "Chebyshev" (which is the spelling used exclusively in this work) are commonly found in the literature. These include Tchebicheff, Čebyšev, ...

If Y_i have normal independent distributions with mean 0 and variance 1, then chi^2=sum_(i=1)^rY_i^2 (1) is distributed as chi^2 with r degrees of freedom. This makes a chi^2 ...