Siddhesh Joshi (Editor)

László Pyber

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Name
  
Laszlo Pyber


Role
  
Mathematician


Awards
  
Academy Prize, Alfred Renyi Prize

L szl pyber how to avoid the classification theorem the classification theorem off


László Pyber (born 8 May 1960 in Budapest) is a Hungarian mathematician. He works in combinatorics and group theory. He is a researcher at the Alfréd Rényi Institute of Mathematics, Budapest.He received the title the Doctor of Science from the Hungarian Academy of Sciences (1998). He won the Academics Prize (2007).

Contents

Laszlo Pyber (Alfred Renyi Institute of Mathematics, Budapest) Growth in linear groups


Main results

  • He proved the conjecture of Paul Erdős and Tibor Gallai, that the edges of any simple graph with n vertices can be covered with at most n-1 circuits and edges.
  • He proved the following conjecture Paul Erdős. Any graph with n vertices and its complement can be covered with n2/4+2 cliques.
  • He proved a clog2n bound to the size of a minimal base of a primitive permutation group of degree n not containing An.
  • He gave the following estimate of the number of groups of order n. If the prime power decomposition of n is n=p1g1 ⋯ pkgk and μ=max(g1,...,gk), then the number of nonisomporphic n-element groups is at most
    • n ( 2 27 + o ( 1 ) ) μ 2 .
  • Łuczak and Pyber proved the following conjecture of McKay. For every, ε>0 there is a number c such that for all sufficiently large n, c randomly chosen elements generate the symmetric group Sn with probability greater than 1-ε.
  • A result also proved by Łuczak and Pyber states that almost every element of Sn does not belong to a transitive subgroup different from Sn and An (conjectured by Cameron).
  • Solving a problem of subgroup growth he proved that for every nondecreasing function g(n)≤log(n) there is a residually finite group generated by 4 element, whose growth type is n g ( n ) .

    • Selected papers

  • L. Pyber: An Erdős-Gallai conjecture, Combinatorica, 5(1985), 67–79.
  • L. Pyber: Clique covering of graphs, Combinatorica, 6(1986), 393–398.
  • L. Pyber: Enumerating finite groups of given order, Annals of Mathematics, (2), 137(1993), 203–220.
  • L. Pyber: On the orders of doubly transitive permutation groups, elementary estimates, J. Combin. Theory, (A), 62(1993), 361–366.
  • L. Pyber: Groups of intermediate subgroup growth and a problem of Grothendieck, Duke Math. J., 121(2004), 169–188.
  • A. Jaikin-Zapirain, L. Pyber: Random generation of finite and profinite groups and group enumeration, to appear in Annals of Mathematics.

    • References

    László Pyber Wikipedia
    (Text) CC BY-SA


    Similar Topics