The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent

V. A. VATUTIN

doi:10.1515/dma.1996.6.1.41

Home The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent

Article

Licensed

Unlicensed Requires Authentication

The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent

V. A. VATUTIN

Published/Copyright: October 9, 2009

Published by

Become an author with De Gruyter Brill

Author Information Explore this Subject

From the journal Volume 6 Issue 1

MLA
APA
Harvard
Chicago
Vancouver

MLA
APA
Harvard
Chicago
Vancouver

VATUTIN, V. A.. "The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent" Discrete Mathematics and Applications, vol. 6, no. 1, 1996, pp. 41-52. https://doi.org/10.1515/dma.1996.6.1.41

VATUTIN, V. (1996). The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent. Discrete Mathematics and Applications, 6(1), 41-52. https://doi.org/10.1515/dma.1996.6.1.41

VATUTIN, V. (1996) The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent. Discrete Mathematics and Applications, Vol. 6 (Issue 1), pp. 41-52. https://doi.org/10.1515/dma.1996.6.1.41

VATUTIN, V. A.. "The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent" Discrete Mathematics and Applications 6, no. 1 (1996): 41-52. https://doi.org/10.1515/dma.1996.6.1.41

VATUTIN V. The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent. Discrete Mathematics and Applications. 1996;6(1): 41-52. https://doi.org/10.1515/dma.1996.6.1.41

Copy

Copied to clipboard

BibTeX EndNote RIS

Published Online: 2009-10-09

Published in Print: 1996

Walter de Gruyter

You are currently not able to access this content.

Articles in the same Issue

Statistical estimation of the structure of a finite population
The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent
On some algebras connected with fast algorithms
On computing logarithms on elliptic curves
On the complexity of finding the number of solutions of systems of Boolean equations
A criterion of completeness for non-homogeneous functions with delays

Search journal Search the content of this journal

https://doi.org/10.1515/dma.1996.6.1.41

Articles in the same Issue

Statistical estimation of the structure of a finite population
The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent
On some algebras connected with fast algorithms
On computing logarithms on elliptic curves
On the complexity of finding the number of solutions of systems of Boolean equations
A criterion of completeness for non-homogeneous functions with delays