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

The classical hook length formula counts the number of standard tableaux of straight shapes. In 1996, Okounkov and Olshanski found a positive formula for the number of standard Young tableaux of a skew shape. We prove various properties of…

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

J. DeLoera-T. McAllister and K. D. Mulmuley-H. Narayanan-M. Sohoni independently proved that determining the vanishing of Littlewood-Richardson coefficients has strongly polynomial time computational complexity. Viewing these as Schubert…

The study of representations of affine Hecke algebras has led to a new notion of shapes and standard Young tableaux which works for the root system of any finite Coxeter group. This paper is completely independent of affine Hecke algebra…

The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators…

We introduce a theory of jeu de taquin for increasing tableaux, extending fundamental work of [Sch\"{u}tzenberger '77] for standard Young tableaux. We apply this to give a new combinatorial rule for the K-theory Schubert calculus of…

In 1996, Knop and Sahi introduced a remarkable family of inhomogeneous symmetric polynomials, defined via vanishing conditions, whose top homogeneous parts are exactly the Macdonald polynomials. Like the Macdonald polynomials, these…

We introduce G{\aa}rding polynomials, a class of real multivariate polynomials characterized by positivity regions that are invariant under translation by positive vectors and closed under strictly positive affine transformations. We prove…

Recently Blasiak gave a combinatorial rule for the Kronecker coefficient $g_{\lambda \mu \nu}$ when $\mu$ is a hook shape by defining a set of colored Yamanouchi tableaux with cardinality $g_{\lambda\mu\nu}$ in terms of a process called…

We study a Grothendieck topology on schemes which we call the $\mathrm{arc}$-topology. This topology is a refinement of the $v$-topology (the pro-version of Voevodsky's $h$-topology) where covers are tested via rank $\leq 1$ valuation…

This paper initiates a systematic study of connections between undirected colored graphs and associated two-variable stable polynomials obtained via Cauchy transform-type formulas. Examples of such stable polynomials have played crucial…

Gouezel and Sarig introduced operator renewal theory as a method to prove sharp results on polynomial decay of correlations for certain classes of nonuniformly expanding maps. In this paper, we apply the method to planar dispersing…

Grothendieck's theory of dessins provides a bridge between algebraic numbers and combinatorics. This paper adds a new concept, called 'bias', to the bridge. This produces: (i) from a biased plane tree the construction of a sequence of…

We develop a theory of polymatroids on Stallings core graphs, which provides a new technique for proving lower bounds on stable invariants of words and subgroups in free groups $F$, and for upper bounds on their probability for mapping,…

We present explicit formulas for the Macdonald polynomials of types $C_n$ and $D_n$ in the one-row case. In view of the combinatorial structure, we call them "tableau formulas". For the construction of the tableau formulas, we apply some…

In this work we study orthogonal polynomials via polynomial mappings in the framework of the $H_q-$semiclassical class. We consider two monic orthogonal polynomial sequences $\{p_n (x)\}_{n\geq0}$ and $\{q_n(x)\}_{n\geq0}$ such that $$…

Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…

We give a uniform construction of irreducible polynomial representations of all classical groups, including spin groups, using semistandard domino tableaux. We also give an explicit decomposition of the homogeneous coordinate ring of the…

An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…

We present a randomized algorithm for generating standard set-valued tableaux by extending the Green-Nijenhuis-Wilf hook walk algorithm. In the case of asymptotically rank two partitions, we use this algorithm to give a fully polynomial…