The qTSPP Theorem

Activity: Talk or presentation › Contributed talk › unknown

Description

Sometimes we solve exciting combinatorial problems by a boring computation, and sometimes we solve boring combinatorial problems by an exciting computation. This talk is about an exciting combinatorial problem which was solved by an exciting computation: We give a proof of the long standing qTSPP conjecture in enumerative combinatorics. This proof is the result of a collaboration between Christoph Koutschan, Doron Zeilberger, and the speaker.
Period15 Aug 2010
Event titleConference in honor of Doron Zeilberger's 60th Birthday
Event typeConference
LocationChinaShow on map

Fields of science

  • 101002 Analysis
  • 101013 Mathematical logic
  • 101001 Algebra
  • 101012 Combinatorics
  • 101020 Technical mathematics
  • 102 Computer Sciences
  • 101 Mathematics
  • 102011 Formal languages
  • 101005 Computer algebra
  • 101025 Number theory
  • 101003 Applied geometry
  • 102025 Distributed systems

JKU Focus areas

  • Computation in Informatics and Mathematics
  • Engineering and Natural Sciences (in general)