Search Results for ""

In functional analysis, the Banach-Alaoglu theorem (also sometimes called Alaoglu's theorem) is a result which states that the norm unit ball of the continuous dual X^* of a ...

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

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

A "beam detector" for a given curve C is defined as a curve (or set of curves) through which every line tangent to or intersecting C passes. The shortest 1-arc beam detector, ...

A simple graph is a line graph of some simple graph iff if does not contain any of the above nine graphs, known in this work as Beineke graphs, as a forbidden induced ...

There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...

The polynomials defined by B_(i,n)(t)=(n; i)t^i(1-t)^(n-i), (1) where (n; k) is a binomial coefficient. The Bernstein polynomials of degree n form a basis for the power ...

The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...

Bilinski (1960) noted that by collapsing any one of the five zones of the rhombic icosahedron, a second rhombic dodecahedron distinct from the dual polyhedron of the ...

A biplanar graph is defined as a graph that is the graph union of two planar edge-induced subgraphs. In other words, biplanar graphs are graphs with graph thickness 1 or 2 ...