skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Award ID contains: 1852171

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; (, Designs, Codes and Cryptography)
    Full Text Available 
  2. ; ; ; ; ; ; ; ; (, Pure Mathematics and Applications)
    Abstract Let π n be a uniformly chosen random permutation on [ n ]. Using an analysis of the probability that two overlapping consecutive k -permutations are order isomorphic, we show that the expected number of distinct consecutive patterns of all lengths k ∈ {1, 2,…, n } in π n is n 2 2 ( 1 - o ( 1 ) ) {{{n^2}} \over 2}\left( {1 - o\left( 1 \right)} \right) as n → ∞. This exhibits the fact that random permutations pack consecutive patterns near-perfectly. 
    more » « less
    Full Text Available 
  3. ; ; ; (, Advances in Applied Mathematics)
    null (Ed.)
    Full Text Available