Igor Pak

CoRR, September, 2025

On Vanishing of Gromov-Witten Invariants.

[BibT_eX]

[DOI]

Weihong Xu

CoRR, August, 2025

Vanishing of Schubert coefficients is in AM ∩ coAM assuming the GRH.

[BibT_eX]

[DOI]

CoRR, April, 2025

Vanishing of Schubert Coefficients.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

Computational complexity of counting coincidences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Linear extensions and continued fractions.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Positivity of Schubert Coefficients.

[BibT_eX]

[DOI]

CoRR, 2024

The bunkbed conjecture is false.

[BibT_eX]

[DOI]

Nikita Gladkov

Aleksandr Zimin

CoRR, 2024

Equality cases of the Stanley-Yan log-concave matroid inequality.

[BibT_eX]

[DOI]

CoRR, 2024

Signed combinatorial interpretations in algebraic combinatorics.

[BibT_eX]

[DOI]

CoRR, 2024

Equality Cases of the Alexandrov-Fenchel Inequality Are Not in the Polynomial Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

Effective Poset Inequalities.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2023

Linear extensions of finite posets.

[BibT_eX]

[DOI]

CoRR, 2023

Extensions of the Kahn-Saks inequality for posets of width two.

[BibT_eX]

[DOI]

Comb. Theory, 2023

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy.

[BibT_eX]

[DOI]

Christian Ikenmeyer

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Log-Concavity in Planar Random Walks.

[BibT_eX]

[DOI]

Comb., December, 2022

Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings.

[BibT_eX]

[DOI]

Martin Tassy

Comb. Probab. Comput., 2022

What is a combinatorial interpretation?

[BibT_eX]

[DOI]

CoRR, 2022

What is in #P and what is not?

[BibT_eX]

[DOI]

Christian Ikenmeyer

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Presburger Arithmetic with algebraic scalar multiplications.

[BibT_eX]

[DOI]

Philipp Hieronymi

Log. Methods Comput. Sci., 2021

On the Number of Integer Points in Translated and Expanded Polyhedra.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

Log-concave poset inequalities.

[BibT_eX]

[DOI]

CoRR, 2021

Sorting probability of Catalan posets.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2021

2020

Hidden Symmetries of Weighted Lozenge Tilings.

[BibT_eX]

[DOI]

Fedor Petrov

Electron. J. Comb., 2020

Counting Linear Extensions of Restricted Posets.

[BibT_eX]

[DOI]

Samuel J. Dittmer

Electron. J. Comb., 2020

2019

On the largest Kronecker and Littlewood-Richardson coefficients.

[BibT_eX]

[DOI]

Damir Yeliussizov

J. Comb. Theory A, 2019

Kirszbraun-type theorems for graphs.

[BibT_eX]

[DOI]

Nishant Chandgotia

Martin Tassy

J. Comb. Theory B, 2019

Limit Shapes via Bijections.

[BibT_eX]

[DOI]

Stephen Desalvo

Comb. Probab. Comput., 2019

Combinatorial inequalities.

[BibT_eX]

[DOI]

CoRR, 2019

VC-Dimensions of Short Presburger Formulas.

[BibT_eX]

[DOI]

Comb., 2019

2018

Why Is Pi Less Than Twice Phi?

[BibT_eX]

[DOI]

Am. Math. Mon., 2018

Enumerating Projections of Integer Points in Unbounded Polyhedra.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Hook formulas for skew shapes I. q-analogues and bijections.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2018

Asymptotics of the number of standard Young tableaux of skew shape.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Complexity problems in enumerative combinatorics.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Skyscraper polytopes and realizations of plane triangulations.

[BibT_eX]

[DOI]

Stedman Wilson

J. Comb. Theory B, 2017

Bounds on certain classes of Kronecker and q-binomial coefficients.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2017

VC-dimension of short Presburger formulas.

[BibT_eX]

[DOI]

CoRR, 2017

Complexity of short generating functions.

[BibT_eX]

[DOI]

CoRR, 2017

Lifts, derandomization, and diameters of Schreier graphs of Mealy automata.

[BibT_eX]

[DOI]

Anton Malyshev

Comb., 2017

On the complexity of computing Kronecker coefficients.

[BibT_eX]

[DOI]

Comput. Complex., 2017

Complexity of short Presburger arithmetic.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Enumeration of Integer Points in Projections of Unbounded Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Short Presburger Arithmetic Is Hard.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

The Computational Complexity of Integer Programming with Alternations.

[BibT_eX]

[DOI]

Proceedings of the 32nd Computational Complexity Conference, 2017

2016

Fast Domino Tileability.

[BibT_eX]

[DOI]

Adam Sheffer

Martin Tassy

Discret. Comput. Geom., 2016

On the Odd Area of Planar Sets.

[BibT_eX]

[DOI]

Assaf Oren

Rom Pinchasi

Discret. Comput. Geom., 2016

Permutation patterns are hard to count.

[BibT_eX]

[DOI]

Scott Garrabrant

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Pattern avoidance is not P-recursive.

[BibT_eX]

[DOI]

Scott Garrabrant

CoRR, 2015

On the Longest $k$-Alternating Subsequence.

[BibT_eX]

[DOI]

Robin Pemantle

Electron. J. Comb., 2015

2014

Generalized loop-erased random walks and approximate reachability.

[BibT_eX]

[DOI]

Igor Gorodezky

Random Struct. Algorithms, 2014

