Tag Archives: Igor Pak

Igor Pak: How I chose Enumerative Combinatorics

Originally posted on Igor Pak's blog:
Apologies for not writing anything for awhile. After Feb 24, the math part of the “life and math” slogan lost a bit of relevance, while the actual events were stupefying to the point…

Posted in Combinatorics, What is Mathematics | Tagged | 1 Comment

Igor Pak: What if they are all wrong?

Originally posted on Igor Pak's blog:
Conjectures are a staple of mathematics. They are everywhere, permeating every area, subarea and subsubarea. They are diverse enough to avoid a single general adjective. They come in al shapes and sizes. Some…

Posted in Combinatorics, Computer Science and Optimization, Geometry, What is Mathematics | Tagged | 7 Comments

Danny Nguyen and Igor Pak: Presburger Arithmetic Problem Solved!

Short Presburger arithmetic is hard! This is a belated report on a remarkable breakthrough from 2017. The paper is Short Presburger arithmetic is hard, by Nguyen and Pak. Danny Nguyen Integer programming in bounded dimension: Lenstra’s Theorem Algorithmic tasks are … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Convex polytopes | Tagged , , , , , , , , | 3 Comments

Igor Pak will give the 2018 Erdős Lectures

  Next week Igor Pak will give the 2018 Erdős Lectures (delayed from June) Here is the poster   Combinatorics — Erdos lecture: Igor Pak (UCLA) “Counting linear extensions” Monday December 10  11:00-13:00 Location:  IIAS Hall 130, Feldman building,  Givat Ram     … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Updates | Tagged , , | Leave a comment

Igor Pak is Giving the 2018 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science

Update: The lectures this week are cancelled.  They will be given at a later date. Next week Igor Pak will give the 2018 Erdős Lectures   Monday Jun 18 2018 Combinatorics — Erdos lecture: Igor Pak (UCLA) “Counting linear extensions” 11:00am to 12:30pm Location: … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Geometry, Updates | Tagged | Leave a comment

A Wonderful Paper by Igor Pak: Complexity Problems in Enumerative Combinatorics

Greetings from Sa Pa in the very north of Vietnam. Let me recommend a  great thought-provoking paper by Igor Pak:  Complexity problems in enumerative combinatorics. As Igor wrote on his blog: Well, I finally finished my ICM paper. It’s only 30 … Continue reading

Posted in Combinatorics | Tagged , | Leave a comment

Igor Pak’s collection of combinatorics videos

The purpose of this short but valuable post is to bring to your attention Igor Pak’s Collection of Combinatorics Videos

Posted in Combinatorics | Tagged | Leave a comment

Igor Pak’s “Lectures on Discrete and Polyhedral Geometry”

Here is a link to Igor Pak’s  book on Discrete and Polyhedral Geometry  (free download) . And here is just the table of contents. It is a wonderful book, full of gems, contains original look on many important directions, things that … Continue reading

Posted in Book review, Convex polytopes, Convexity | Tagged , , , | 4 Comments