Search Results for ""

The Balaban index J is a graph index defined for a graph on n nodes, m edges, and c connected components by J=m/(gamma+1)sum_((i,j) in E(G))(D_iD_j)^(-1/2), where gamma=m-n+c ...

Given an n-ball B^n of radius R, find the distribution of the lengths s of the lines determined by two points chosen at random within the ball. The probability distribution ...

Ball point picking is the selection of points randomly placed inside a ball. n random points can be picked in a unit ball in the Wolfram Language using the function ...

Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...

First stated in 1924, the Banach-Tarski paradox states that it is possible to decompose a ball into six pieces which can be reassembled by rigid motions to form two balls of ...

A band over a fixed topological space X is represented by a cover X= union U_alpha, U_alpha subset= X, and for each alpha, a sheaf of groups K_alpha on U_alpha along with ...

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

A Barker code is a string of digits a_i=+/-1 of length l>=2 such that |sum_(i=1)^(l-k)a_ia_(i+k)|<=1 for all 1<=k<l. Barker codes are used for pulse compression of radar ...

The Barnes-Wall lattice is a d-dimensional lattice that exists when d is a power of 2. It is implemented in the Wolfram Language as LatticeData[{"BarnesWall", n}]. Special ...

Barnette's conjecture asserts that every 3-connected bipartite cubic planar graph is Hamiltonian. The only graph on nine or fewer vertices satisfying Barnette's conditions is ...