Explore: Permutations (mathématiques)

Discover books, insights, and more — all in one place.

Learn more about Permutations (mathématiques) with top reads curated from trusted sources — all in one place.

Topic Search

Search for any topic

AI-Generated Overview About “permutations-%28math%C3%A9matiques%29”:


Books Results

Source: The Open Library

The Open Library Search Results

Search results from The Open Library

1Combinatorics of permutations

By

Book's cover

“Combinatorics of permutations” Metadata:

  • Title: Combinatorics of permutations
  • Author:
  • Language: English
  • Number of Pages: Median: 368
  • Publisher: ➤  Chapman & Hall/CRC - CRC Press LLC
  • Publish Date:
  • Publish Location: Boca Raton

“Combinatorics of permutations” Subjects and Themes:

Edition Identifiers:

First Setence:

"The "most orderly" of all n-permutations is obviously the increasing permutation 123 ... n."

Access and General Info:

  • First Year Published: 2004
  • Is Full Text Available: No
  • Is The Book Public: No
  • Access Status: No_ebook

Online Access

Downloads Are Not Available:

The book is not public therefore the download links will not allow the download of the entire book, however, borrowing the book online is available.

Online Borrowing:

    Online Marketplaces

    Find Combinatorics of permutations at online marketplaces:


    2Chaînes de Markov sur les permutations

    By

    Book's cover

    “Chaînes de Markov sur les permutations” Metadata:

    • Title: ➤  Chaînes de Markov sur les permutations
    • Author:
    • Language: English
    • Number of Pages: Median: 226
    • Publisher: Springer-Verlag
    • Publish Date:
    • Publish Location: New York - Berlin

    “Chaînes de Markov sur les permutations” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1983
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: Unclassified

    Online Access

    Downloads Are Not Available:

    The book is not public therefore the download links will not allow the download of the entire book, however, borrowing the book online is available.

    Online Borrowing:

      Online Marketplaces

      Find Chaînes de Markov sur les permutations at online marketplaces:


      3Combinatorics of permutations

      By

      Book's cover

      “Combinatorics of permutations” Metadata:

      • Title: Combinatorics of permutations
      • Author:
      • Language: English
      • Number of Pages: Median: 453
      • Publisher: Chapman and Hall/CRC
      • Publish Date:
      • Publish Location: Boca Raton, FL

      “Combinatorics of permutations” Subjects and Themes:

      Edition Identifiers:

      Access and General Info:

      • First Year Published: 2012
      • Is Full Text Available: No
      • Is The Book Public: No
      • Access Status: No_ebook

      Online Marketplaces

      Find Combinatorics of permutations at online marketplaces:



      Wiki

      Source: Wikipedia

      Wikipedia Results

      Search Results from Wikipedia

      Factorial number system

      as factoradic), is a mixed radix numeral system adapted to numbering permutations. It is also called factorial base, although factorials do not function

      Mathieu group M24

      Mathématiques Pures et Appliquées, 6: 241–323 Mathieu, Émile (1873), "Sur la fonction cinq fois transitive de 24 quantités", Journal de Mathématiques

      Alternating permutation

      alternating to refer only to the "up-down" permutations for which c1 < c2 > c3 < ..., calling the "down-up" permutations that satisfy c1 > c2 < c3 > ... by the

      Random permutation statistics

      article on random permutations contains an introduction to random permutations. Permutations are sets of labelled cycles. Using the labelled case of the Flajolet–Sedgewick

      Olinde Rodrigues

      Journal de Mathématiques Pures et Appliquées, vol. 3, pp. 550–551, 1838 "Note sur les inversions, ou dérangements produits dans les permutations", Journal

      Vexillary permutation

      are enumerated by Motzkin numbers. Riffle shuffle permutation, a subclass of the vexillary permutations Guibert, O.; Pergola, E.; Pinzani, R. (2001), "Vexillary

      Permutohedron

      paths (sets of transpositions) that connect two vertices (permutations). Two permutations connected by an edge differ in only two places (one transposition)

      Mathieu group M11

      Mathématiques Pures et Appliquées, 6: 241–323 Mathieu, Émile (1873), "Sur la fonction cinq fois transitive de 24 quantités", Journal de Mathématiques

      Lehmer code

      way to encode each possible permutation of a sequence of n numbers. It is an instance of a scheme for numbering permutations and is an example of an inversion

      Stirling numbers of the first kind

      kind arise in the study of permutations. In particular, the unsigned Stirling numbers of the first kind count permutations according to their number of