Search Results for ""

Let T be an ergodic endomorphism of the probability space X and let f:X->R be a real-valued measurable function. Then for almost every x in X, we have 1/nsum_(j=1)^nf ...

A black bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

If f has no spectrum in [-lambda,lambda], then ||f||_infty<=pi/(2lambda)||f^'||_infty (1) (Bohr 1935). A related inequality states that if A_k is the class of functions such ...

The term Bol loop refers to either of two classes of algebraic loops satisfying the so-called Bol identities. In particular, a left Bol loop is an algebraic loop L which, for ...

Every Boolean algebra is isomorphic to the Boolean algebra of sets. The theorem is equivalent to the maximal ideal theorem, which can be proved without using the axiom of ...

There are two types of bordism groups: bordism groups, also called cobordism groups or cobordism rings, and there are singular bordism groups. The bordism groups give a ...

The Wolfram Physics Project posits the existence of abstract relations between atoms of space whose pattern defines the structure of physical space. In this approach, two ...

Tracing through the connections of a branchial graph gives rise to the notion of a kind of space in which states on different branches of history are laid out. In particular, ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...