When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Galois connection - Wikipedia

    en.wikipedia.org/wiki/Galois_connection

    The compositions GF : A → A and FG : B → B are the associated closure operators; they are monotone idempotent maps with the property a ≤ GF(a) for all a in A and b ≤ FG(b) for all b in B. The implications of the two definitions of Galois connections are very similar, since an antitone Galois connection between A and B is just a monotone ...

  3. Absolutely and completely monotonic functions and sequences

    en.wikipedia.org/wiki/Absolutely_and_completely...

    The following is a selection from the large body of literature on absolutely/completely monotonic functions/sequences. René L. Schilling, Renming Song and Zoran Vondraček (2010). Bernstein Functions Theory and Applications. De Gruyter. pp. 1– 10. ISBN 978-3-11-021530-4. (Chapter 1 Laplace transforms and completely monotone functions)

  4. Milnor–Thurston kneading theory - Wikipedia

    en.wikipedia.org/wiki/Milnor–Thurston_kneading...

    Kneading theory provides an effective calculus for describing the qualitative behavior of the iterates of a piecewise monotone mapping f of a closed interval I of the real line into itself. Some quantitative invariants of this discrete dynamical system , such as the lap numbers of the iterates and the Artin–Mazur zeta function of f are ...

  5. Monotonic function - Wikipedia

    en.wikipedia.org/wiki/Monotonic_function

    The term monotonic transformation (or monotone transformation) may also cause confusion because it refers to a transformation by a strictly increasing function. This is the case in economics with respect to the ordinal properties of a utility function being preserved across a monotonic transform (see also monotone preferences ). [ 5 ]

  6. List of chaotic maps - Wikipedia

    en.wikipedia.org/wiki/List_of_chaotic_maps

    In mathematics, a chaotic map is a map (an evolution function) that exhibits some sort of chaotic behavior. Maps may be parameterized by a discrete-time or a continuous-time parameter. Discrete maps usually take the form of iterated functions. Chaotic maps often occur in the study of dynamical systems.

  7. Square planar molecular geometry - Wikipedia

    en.wikipedia.org/wiki/Square_planar_molecular...

    Structure of cisplatin, an example of a molecule with the square planar coordination geometry. In chemistry, the square planar molecular geometry describes the stereochemistry (spatial arrangement of atoms) that is adopted by certain chemical compounds. As the name suggests, molecules of this geometry have their atoms positioned at the corners.

  8. Contraction mapping - Wikipedia

    en.wikipedia.org/wiki/Contraction_mapping

    The class of firmly nonexpansive operators is equal to the set of resolvents of maximally monotone operators. [6] Surprisingly, while iterating non-expansive maps has no guarantee to find a fixed point (e.g. multiplication by -1), firm non-expansiveness is sufficient to guarantee global convergence to a fixed point, provided a fixed point exists.

  9. Chemical similarity - Wikipedia

    en.wikipedia.org/wiki/Chemical_similarity

    Chemical similarity (or molecular similarity) refers to the similarity of chemical elements, molecules or chemical compounds with respect to either structural or functional qualities, i.e. the effect that the chemical compound has on reaction partners in inorganic or biological settings.