representable's Usage Examples:

lower than the minimum representable value.

The most common result of an overflow is that the least significant representable digits of the result are.

be representable over some but not all fields.

For instance, the nine-element rank-three matroid defined by the Perles configuration is representable over.

represented are not uniformly spaced; the difference between two consecutive representable numbers varies with the chosen scale.

In algorithmic game theory, a succinct game or a succinctly representable game is a game which may be represented in a size much smaller than its normal.

In mathematics, particularly category theory, a representable functor is a certain functor from an arbitrary category into the category of sets.

It also clarifies how the embedded category, of representable functors and their natural transformations, relates to the other objects.

If a character is not representable in MARC-8 of a MARC-21 record, then UTF-8 must be used instead.

first introduced) this is a question of whether a certain functor is representable: the contravariant functor from the homotopy category to the category.

{X}}\to {\mathcal {X}}\times _{S}{\mathcal {X}}} of fibered categories is representable as algebraic spaces There exists an f p p f {\displaystyle fppf} scheme.

problems is to set them up as a representable functor question, then apply a criterion that singles out the representable functors for schemes.

is invariant under a Lorentz transformation Pseudoscalar, a quantity representable by a mathematical scalar that reacts sensitively to transformations.

pointed connected CW complexes, to the category of sets Set, to be a representable functor.

The third insight is that over a certain category, these are representable functors.

{\displaystyle M} is representable over F {\displaystyle F} ; in particular, M {\displaystyle M} is real-representable if it is representable over the real numbers.

However, not every set of orderings may be representable in this way; for instance, if an ordering is represented by a PQ tree.

this phenomenon is given by the regular matroids, matroids that are representable over all fields.

algebra is called subdirectly irreducible if it is not subdirectly representable by "simpler" algebras.

that gives conditions for a functor of artinian local rings to be pro-representable, refining an earlier theorem of Grothendieck.

Synonyms:

expressible;

Antonyms:

untellable; inexpressible;