RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskr. Mat., 1994, Volume 6, Issue 1, Pages 100–115 (Mi dm612)  

This article is cited in 8 scientific papers (total in 8 papers)

Equations that contain an unknown permutation

A. V. Kolchin


Full text: PDF file (985 kB)

English version:
Discrete Mathematics and Applications, 1994, 4:1, 59–71

Bibliographic databases:
UDC: 519.2
Received: 23.11.1993

Citation: A. V. Kolchin, “Equations that contain an unknown permutation”, Diskr. Mat., 6:1 (1994), 100–115; Discrete Math. Appl., 4:1 (1994), 59–71

Citation in format AMSBIB
\Bibitem{Kol94}
\by A.~V.~Kolchin
\paper Equations that contain an unknown permutation
\jour Diskr. Mat.
\yr 1994
\vol 6
\issue 1
\pages 100--115
\mathnet{http://mi.mathnet.ru/dm612}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1273236}
\zmath{https://zbmath.org/?q=an:0810.05003}
\transl
\jour Discrete Math. Appl.
\yr 1994
\vol 4
\issue 1
\pages 59--71


Linking options:
  • http://mi.mathnet.ru/eng/dm612
  • http://mi.mathnet.ru/eng/dm/v6/i1/p100

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. L. Yakymiv, “On the distribution of the $m$th maximal cycle lengths of random $A$-permutations”, Discrete Math. Appl., 15:5 (2005), 527–546  mathnet  crossref  crossref  mathscinet  zmath  elib
    2. A. L. Yakymiv, “Limit theorem for the general number of cycles in a random $A$-permutation”, Theory Probab. Appl., 52:1 (2008), 133–146  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib
    3. A. L. Yakymiv, “On the Number of $A$-Mappings”, Math. Notes, 86:1 (2009), 132–139  mathnet  crossref  crossref  mathscinet  zmath  isi
    4. A. L. Yakymiv, “A limit theorem for the logarithm of the order of a random $A$-permutation”, Discrete Math. Appl., 20:3 (2010), 247–275  mathnet  crossref  crossref  mathscinet  zmath  elib  elib
    5. A. L. Yakymiv, “On the number of cyclic points of random $A$-mapping”, Discrete Math. Appl., 23:5-6 (2013), 503–515  mathnet  crossref  crossref  mathscinet  elib  elib
    6. A. L. Yakymiv, “On a number of components in a random $A$-mapping”, Theory Probab. Appl., 59:1 (2015), 114–127  mathnet  crossref  crossref  mathscinet  isi  elib  elib
    7. A. L. Yakymiv, “On the Number of Components of Fixed Size in a Random $A$-Mapping”, Math. Notes, 97:3 (2015), 468–475  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
    8. A. L. Yakymiv, “Limit theorems for the logarithm of the order of a random $A$-mapping”, Discrete Math. Appl., 27:5 (2017), 325–338  mathnet  crossref  crossref  mathscinet  isi  elib
  • Дискретная математика
    Number of views:
    This page:249
    Full text:92
    First page:3

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020