Media Summary: Title: Complexity approach to combinatorial interpretations Abstract: For over a century, the Algebraic Combinatorics has enjoyed ... Combinatorial Inequalities, Yale colloquium ( Abstract: In the ocean of log-concave inequalities, there are two islands that are especially difficult. First, Mason's conjectures say ...

Igor Pak Wednesday May 18 - Detailed Analysis & Overview

Title: Complexity approach to combinatorial interpretations Abstract: For over a century, the Algebraic Combinatorics has enjoyed ... Combinatorial Inequalities, Yale colloquium ( Abstract: In the ocean of log-concave inequalities, there are two islands that are especially difficult. First, Mason's conjectures say ... Stony Brook Mathematics Colloquium Video Universality theorems in Algebra and Geometry Combinatorics Invited Lecture 13.9 Complexity problems in enumerative combinatorics Combinatorics and complexity of Stanley's inequality

Title: Counting trees and matchings via continuous fractions Speaker: My p-adic hat: bonfire.com/p-adic-hat-1 My Patreon: ...

Photo Gallery

Igor Pak - Wednesday, May 18
Combinatorial Inequalities
Igor Pak (UCLA) - The combinatorics and complexity of integer sequences [2017]
Igor Pak: "Log-concave poset inequalities"
Igor Pak - Counting with Wang Tiles
Igor Pak - Universality theorems in Algebra and Geometry
Igor Pak - Words in linear groups, random walks, automata and P-recursiveness
Complexity problems in enumerative combinatorics – Igor Pak – ICM2018
Counting Contingency Tables
Combinatorics and complexity of Stanley’s inequality
Counting trees and matchings via continuous fractions
Combinatorics & Community - Igor Pak of UCLA Mathematics
Sponsored
Sponsored
View Detailed Profile
Igor Pak - Wednesday, May 18

Igor Pak - Wednesday, May 18

Title: Complexity approach to combinatorial interpretations Abstract: For over a century, the Algebraic Combinatorics has enjoyed ...

Combinatorial Inequalities

Combinatorial Inequalities

Combinatorial Inequalities, Yale colloquium (

Sponsored
Igor Pak (UCLA) - The combinatorics and complexity of integer sequences [2017]

Igor Pak (UCLA) - The combinatorics and complexity of integer sequences [2017]

Igor Pak

Igor Pak: "Log-concave poset inequalities"

Igor Pak: "Log-concave poset inequalities"

Abstract: In the ocean of log-concave inequalities, there are two islands that are especially difficult. First, Mason's conjectures say ...

Igor Pak - Counting with Wang Tiles

Igor Pak - Counting with Wang Tiles

slides: https://www.ima.umn.edu/materials/2014-2015/W11.10-14.14/22153/

Sponsored
Igor Pak - Universality theorems in Algebra and Geometry

Igor Pak - Universality theorems in Algebra and Geometry

Stony Brook Mathematics Colloquium Video Universality theorems in Algebra and Geometry

Igor Pak - Words in linear groups, random walks, automata and P-recursiveness

Igor Pak - Words in linear groups, random walks, automata and P-recursiveness

Igor Pak

Complexity problems in enumerative combinatorics – Igor Pak – ICM2018

Complexity problems in enumerative combinatorics – Igor Pak – ICM2018

Combinatorics Invited Lecture 13.9 Complexity problems in enumerative combinatorics

Counting Contingency Tables

Counting Contingency Tables

Igor Pak

Combinatorics and complexity of Stanley’s inequality

Combinatorics and complexity of Stanley’s inequality

Combinatorics and complexity of Stanley's inequality

Counting trees and matchings via continuous fractions

Counting trees and matchings via continuous fractions

Title: Counting trees and matchings via continuous fractions Speaker:

Combinatorics & Community - Igor Pak of UCLA Mathematics

Combinatorics & Community - Igor Pak of UCLA Mathematics

Igor Pak

Make a math talk with me | May 28 2026

Make a math talk with me | May 28 2026

My p-adic hat: bonfire.com/p-adic-hat-1 My Patreon: ...