Igor Pak

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 55

Top Venues

CoRR

J. Comb. Theory, Ser. A

SIAM J. Discret. Math.

Discret. Comput. Geom.

Publications

Swee Hong Chan, Igor Pak
Linear extensions and continued fractions. Eur. J. Comb. 122 (2024)
Swee Hong Chan, Igor Pak
Equality cases of the Stanley-Yan log-concave matroid inequality. CoRR (2024)
Swee Hong Chan, Igor Pak
Equality Cases of the Alexandrov-Fenchel Inequality Are Not in the Polynomial Hierarchy. STOC (2024)
Igor Pak, Colleen Robichaux
Signed combinatorial interpretations in algebraic combinatorics. CoRR (2024)
Swee Hong Chan, Igor Pak
Computational complexity of counting coincidences. Theor. Comput. Sci. 1015 (2024)
Swee Hong Chan, Igor Pak
Computational complexity of counting coincidences. CoRR (2023)
Swee Hong Chan, Igor Pak
Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy. CoRR (2023)
Christian Ikenmeyer, Igor Pak, Greta Panova
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. SODA (2023)
Swee Hong Chan, Igor Pak, Greta Panova
Effective Poset Inequalities. SIAM J. Discret. Math. 37 (3) (2023)
Swee Hong Chan, Igor Pak
Linear extensions of finite posets. CoRR (2023)
Christian Ikenmeyer, Igor Pak
What is in #P and what is not? CoRR (2022)
Swee Hong Chan, Igor Pak, Greta Panova
Log-Concavity in Planar Random Walks. Comb. 42 (6) (2022)
Christian Ikenmeyer, Igor Pak
What is in #P and what is not? FOCS (2022)
Danny Nguyen, Igor Pak
Short Presburger Arithmetic Is Hard. SIAM J. Comput. 51 (2) (2022)
Christian Ikenmeyer, Igor Pak, Greta Panova
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. CoRR (2022)
Swee Hong Chan, Igor Pak, Greta Panova
Effective poset inequalities. CoRR (2022)
Alejandro H. Morales, Igor Pak, Martin Tassy
Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings. Comb. Probab. Comput. 31 (4) (2022)
Igor Pak
What is a combinatorial interpretation? CoRR (2022)
Swee Hong Chan, Igor Pak, Greta Panova
Sorting probability of Catalan posets. Adv. Appl. Math. 129 (2021)
Philipp Hieronymi, Danny Nguyen, Igor Pak
Presburger Arithmetic with algebraic scalar multiplications. Log. Methods Comput. Sci. 17 (3) (2021)
Swee Hong Chan, Igor Pak
Log-concave poset inequalities. CoRR (2021)
Danny Nguyen, Igor Pak
On the Number of Integer Points in Translated and Expanded Polyhedra. Discret. Comput. Geom. 65 (2) (2021)
Igor Pak, Fedor Petrov
Hidden Symmetries of Weighted Lozenge Tilings. Electron. J. Comb. 27 (3) (2020)
Danny Nguyen, Igor Pak
The Computational Complexity of Integer Programming with Alternations. Math. Oper. Res. 45 (1) (2020)
Sam Dittmer, Igor Pak
Counting Linear Extensions of Restricted Posets. Electron. J. Comb. 27 (4) (2020)
Igor Pak
Combinatorial inequalities. CoRR (2019)
Igor Pak, Greta Panova, Damir Yeliussizov
On the largest Kronecker and Littlewood-Richardson coefficients. J. Comb. Theory, Ser. A 165 (2019)
Danny Nguyen, Igor Pak
VC-Dimensions of Short Presburger Formulas. Comb. 39 (4) (2019)
Stephen Desalvo, Igor Pak
Limit Shapes via Bijections. Comb. Probab. Comput. 28 (2) (2019)
Nishant Chandgotia, Igor Pak, Martin Tassy
Kirszbraun-type theorems for graphs. J. Comb. Theory, Ser. B 137 (2019)
Danny Nguyen, Igor Pak
On the number of integer points in translated and expanded polyhedra. CoRR (2018)
Philipp Hieronymi, Danny Nguyen, Igor Pak
Presburger Arithmetic with algebraic scalar multiplications. CoRR (2018)
Danny Nguyen, Igor Pak
Enumerating Projections of Integer Points in Unbounded Polyhedra. SIAM J. Discret. Math. 32 (2) (2018)
Alejandro H. Morales, Igor Pak, Greta Panova
Asymptotics of the number of standard Young tableaux of skew shape. Eur. J. Comb. 70 (2018)
Alejandro H. Morales, Igor Pak, Greta Panova
Why Is Pi Less Than Twice Phi? Am. Math. Mon. 125 (8) (2018)
Alejandro H. Morales, Igor Pak, Greta Panova
-analogues and bijections. J. Comb. Theory, Ser. A 154 (2018)
Igor Pak
Complexity problems in enumerative combinatorics. CoRR (2018)
Danny Nguyen, Igor Pak
Short Presburger Arithmetic Is Hard. FOCS (2017)
Igor Pak, Stedman Wilson
Skyscraper polytopes and realizations of plane triangulations. J. Comb. Theory, Ser. B 127 (2017)
Igor Pak, Greta Panova
On the complexity of computing Kronecker coefficients. Comput. Complex. 26 (1) (2017)
Igor Pak, Greta Panova
Bounds on certain classes of Kronecker and q-binomial coefficients. J. Comb. Theory, Ser. A 147 (2017)
Anton Malyshev, Igor Pak
Lifts, derandomization, and diameters of Schreier graphs of Mealy automata. Comb. 37 (4) (2017)
Danny Nguyen, Igor Pak
Complexity of short Presburger arithmetic. CoRR (2017)
Danny Nguyen, Igor Pak
The computational complexity of integer programming with alternations. CoRR (2017)
Danny Nguyen, Igor Pak
Enumeration of Integer Points in Projections of Unbounded Polyhedra. IPCO (2017)
Alejandro H. Morales, Igor Pak, Greta Panova
Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications. SIAM J. Discret. Math. 31 (3) (2017)
Danny Nguyen, Igor Pak
VC-dimension of short Presburger formulas. CoRR (2017)
Danny Nguyen, Igor Pak
Short Presburger arithmetic is hard. CoRR (2017)
Danny Nguyen, Igor Pak
Complexity of short generating functions. CoRR (2017)
Danny Nguyen, Igor Pak
The Computational Complexity of Integer Programming with Alternations. Computational Complexity Conference (2017)
Danny Nguyen, Igor Pak
Complexity of short Presburger arithmetic. STOC (2017)
Igor Pak, Adam Sheffer, Martin Tassy
Fast Domino Tileability. Discret. Comput. Geom. 56 (2) (2016)
Scott Garrabrant, Igor Pak
Permutation patterns are hard to count. SODA (2016)
Danny Nguyen, Igor Pak
Enumeration of integer points in projections of unbounded polyhedra. CoRR (2016)
Assaf Oren, Igor Pak, Rom Pinchasi
On the Odd Area of Planar Sets. Discret. Comput. Geom. 55 (3) (2016)
Igor Pak, Robin Pemantle
On the Longest $k$-Alternating Subsequence. Electron. J. Comb. 22 (1) (2015)
Scott Garrabrant, Igor Pak
Pattern avoidance is not P-recursive. CoRR (2015)
Sam Miner, Igor Pak
The shape of random pattern-avoiding permutations. Adv. Appl. Math. 55 (2014)
Igor Gorodezky, Igor Pak
Generalized loop-erased random walks and approximate reachability. Random Struct. Algorithms 44 (2) (2014)
Matjaz Konvalinka, Igor Pak
Cayley compositions, partitions, polytopes, and geometric bijections. J. Comb. Theory, Ser. A 123 (1) (2014)
Igor Pak, Greta Panova
On the complexity of computing Kronecker coefficients. CoRR (2014)
Igor Pak, Jed Yang
The complexity of generalized domino tilings CoRR (2013)
Igor Pak, Jed Yang
Tiling simply connected regions with rectangles CoRR (2013)
Igor Pak, Stedman Wilson
A Quantitative Steinitz Theorem for Plane Triangulations. CoRR (2013)
Igor Pak, Jed Yang
Tiling simply connected regions with rectangles. J. Comb. Theory, Ser. A 120 (7) (2013)
Igor Pak, Dan Vilenchik
Constructing Uniquely Realizable Graphs. Discret. Comput. Geom. 50 (4) (2013)
Igor Pak, Jed Yang
The Complexity of Generalized Domino Tilings. Electron. J. Comb. 20 (4) (2013)
Igor Pak
Testing commutativity of a group and the power of randomization. LMS J. Comput. Math. 15 (2012)
Eryk Kopczynski, Igor Pak, Piotr Przytycki
Acute triangulations of polyhedra and ℝ N. Comb. 32 (1) (2012)
Igor Pak, Rom Pinchasi
Collapsing Walls Theorem. Am. Math. Mon. 119 (2) (2012)
Ionut Ciocan-Fontanine, Matjaz Konvalinka, Igor Pak
The weighted hook length formula. J. Comb. Theory, Ser. A 118 (6) (2011)
Matjaz Konvalinka, Igor Pak
Complexity of O'Hara's Algorithm. CTW (2010)
Eryk Kopczynski, Igor Pak, Piotr Przytycki
Acute triangulations of polyhedra and the Euclidean space. SCG (2010)
Igor Pak, Ernesto Vallejo
Reductions of Young Tableau Bijections. SIAM J. Discret. Math. 24 (1) (2010)
Matjaz Konvalinka, Igor Pak
Geometry and complexity of O'Hara's algorithm. Adv. Appl. Math. 42 (2) (2009)
Igor Pak, Rados Radoicic
Hamiltonian paths in Cayley graphs. Discret. Math. 309 (17) (2009)
Igor Pak
Inflating the Cube Without Stretching. Am. Math. Mon. 115 (5) (2008)
Ezra Miller, Igor Pak
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings. Discret. Comput. Geom. 39 (1-3) (2008)
Cilanne Boulet, Igor Pak
A combinatorial proof of the Rogers-Ramanujan and Schur identities. J. Comb. Theory, Ser. A 113 (6) (2006)
Alexander Gamburd, Igor Pak
Expansion Of Product Replacement Graphs. Comb. 26 (4) (2006)
Christopher Malon, Igor Pak
Percolation on Finite Cayley Graphs. Comb. Probab. Comput. 15 (4) (2006)
Igor Pak
The area of cyclic polygons: Recent progress on Robbins' conjectures. Adv. Appl. Math. 34 (4) (2005)
Igor Pak, Ernesto Vallejo
Combinatorics and geometry of Littlewood-Richardson cones. Eur. J. Comb. 26 (6) (2005)
Christine Bessenrodt, Igor Pak
Partition congruences by involutions. Eur. J. Comb. 25 (8) (2004)
Michael Korn, Igor Pak
Tilings of rectangles with T-tetrominoes. Theor. Comput. Sci. 319 (1-3) (2004)
Sergi Elizalde, Igor Pak
Bijections for refined restricted permutations. J. Comb. Theory, Ser. A 105 (2) (2004)
Igor Pak
The nature of partition bijections I. Involutions. Adv. Appl. Math. 33 (2) (2004)
László Babai, Igor Pak
Strong bias of group generators: an obstacle to the "product replacement algorithm". J. Algorithms 50 (2) (2004)
Igor Pak
Tile invariants: new horizons. Theor. Comput. Sci. 303 (2-3) (2003)
Alexander Gamburd, Igor Pak
Expansion of product replacement graphs. SODA (2002)
Igor Pak
Mixing time and long paths in graphs. SODA (2002)
Cristopher Moore, Igor Pak
Ribbon Tile Invariants from the Signed Area. J. Comb. Theory, Ser. A 98 (1) (2002)
Christopher Malon, Igor Pak
Percolation on Finite Cayley Graphs. RANDOM (2002)
Igor Pak, Van H. Vu
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes. Discret. Appl. Math. 110 (2-3) (2001)
Roman Muchnik, Igor Pak
On Growth of Grigorchuk Groups. Int. J. Algebra Comput. 11 (1) (2001)
Sergey Bratus, Igor Pak
Fast Constructive Recognition of a Black Box Group Isomorphic to Sn or An using Goldbach's Conjecture. J. Symb. Comput. 29 (1) (2000)
László Babai, Igor Pak
Strong bias of group generators: an obstacle to the "product replacement algorithm". SODA (2000)
Igor Pak
The product replacement algorithm is polynomial. FOCS (2000)
Igor Pak
On the Number of Faces of Certain Transportation Polytopes. Eur. J. Comb. 21 (5) (2000)
Igor Pak
Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees. Discret. Math. 204 (1-3) (1999)

Igor Pak.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Igor Pak