Search Results for ""

An operator A:f^((n))(I)|->f(I) assigns to every function f in f^((n))(I) a function A(f) in f(I). It is therefore a mapping between two function spaces. If the range is on ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

The line segment connecting opposite polyhedron vertices (i.e., two polyhedron vertices which do not share a common face) in a parallelepiped or other similar solid. Also ...

A roulette is a curve traced by a fixed point on a closed convex curve as that curve rolls without slipping along a second curve. The roulettes described by the foci of ...

The Pasch graph is the Levi graph of the Pasch configuration. The Pasch graph is edge-transitive but not vertex-transitive, but fails to be semisymmetric since it is not ...

One baud is defined as the state of a signal in a communication channel changing once per second.

The smallest unit of binary information, equal to a single 0 or 1. Two bits are called a crumb, four bits are called a nibble, and eight bits are called 1 byte.

If S is an infinite set, then the collection F_S={A subset= S:S-A is finite} is a filter called the cofinite (or Fréchet) filter on S.

A space of functions comprising a complete biorthogonal system.

A sentence is called a contingency if its truth table contains at least one 'T' and at least one 'F.'