Recent Comments
-
Recent Posts
- Past and Future Events
- Joshua Hinman proved Bárány’s conjecture on face numbers of polytopes, and Lei Xue proved a lower bound conjecture by Grünbaum.
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- Combinatorial Convexity: A Wonderful New Book by Imre Bárány
- Chaim Even-Zohar, Tsviqa Lakrec, and Ran Tessler present: The Amplituhedron BCFW Triangulation
- Ehud Friedgut: How many cubes of 2×2×2 fit into a box of size 8×4×3? (TYI 49)
- Is HQCA Possible? A conversation with Michael Brooks
- To cheer you up in difficult times 35 combined with Test Your Intuition 48: Alef’s corner – Jazz and Math
- Reflections: On the Occasion of Ron Adin’s and Yuval Roichman’s Birthdays, and FPSAC 2021
Top Posts & Pages
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- Joshua Hinman proved Bárány's conjecture on face numbers of polytopes, and Lei Xue proved a lower bound conjecture by Grünbaum.
- TYI 30: Expected number of Dice throws
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Game Theory 2021
- Telling a Simple Polytope From its Graph
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- Bálint Virág: Random matrices for Russ
- Past and Future Events
RSS
Tag Archives: Igor Pak
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 Igor Pak
7 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 Erdos lecture, Igor Pak, Paul Erdos
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 Igor Pak
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
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
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 Convex polytopes, Convexity, Igor Pak, rigidity
4 Comments