Počet záznamů: 1  

Semigroup Structure of Sets of Solutions to Equation X^m = X^s

  1. 1.
    0493285 - ÚI 2019 RIV HU eng J - Článek v odborném periodiku
    Porubský, Štefan
    Semigroup Structure of Sets of Solutions to Equation X^m = X^s.
    Universitatis Scientiarum Budapestinensis de Rolando Eotvos Nominatae. Annales. Sectio Computatorica. Roč. 48, č. 1 (2018), s. 151-167. ISSN 0138-9491
    Grant ostatní: GA ČR(CZ) GA17-02804S
    Program: GA
    Institucionální podpora: RVO:67985807
    Klíčová slova: residually finite commutative ring * idempotent * maximal one-idempotent semigroup * maximal group * binomial polynomial
    Obor OECD: Pure mathematics
    http://ac.inf.elte.hu/Vol_048_2018/151_48.pdf

    We describe the semigroup and group structure of the set of solutions to equation X^m = X^s over the multiplicative semigroups of factor rings of residually finite commutative rings and of residually finite commutative PID’s. The analysis is done in terms of the structure of maximal unipotent subsemigroups and subgroups of semigroups of the corresponding rings. In case of residually finite PID’s we employ the available idempotents analysis of the Euler–Fermat Theorem in these rings used to determine minimal positive integers nu and nu such that for all elements x of these rings one has x^(kappa+delta)= x^kappa. In particular, the case when this set of solutions is a union of groups is handled. As a simple application we show a not yet noticed group structure of the set of solutions to x^n = x (mod n) connected with the message space of RSA cryptosystems and Fermat pseudoprimes.
    Trvalý link: http://hdl.handle.net/11104/0286672

     
    Název souboruStaženoVelikostKomentářVerzePřístup
    a0493285.pdf3414.5 KBVolne dostupne online.Vydavatelský postprintpovolen
     
Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.