Idempotent version of the Fréchet contingency array problem (Q1040914)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5639606
Language Label Description Also known as
default for all languages
No label defined
    English
    Idempotent version of the Fréchet contingency array problem
    scientific article; zbMATH DE number 5639606

      Statements

      Idempotent version of the Fréchet contingency array problem (English)
      0 references
      0 references
      0 references
      27 November 2009
      0 references
      The author considers an extension of the Hoeffding--Fréchet problem to generalized measures with values in an idempotent, ordered semiring. As in the classical case there exists a unique upper bound and several minimal elements. The upper bound is given in explicit form. Some algorithm's are given (in the finite discrete case) to determine lower bounds. The authors give several motivations for the extension of the Hoeffding--Fréchet problem to idempotent algebraic structures.
      0 references
      Fréchet-problem
      0 references
      idempotent algebra
      0 references

      Identifiers