Igor Pak - RankMe

117 papers A* 13A 2B 2C 1Journal 96Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	On Vanishing of Gromov-Witten Invariants. CoRR Igor Pak, Colleen Robichaux, Weihong Xu
2025	A*	`conf`	Vanishing of Schubert Coefficients. STOC Igor Pak, Colleen Robichaux
2025	J	`jnl`	Vanishing of Schubert coefficients in probabilistic polynomial time. CoRR Igor Pak, Colleen Robichaux
2025	J	`jnl`	Vanishing of Schubert coefficients is in AM ∩ coAM assuming the GRH. CoRR Igor Pak, Colleen Robichaux
2024	J	`jnl`	Computational complexity of counting coincidences. Theor. Comput. Sci. Swee Hong Chan, Igor Pak
2024	A*	`conf`	Equality Cases of the Alexandrov-Fenchel Inequality Are Not in the Polynomial Hierarchy. STOC Swee Hong Chan, Igor Pak
2024	J	`jnl`	Equality cases of the Stanley-Yan log-concave matroid inequality. CoRR Swee Hong Chan, Igor Pak
2024	J	`jnl`	Linear extensions and continued fractions. Eur. J. Comb. Swee Hong Chan, Igor Pak
2024	J	`jnl`	Positivity of Schubert Coefficients. CoRR Igor Pak, Colleen Robichaux
2024	J	`jnl`	Signed combinatorial interpretations in algebraic combinatorics. CoRR Igor Pak, Colleen Robichaux
2024	J	`jnl`	The bunkbed conjecture is false. CoRR Nikita Gladkov, Igor Pak, Aleksandr Zimin
2024	J	`jnl`	Vanishing of Schubert Coefficients. CoRR Igor Pak, Colleen Robichaux
2023	J	`jnl`	Computational complexity of counting coincidences. CoRR Swee Hong Chan, Igor Pak
2023	J	`jnl`	Effective Poset Inequalities. SIAM J. Discret. Math. Swee Hong Chan, Igor Pak, Greta Panova
2023	J	`jnl`	Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy. CoRR Swee Hong Chan, Igor Pak
2023	J	`jnl`	Extensions of the Kahn-Saks inequality for posets of width two. Comb. Theory Swee Hong Chan, Igor Pak, Greta Panova
2023	J	`jnl`	Linear extensions of finite posets. CoRR Swee Hong Chan, Igor Pak
2023	A*	`conf`	Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. SODA Christian Ikenmeyer, Igor Pak, Greta Panova
2022	J	`jnl`	Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings. Comb. Probab. Comput. Alejandro H. Morales, Igor Pak, Martin Tassy
2022	J	`jnl`	Effective poset inequalities. CoRR Swee Hong Chan, Igor Pak, Greta Panova
2022	J	`jnl`	Log-Concavity in Planar Random Walks. Comb. Swee Hong Chan, Igor Pak, Greta Panova
2022	J	`jnl`	Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. CoRR Christian Ikenmeyer, Igor Pak, Greta Panova
2022	J	`jnl`	Short Presburger Arithmetic Is Hard. SIAM J. Comput. Danny Nguyen, Igor Pak
2022	J	`jnl`	What is a combinatorial interpretation? CoRR Igor Pak
2022	A*	`conf`	What is in #P and what is not? FOCS Christian Ikenmeyer, Igor Pak
2022	J	`jnl`	What is in #P and what is not? CoRR Christian Ikenmeyer, Igor Pak
2021	J	`jnl`	Log-concave poset inequalities. CoRR Swee Hong Chan, Igor Pak
2021	J	`jnl`	On the Number of Integer Points in Translated and Expanded Polyhedra. Discret. Comput. Geom. Danny Nguyen, Igor Pak
2021	J	`jnl`	Presburger Arithmetic with algebraic scalar multiplications. Log. Methods Comput. Sci. Philipp Hieronymi, Danny Nguyen, Igor Pak
2021	J	`jnl`	Sorting probability of Catalan posets. Adv. Appl. Math. Swee Hong Chan, Igor Pak, Greta Panova
2020	J	`jnl`	Counting Linear Extensions of Restricted Posets. Electron. J. Comb. Samuel J. Dittmer, Igor Pak
2020	J	`jnl`	Hidden Symmetries of Weighted Lozenge Tilings. Electron. J. Comb. Igor Pak, Fedor Petrov
2020	J	`jnl`	The Computational Complexity of Integer Programming with Alternations. Math. Oper. Res. Danny Nguyen, Igor Pak
2019	J	`jnl`	Combinatorial inequalities. CoRR Igor Pak
2019	J	`jnl`	Kirszbraun-type theorems for graphs. J. Comb. Theory B Nishant Chandgotia, Igor Pak, Martin Tassy
2019	J	`jnl`	Limit Shapes via Bijections. Comb. Probab. Comput. Stephen Desalvo, Igor Pak
2019	J	`jnl`	On the largest Kronecker and Littlewood-Richardson coefficients. J. Comb. Theory A Igor Pak, Greta Panova, Damir Yeliussizov
2019	J	`jnl`	VC-Dimensions of Short Presburger Formulas. Comb. Danny Nguyen, Igor Pak
2018	J	`jnl`	Asymptotics of the number of standard Young tableaux of skew shape. Eur. J. Comb. Alejandro H. Morales, Igor Pak, Greta Panova
2018	J	`jnl`	Complexity problems in enumerative combinatorics. CoRR Igor Pak
2018	J	`jnl`	Enumerating Projections of Integer Points in Unbounded Polyhedra. SIAM J. Discret. Math. Danny Nguyen, Igor Pak
2018	J	`jnl`	Hook formulas for skew shapes I. J. Comb. Theory A Alejandro H. Morales, Igor Pak, Greta Panova
2018	J	`jnl`	On the number of integer points in translated and expanded polyhedra. CoRR Danny Nguyen, Igor Pak
2018	J	`jnl`	Presburger Arithmetic with algebraic scalar multiplications. CoRR Philipp Hieronymi, Danny Nguyen, Igor Pak
2018	J	`jnl`	Why Is Pi Less Than Twice Phi? Am. Math. Mon. Alejandro H. Morales, Igor Pak, Greta Panova
2017	J	`jnl`	Bounds on certain classes of Kronecker and q-binomial coefficients. J. Comb. Theory A Igor Pak, Greta Panova
2017	A*	`conf`	Complexity of short Presburger arithmetic. STOC Danny Nguyen, Igor Pak
2017	J	`jnl`	Complexity of short Presburger arithmetic. CoRR Danny Nguyen, Igor Pak
2017	J	`jnl`	Complexity of short generating functions. CoRR Danny Nguyen, Igor Pak
2017	B	`conf`	Enumeration of Integer Points in Projections of Unbounded Polyhedra. IPCO Danny Nguyen, Igor Pak
2017	J	`jnl`	Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications. SIAM J. Discret. Math. Alejandro H. Morales, Igor Pak, Greta Panova
2017	J	`jnl`	Lifts, derandomization, and diameters of Schreier graphs of Mealy automata. Comb. Anton Malyshev, Igor Pak
2017	J	`jnl`	On the complexity of computing Kronecker coefficients. Comput. Complex. Igor Pak, Greta Panova
2017	A*	`conf`	Short Presburger Arithmetic Is Hard. FOCS Danny Nguyen, Igor Pak
2017	J	`jnl`	Short Presburger arithmetic is hard. CoRR Danny Nguyen, Igor Pak
2017	J	`jnl`	Skyscraper polytopes and realizations of plane triangulations. J. Comb. Theory B Igor Pak, Stedman Wilson
2017	A	`conf`	The Computational Complexity of Integer Programming with Alternations. CCC Danny Nguyen, Igor Pak
2017	J	`jnl`	The computational complexity of integer programming with alternations. CoRR Danny Nguyen, Igor Pak
2017	J	`jnl`	VC-dimension of short Presburger formulas. CoRR Danny Nguyen, Igor Pak
2016	J	`jnl`	Enumeration of integer points in projections of unbounded polyhedra. CoRR Danny Nguyen, Igor Pak
2016	J	`jnl`	Fast Domino Tileability. Discret. Comput. Geom. Igor Pak, Adam Sheffer, Martin Tassy
2016	J	`jnl`	On the Odd Area of Planar Sets. Discret. Comput. Geom. Assaf Oren, Igor Pak, Rom Pinchasi
2016	A*	`conf`	Permutation patterns are hard to count. SODA Scott Garrabrant, Igor Pak
2015	J	`jnl`	On the Longest $k$-Alternating Subsequence. Electron. J. Comb. Igor Pak, Robin Pemantle
2015	J	`jnl`	Pattern avoidance is not P-recursive. CoRR Scott Garrabrant, Igor Pak
2014	J	`jnl`	Cayley compositions, partitions, polytopes, and geometric bijections. J. Comb. Theory A Matjaz Konvalinka, Igor Pak
2014	J	`jnl`	Generalized loop-erased random walks and approximate reachability. Random Struct. Algorithms Igor Gorodezky, Igor Pak
2014	J	`jnl`	On the complexity of computing Kronecker coefficients. CoRR Igor Pak, Greta Panova
2014	J	`jnl`	The shape of random pattern-avoiding permutations. Adv. Appl. Math. Sam Miner, Igor Pak
2013	J	`jnl`	A Quantitative Steinitz Theorem for Plane Triangulations. CoRR Igor Pak, Stedman Wilson
2013	J	`jnl`	Constructing Uniquely Realizable Graphs. Discret. Comput. Geom. Igor Pak, Dan Vilenchik
2013	J	`jnl`	The Complexity of Generalized Domino Tilings. Electron. J. Comb. Igor Pak, Jed Yang
2013	J	`jnl`	The complexity of generalized domino tilings CoRR Igor Pak, Jed Yang
2013	J	`jnl`	Tiling simply connected regions with rectangles CoRR Igor Pak, Jed Yang
2013	J	`jnl`	Tiling simply connected regions with rectangles. J. Comb. Theory A Igor Pak, Jed Yang
2012	J	`jnl`	Acute triangulations of polyhedra and ℝ N. Comb. Eryk Kopczynski, Igor Pak, Piotr Przytycki
2012	J	`jnl`	Collapsing Walls Theorem. Am. Math. Mon. Igor Pak, Rom Pinchasi
2012	J	`jnl`	Testing commutativity of a group and the power of randomization. LMS J. Comput. Math. Igor Pak
2011	J	`jnl`	The weighted hook length formula. J. Comb. Theory A Ionut Ciocan-Fontanine, Matjaz Konvalinka, Igor Pak
2010	—	`conf`	Acute triangulations of polyhedra and the Euclidean space. SCG Eryk Kopczynski, Igor Pak, Piotr Przytycki
2010	C	`conf`	Complexity of O'Hara's Algorithm. CTW Matjaz Konvalinka, Igor Pak
2010	J	`jnl`	Reductions of Young Tableau Bijections. SIAM J. Discret. Math. Igor Pak, Ernesto Vallejo
2009	J	`jnl`	Geometry and complexity of O'Hara's algorithm. Adv. Appl. Math. Matjaz Konvalinka, Igor Pak
2009	J	`jnl`	Hamiltonian paths in Cayley graphs. Discret. Math. Igor Pak, Rados Radoicic
2008	J	`jnl`	Inflating the Cube Without Stretching. Am. Math. Mon. Igor Pak
2008	J	`jnl`	Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings. Discret. Comput. Geom. Ezra Miller, Igor Pak
2006	J	`jnl`	A combinatorial proof of the Rogers-Ramanujan and Schur identities. J. Comb. Theory A Cilanne Boulet, Igor Pak
2006	J	`jnl`	Expansion Of Product Replacement Graphs. Comb. Alexander Gamburd, Igor Pak
2006	J	`jnl`	Percolation on Finite Cayley Graphs. Comb. Probab. Comput. Christopher Malon, Igor Pak
2005	J	`jnl`	Combinatorics and geometry of Littlewood-Richardson cones. Eur. J. Comb. Igor Pak, Ernesto Vallejo
2005	J	`jnl`	The area of cyclic polygons: Recent progress on Robbins' conjectures. Adv. Appl. Math. Igor Pak
2004	J	`jnl`	Bijections for refined restricted permutations. J. Comb. Theory A Sergi Elizalde, Igor Pak
2004	J	`jnl`	Partition congruences by involutions. Eur. J. Comb. Christine Bessenrodt, Igor Pak
2004	J	`jnl`	Strong bias of group generators: an obstacle to the "product replacement algorithm". J. Algorithms László Babai, Igor Pak
2004	J	`jnl`	The nature of partition bijections I. Involutions. Adv. Appl. Math. Igor Pak
2004	J	`jnl`	Tilings of rectangles with T-tetrominoes. Theor. Comput. Sci. Michael Korn, Igor Pak
2003	J	`jnl`	Tile invariants: new horizons. Theor. Comput. Sci. Igor Pak
2002	A*	`conf`	Expansion of product replacement graphs. SODA Alexander Gamburd, Igor Pak
2002	A*	`conf`	Mixing time and long paths in graphs. SODA Igor Pak
2002	—	`conf`	Percolation on Finite Cayley Graphs. RANDOM Christopher Malon, Igor Pak
2002	J	`jnl`	Ribbon Tile Invariants from the Signed Area. J. Comb. Theory A Cristopher Moore, Igor Pak
2001	J	`jnl`	On Growth of Grigorchuk Groups. Int. J. Algebra Comput. Roman Muchnik, Igor Pak
2001	J	`jnl`	On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes. Discret. Appl. Math. Igor Pak, Van H. Vu
2000	J	`jnl`	Fast Constructive Recognition of a Black Box Group Isomorphic to Sn or An using Goldbach's Conjecture. J. Symb. Comput. Sergey Bratus, Igor Pak
2000	J	`jnl`	On the Number of Faces of Certain Transportation Polytopes. Eur. J. Comb. Igor Pak
2000	A*	`conf`	Strong bias of group generators: an obstacle to the "product replacement algorithm". SODA László Babai, Igor Pak
2000	A*	`conf`	The product replacement algorithm is polynomial. FOCS Igor Pak
1999	A*	`conf`	Lifting Markov Chains to Speed up Mixing. STOC Fang Chen, László Lovász, Igor Pak
1999	B	`conf`	On Sampling Generating Sets of Finite Groups and Product Replacement Algorithm (extended abstract). ISSAC Igor Pak, Sergey Bratus
1999	J	`jnl`	On Tilings by Ribbon Tetrominoes. J. Comb. Theory A Roman Muchnik, Igor Pak
1999	A	`conf`	Random Cayley Graphs with O(log[G]) Generators Are Expanders. ESA Igor Pak
1999	J	`jnl`	Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees. Discret. Math. Igor Pak
1999	A*	`conf`	Using Stopping Times to Bound Mixing Times. SODA Igor Pak
1998	J	`jnl`	A generalization of Sylvester's identity. Discret. Math. Igor Pak, Alexander Postnikov
1997	J	`jnl`	A direct bijective proof of the hook-length formula. Discret. Math. Theor. Comput. Sci. Jean-Christophe Novelli, Igor Pak, Alexander V. Stoyanovskii
1997	—	`conf`	When and how Randomization Methods in Algorithm Design Igor Pak
1996	J	`jnl`	Trees Associated with the Motzkin Numbers. J. Comb. Theory A Alexander Kuznetsov, Igor Pak, Alexander Postnikov