Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Discrete Mathematics and Applications

Editor-in-Chief: Zubkov, Andrei

6 Issues per year

CiteScore 2016: 0.16

SCImago Journal Rank (SJR) 2016: 0.231
Source Normalized Impact per Paper (SNIP) 2016: 0.552

See all formats and pricing
More options …
Volume 28, Issue 2


On the reduction property of the number of H-equivalent tuples of states in a discrete Markov chain

Vladimir G. Mikhailov
Published Online: 2018-04-09 | DOI: https://doi.org/10.1515/dma-2018-0008


The phenomenon of reduction of the set of permutations H arising in theorems on the weak convergence of the number of pairs of H-equivalent tuples in a segment of an indecomposable finite Markov chain to discrete distributions of the Poisson type is investigated.

Keywords: finite Markov chain; permutation group; tuples of states; H-equivalent tuples

Originally published in Diskretnaya Matematika (2018) 30, No1, 66–76 (in Russian).


  • [1]

    Sachkov V. N., Combinatorial Methods in Discrete Mathematics, Cambridge University Press, 1996, 317 pp.Google Scholar

  • [2]

    Buravlev S. M., “Matchings up to permutations in sequences of independent trials”, Discrete Math. Appl., 9:1 (1999), 53–78 (In Russian).Google Scholar

  • [3]

    Buravlev S. M., “Matchings up to the permutations which form a Latin rectangle”, Discrete Math. Appl., 10:1 (2000), 23–48 (In Russian).Google Scholar

  • [4]

    Mikhailov V. G., Shoitov A. M., “Structural equivalence of 𝑠-tuples in random discrete sequences”, Discrete Math. Appl., 13:6 (2003), 541–568 (In Russian).CrossrefGoogle Scholar

  • [5]

    Mikhailov V. G., Shoitov A. M., Volgin A. V., “On the structural equivaence of 𝑠-tuples in Markov chains”, Extended Abstracts, The IX Int. Petrozavodsk Conf. «Probabilistic Methods in Discrete Mathematics», 2016, Petrozavodsk, Russia,, 57–62 (In Russian).Google Scholar

  • [6]

    Shoitov A. M., “On a feature of asymptotic behavior of the number of H-equivalent n-tuples collections in a nonequiprobable multinomial scheme”, Trudy po diskrenoi matematike, 7, FIZMATLIT, M., 2003, 227–238 (In Russian).Google Scholar

  • [7]

    Gantmacher F. R., The Theory of Matrices. vol. 1 and vol. 2, Chelsea Publ. Company, New York, 1959, vol. 1: x+374 pp. vol. 2: x+277 pp.Google Scholar

  • [8]

    Karlin S., Ost F., “Some monotonicity properties of Shur powers of matrices and related inequalities”, Linear Algebra & Appl., 68 (1985), 47–65.CrossrefGoogle Scholar

  • [9]

    Mikhailov V. G., Shoitov A. M., “On repetitions of long tuples in a Markov chain”, Discrete Math. Appl., 25:5 (2015), 295–303.Web of ScienceGoogle Scholar

  • [10]

    Mikhailov V. G., Shoitov A. M., “Multiple repetitions of long tuples in a finite Markov chain”, Matem. voprosy. kriptogr., 6:3 (2015), 117–133 (In Russian).Google Scholar

  • [11]

    Mikhailov V. G., “Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain”, Discrete Math. Appl., 26:2 (2016), 105–113.Web of ScienceGoogle Scholar

  • [12]

    Zubkov A. M., Kruglov V. I., “On coincidences of tuples in a binary tree with random labels of vertices”, Discrete Math. Appl., 26:3 (2016), 145–153.Web of ScienceGoogle Scholar

  • [13]

    Mikhailov V. G., “On the probability of existence of substrings with the same structure in a random sequence”, Discrete Math. Appl., 27:6 (2017), 377–386.Web of ScienceGoogle Scholar

About the article

Received: 2017-09-04

Revised: 2017-10-16

Published Online: 2018-04-09

Published in Print: 2018-04-25

Funding Source: Russian Science Foundation

Award identifier / Grant number: 14-50-00005

This work was supported by the Russian Science Foundation under grant no. 14-50-00005.

Citation Information: Discrete Mathematics and Applications, Volume 28, Issue 2, Pages 75–82, ISSN (Online) 1569-3929, ISSN (Print) 0924-9265, DOI: https://doi.org/10.1515/dma-2018-0008.

Export Citation

© 2018 Walter de Gruyter GmbH, Berlin/Boston.Get Permission

Comments (0)

Please log in or register to comment.
Log in