About: Igor Pak     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Wikicat21st-centuryMathematicians, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FIgor_Pak

Igor Pak (Russian: Игорь Пак) (born 1971, Moscow, Soviet Union) is a professor of mathematics at the University of California, Los Angeles, working in combinatorics and discrete probability. He formerly taught at the Massachusetts Institute of Technology and the University of Minnesota, and he is best known for his bijective proof of the hook-length formula for the number of Young tableaux, and his work on random walks. He was a keynote speaker alongside George Andrews and Doron Zeilberger at the 2006 Harvey Mudd College Mathematics Conference on Enumerative Combinatorics.

AttributesValues
rdf:type
rdfs:label
  • إيغور باك (ar)
  • Igor Pak (en)
  • Igor Pak (pt)
  • 伊戈尔·帕克 (zh)
rdfs:comment
  • إيغور باك (بالإنجليزية: Igor Pak)‏ هو رياضياتي أمريكي، ولد في 1971 في موسكو في روسيا. (ar)
  • 伊戈尔·帕克(英語:Igor Pak 俄語:Игорь Пак 1971年-),生于苏联莫斯科,是一位俄裔美籍数学家,主要研究组合数学和概率论,现任加州大学洛杉矶分校教授。在加州大学洛杉矶分校任教之前,帕克曾经在麻省理工学院和明尼苏达大学工作过,并且因为他对于杨氏矩阵双射法解以及随机漫步上的研究而闻名。他曾经在2006年在哈维穆德学院数学会议列举组合会上做演讲,其他两位演讲者包括George Andrews和Doron Zeilberger。 帕克是数学杂志Discrete Mathematics的编辑他于2009年在卡尔加里大学做讲师。 (zh)
  • Igor Pak (Russian: Игорь Пак) (born 1971, Moscow, Soviet Union) is a professor of mathematics at the University of California, Los Angeles, working in combinatorics and discrete probability. He formerly taught at the Massachusetts Institute of Technology and the University of Minnesota, and he is best known for his bijective proof of the hook-length formula for the number of Young tableaux, and his work on random walks. He was a keynote speaker alongside George Andrews and Doron Zeilberger at the 2006 Harvey Mudd College Mathematics Conference on Enumerative Combinatorics. (en)
  • Igor Pak (em russo: Игорь Пак) (Moscou, 1971) é um professor de matemática da Universidade da Califórnia em Los Angeles, trabalhando com combinatória e probabilidade discreta. Lecionou anteriormente no Instituto de Tecnologia de Massachusetts e na Universidade de Minnesota, sendo mais conhecido por sua da hook-length formula para o diagrama de Young, e seu trabalho sobre passeio aleatório. Foi um palestrante principal juntamente com George Andrews e Doron Zeilberger na Mathematics Conference on Enumerative Combinatorics no de 2006. (pt)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 56 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software