Related papers: Hook-valued tableau uncrowding and tableau switchi…

We develop a theory of Jacobi polynomials for parabolic subgroups of finite reflection groups that specializes to the cases studied by Heckman and Opdam in which the whole group and the trivial group are considered. For the intermediate…

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…

Randomized numerical linear algebra is proved to bridge theoretical advancements to offer scalable solutions for approximating tensor decomposition. This paper introduces fast randomized algorithms for solving the fixed Tucker-rank problem…

Set-valued tableaux formulas play an important role in Schubert calculus. Using the box greedy reduced word for the construction of the Macdonald polynomials, we convert the alcove walk formula for Macdonald polynomials to a set-valued…

We compute an analogue of Pascal's triangle enriched in bilinear forms over a finite field. This gives an arithmetically meaningful count of the ways to choose $j$ ring homomorphisms into an algebraic closure from an \'etale extension of…

We prove an explicit formula for the Poincar\'e polynomials of parabolic character varieties of Riemann surfaces with semisimple local monodromies, which was conjectured by Hausel, Letellier and Rodriguez-Villegas. Using an approach of…

Tropical refined invariants of toric surfaces constitute a fascinating interpolation between real and complex enumerative geometries via tropical geometry. They were originally introduced by Block and G\"ottsche, and further extended by…

To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…

Limiting cases are studied of the Koornwinder-Macdonald multivariable generalization of the Askey-Wilson polynomials. We recover recently and not so recently introduced families of hypergeometric orthogonal polynomials in several variables…

We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…

We prove that the well-known condition of being a balanced labeling can be characterized in terms of the sliding algorithm on tower diagrams. The characterization involves a generalization of authors' Rothification algorithm. Using the…

We give a new combinatorial interpretation of Howe dual pairs of the form $(\g,{\rm Sp}_{2\ell})$, where $\g$ is a Lie (super)algebra of classical type. This is done by establishing a symplectic analogue of the RSK algorithm associated to…

Higher-order graph neural networks (HOGNNs) and the related architectures from Topological Deep Learning are an important class of GNN models that harness polyadic relations between vertices beyond plain edges. They have been used to…

For their bijective proof of the hook-length formula for the number of standard tableaux of a fixed shape Novelli, Pak and Stoyanovskii define a modified jeu de taquin which transforms an arbitrary filling of the Ferrers diagram with…

Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells may contain more than one integer, with the added conditions that every integer at position $(i,j)$ must be smaller than every integer at…

The dual stable Grothendieck polynomials are a deformation of the Schur functions, originating in the study of the K-theory of the Grassmannian. We generalize these polynomials by introducing a countable family of additional parameters, and…

This paper concerns a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey--Wilson polynomials, however, their purely combinatorial properties…

We derive explicit formulae for the generating series of mixed Grothendieck dessins d'enfant/monotone/simple Hurwitz numbers, via the semi-infinite wedge formalism. This reveals the strong piecewise polynomiality in the sense of…

We define and study the Plancherel-Hecke probability measure on Young diagrams; the Hecke algorithm of [Buch-Kresch-Shimozono-Tamvakis-Yong '06] is interpreted as a polynomial-time exact sampling algorithm for this measure. Using the…

We extend some classical results - such as Quillen's Theorem A, the Grothendieck construction, Thomason's Theorem and the characterisation of homotopically cofinal functors - from the homotopy theory of small categories to polynomial monads…