Cayley compositions, partitions, polytopes, and geometric bijections.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

The shape of random pattern-avoiding permutations.

[BibT_eX]

[DOI]

Sam Miner

Adv. Appl. Math., 2014

2013

Tiling simply connected regions with rectangles.

[BibT_eX]

[DOI]

Jed Yang

J. Comb. Theory A, 2013

Constructing Uniquely Realizable Graphs.

[BibT_eX]

[DOI]

Dan Vilenchik

Discret. Comput. Geom., 2013

A Quantitative Steinitz Theorem for Plane Triangulations.

[BibT_eX]

[DOI]

Stedman Wilson

CoRR, 2013

The Complexity of Generalized Domino Tilings.

[BibT_eX]

[DOI]

Jed Yang

Electron. J. Comb., 2013

2012

Collapsing Walls Theorem.

[BibT_eX]

[DOI]

Rom Pinchasi

Am. Math. Mon., 2012

Testing commutativity of a group and the power of randomization.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2012

Acute triangulations of polyhedra and ℝ N.

[BibT_eX]

[DOI]

Eryk Kopczynski

Piotr Przytycki

Comb., 2012

2011

The weighted hook length formula.

[BibT_eX]

[DOI]

Ionut Ciocan-Fontanine

J. Comb. Theory A, 2011

2010

Reductions of Young Tableau Bijections.

[BibT_eX]

[DOI]

Ernesto Vallejo

SIAM J. Discret. Math., 2010

Acute triangulations of polyhedra and the Euclidean space.

[BibT_eX]

[DOI]

Eryk Kopczynski

Piotr Przytycki

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Complexity of O'Hara's Algorithm.

[BibT_eX]

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009

Hamiltonian paths in Cayley graphs.

[BibT_eX]

[DOI]

Rados Radoicic

Discret. Math., 2009

Geometry and complexity of O'Hara's algorithm.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2009

2008

Inflating the Cube Without Stretching.

[BibT_eX]

[DOI]

Am. Math. Mon., 2008

Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings.

[BibT_eX]

[DOI]

Ezra Miller

Discret. Comput. Geom., 2008

2006

A combinatorial proof of the Rogers-Ramanujan and Schur identities.

[BibT_eX]

[DOI]

Cilanne Boulet

J. Comb. Theory A, 2006

2005

Combinatorics and geometry of Littlewood-Richardson cones.

[BibT_eX]

[DOI]

Ernesto Vallejo

Eur. J. Comb., 2005

The area of cyclic polygons: Recent progress on Robbins' conjectures.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2005

2004

Tilings of rectangles with T-tetrominoes.

[BibT_eX]

[DOI]

Michael Korn

Theor. Comput. Sci., 2004

Bijections for refined restricted permutations.

[BibT_eX]

[DOI]

Sergi Elizalde

J. Comb. Theory A, 2004

Partition congruences by involutions.

[BibT_eX]

[DOI]

Christine Bessenrodt

Eur. J. Comb., 2004

The nature of partition bijections I. Involutions.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

2003

Tile invariants: new horizons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

Ribbon Tile Invariants from the Signed Area.

[BibT_eX]

[DOI]

Cristopher Moore

J. Comb. Theory A, 2002

Mixing time and long paths in graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Expansion of product replacement graphs.

[BibT_eX]

[DOI]

Alexander Gamburd

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Percolation on Finite Cayley Graphs.

[BibT_eX]

[DOI]

Christopher Malon

Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

2001

On Growth of Grigorchuk Groups.

[BibT_eX]

[DOI]

Roman Muchnik

Int. J. Algebra Comput., 2001

On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes.

[BibT_eX]

[DOI]

Van H. Vu

Discret. Appl. Math., 2001

2000

Fast Constructive Recognition of a Black Box Group Isomorphic to Sn or An using Goldbach's Conjecture.

[BibT_eX]

[DOI]

Sergey Bratus

J. Symb. Comput., 2000

On the Number of Faces of Certain Transportation Polytopes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2000

Strong bias of group generators: an obstacle to the "product replacement algorithm".

[BibT_eX]

[DOI]

László Babai

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

The product replacement algorithm is polynomial.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

On Tilings by Ribbon Tetrominoes.

[BibT_eX]

[DOI]

Roman Muchnik

J. Comb. Theory A, 1999

Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees.

[BibT_eX]

[DOI]

Discret. Math., 1999

Lifting Markov Chains to Speed up Mixing.

[BibT_eX]

[DOI]

Fang Chen

László Lovász

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Using Stopping Times to Bound Mixing Times.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

On Sampling Generating Sets of Finite Groups and Product Replacement Algorithm (extended abstract).

[BibT_eX]

[DOI]

Sergey Bratus

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

Random Cayley Graphs with O(log[G]) Generators Are Expanders.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

A generalization of Sylvester's identity.

[BibT_eX]

[DOI]

Alexander Postnikov

Discret. Math., 1998

1997

A direct bijective proof of the hook-length formula.

[BibT_eX]

[DOI]

Jean-Christophe Novelli

Alexander V. Stoyanovskii

Discret. Math. Theor. Comput. Sci., 1997

When and how n choose k.

[BibT_eX]

[DOI]

Proceedings of the Randomization Methods in Algorithm Design, 1997

1996

Trees Associated with the Motzkin Numbers.

[BibT_eX]

[DOI]

Alexander Kuznetsov