Greta Panova

Comput. Complex., June, 2026

Soohak: A Mathematician-Curated Benchmark for Evaluating Research-level Math Capabilities of LLMs.

[BibT_eX]

[DOI]

Rafal Marcin Lochowski

CoRR, May, 2026

Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools.

[BibT_eX]

[DOI]

Alina Du

Steven Heilman

CoRR, May, 2026

Plethysm is in #BQP.

[BibT_eX]

[DOI]

CoRR, February, 2026

2025

The Newton polytope of the Kronecker product.

[BibT_eX]

[DOI]

Chenchen Zhao

Comb. Theory, 2025

Minimal skew semistandard tableaux and the Hillman-Grassl correspondence.

[BibT_eX]

[DOI]

Gayee Park

Adv. Appl. Math., 2025

2023

Effective Poset Inequalities.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2023

Chromatic symmetric functions of Dyck paths and q-rook theory.

[BibT_eX]

[DOI]

Laura Colmenarejo

Eur. J. Comb., 2023

Computational Complexity in Algebraic Combinatorics.

[BibT_eX]

[DOI]

CoRR, 2023

All Kronecker coefficients are reduced Kronecker coefficients.

[BibT_eX]

[DOI]

CoRR, 2023

Complexity and asymptotics of structure constants.

[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]

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

2022

Log-Concavity in Planar Random Walks.

[BibT_eX]

[DOI]

Comb., December, 2022

2021

Sorting probability of Catalan posets.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2021

2020

Counting Partitions inside a Rectangle.

[BibT_eX]

[DOI]

Stephen Melczer

Robin Pemantle

SIAM J. Discret. Math., 2020

2019

On the largest Kronecker and Littlewood-Richardson coefficients.

[BibT_eX]

[DOI]

Damir Yeliussizov

J. Comb. Theory A, 2019

On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions.

[BibT_eX]

[DOI]

Julian Dörfler

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Why Is Pi Less Than Twice Phi?

[BibT_eX]

[DOI]

Am. Math. Mon., 2018

Hook formulas for skew shapes I. <i>q</i>-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

LLT polynomials, chromatic quasisymmetric functions and graphs with cycles.

[BibT_eX]

[DOI]

Per Alexandersson

Discret. Math., 2018

A minimaj-preserving crystal on ordered multiset partitions.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2018

2017

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

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

[BibT_eX]

[DOI]

J. Comb. Theory A, 2017

Pfaffian Formulas for Spanning Tree Probabilities.

[BibT_eX]

[DOI]

David Bruce Wilson

Comb. Probab. Comput., 2017

On the complexity of computing Kronecker coefficients.

[BibT_eX]

[DOI]

Comput. Complex., 2017

2016

Geometric complexity theory and matrix powering.

[BibT_eX]

[DOI]

Fulvio Gesmundo

CoRR, 2016

Shape and pattern containment of separable permutations.

[BibT_eX]

Andrew Crites

Gregory S. Warrington

Ars Comb., 2016

Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory.

[BibT_eX]

[DOI]

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

No Occurrence Obstructions in Geometric Complexity Theory.

[BibT_eX]

[DOI]

Peter Bürgisser

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2014

Dyck tilings, increasing trees, descents, and inversions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

Schur Times Schubert via the Fomin-Kirillov Algebra.

[BibT_eX]

[DOI]

Karola Mészáros

Alexander Postnikov

Electron. J. Comb., 2014

2012

Tableaux and plane partitions of truncated shapes.

[BibT_eX]

[DOI]