Search results

Records found: 4  
Your query: Author Sysno/Doc.kind = "^umb_un_cat 0293277 xpca^"
  1. TitleOn discrete versions of two Accola´s theorems about automorphism groups of Riemann surfaces
    Author infoMaxim Limonov, Roman Nedela, Alexander Mednykh
    Author Limonov Maksim (33%)
    Co-authors Nedela Roman 1960- (34%) UMBFP05 - Katedra informatiky
    Mednykh Alexander 1953- (33%)
    Source document Analysis and Mathematical Physics. Vol. 7, no. 3 (2017), pp. 233-243. - Cham : Springer Nature Switzerland AG, 2017
    Keywords Riemanove plochy - Riemann surfaces   grafy - charts - graphs   automorphism groups   hyperelliptic graphs   hyperelliptic involutions   harmonic maps  
    LanguageEnglish
    CountrySwitzerland
    systematics 51
    AnnotationIn this paper we give a few discrete versions of Robert Accola’s results on Riemann surfaces with automorphism groups admitting partitions. As a consequence, we establish a condition for γ-hyperelliptic involution on a graph to be unique. Also we construct an infinite family of graphs with more than one γ-hyperelliptic involution.
    Public work category ADC
    No. of Archival Copy41751
    Catal.org.BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici
    Databasexpca - PUBLIKAČNÁ ČINNOSŤ
    ReferencesPERIODIKÁ-Súborný záznam periodika
    unrecognised

    unrecognised

  2. TitleAnalysis and Mathematical Physics
    Issue dataCham : Springer Nature Switzerland AG , 2017
    ISSN1664-23681664-235X
    Form. Descr.časopisy - journals
    Year, No.Vol. 7 no. 3 (2017)
    LanguageEnglish
    CountrySwitzerland
    URLLink na zdrojový dokument
    Public work category GII
    Catal.org.BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici
    Databasexpca - PUBLIKAČNÁ ČINNOSŤ
    References - PERIODIKÁ - Súborný záznam periodika
    (1) - PUBLIKAČNÁ ČINNOSŤ
    ReferencesPERIODIKÁ-Súborný záznam periodika
    ARTICLES2017:
    On discrete versions of two Accola´s theorems about automorphism groups of Riemann surfaces
  3. TitleCounting hypermaps by Egorychev’s method
    Author infoAlexander Mednykh, Roman Nedela
    Author Mednykh Alexander 1953- (50%) UMBFP10 - Katedra matematiky
    Co-authors Nedela Roman 1960- (50%) UMBFP10 - Katedra matematiky
    Source document Analysis and Mathematical Physics. Vol. 6, no. 3 (2016), pp. 301-314. - Cham : Springer Nature Switzerland AG, 2016
    Keywords Fuchsian groups   hypermapy   hypermaps   matematika - mathematics  
    LanguageEnglish
    CountryGermany
    systematics 51
    Annotation© 2015, Springer Basel.The aim of this paper is to find explicit formulae for the number of rooted hypermaps with a given number of darts on an orientable surface of genus g≤ 3. Such formulae were obtained earlier for g= 0 and g= 1 by Walsh and Arquès respectively. We first employ the Egorychev’s method of counting combinatorial sums to obtain a new version of the Arquès formula for genus g= 1. Then we apply the same approach to get new results for genus g= 2 , 3. We could do it due to recent results by Giorgetti, Walsh, and Kazarian, Zograf who derived two different, but equivalent, forms of the generating functions for the number of hypermaps of genus two and three.
    Public work category ADC
    No. of Archival Copy36932
    Catal.org.BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici
    Databasexpca - PUBLIKAČNÁ ČINNOSŤ
    ReferencesPERIODIKÁ-Súborný záznam periodika
    unrecognised

    unrecognised

  4. TitleAnalysis and Mathematical Physics
    Issue dataCham : Springer Nature Switzerland AG , 2016
    ISSN1664-23681664-235X
    Form. Descr.časopisy - journals
    Year, No.Vol. 6 no. 3 (2016)
    LanguageEnglish
    CountrySwitzerland
    URLLink na zdrojový dokument
    Public work category GII
    Catal.org.BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici
    Databasexpca - PUBLIKAČNÁ ČINNOSŤ
    References - PERIODIKÁ - Súborný záznam periodika
    (1) - PUBLIKAČNÁ ČINNOSŤ
    ReferencesPERIODIKÁ-Súborný záznam periodika
    ARTICLES2016:
    Counting hypermaps by Egorychev’s method


  This site uses cookies to make them easier to browse. Learn more about how we use cookies.