Related papers: Hook-valued tableau uncrowding and tableau switchi…
We use the hook lengths of a partition to define two rectangular tableaux. We prove these tableaux have equal multisets of entries, first by elementary combinatorial arguments, and then using Stanley's Hook Content Formula and symmetric…
In this article we make several contributions of independent interest. First, we introduce the notion of stressed hyperplane of a matroid, essentially a type of cyclic flat that permits to transition from a given matroid into another with…
We prove a formula for the structure sheaf of a quiver variety in the Grothendieck ring of its embedding variety. This formula generalizes and gives new expressions for Grothendieck polynomials. We furthermore conjecture that the…
We show that combinatorial objects called row-strict composition tableaux, introduced by Mason and Remmel in 2014 and closely related to the quasi-symmetric Schur functions of Haglund-Luoto-Mason-van Willigenburg, form a basis for Schur…
We introduce tableau stabilization, a new phenomenon and statistic on Young tableaux based on jeu de taquin. We investigate bounds for tableau stabilization, the shape of stabilized tableaux, and tableau stabilization as a permutation…
The Grothendieck ring of varieties has well-known realization maps to, say, mixed Hodge structures or compactly supported $\ell$-adic cohomology. Zakharevich and\ Campbell have developed {a spectral refinement} of the Grothendieck ring of…
We introduce families of two-parameter multivariate polynomials indexed by pairs of partitions $v,w$ -- biaxial double $(\beta,q)$-Grothendieck polynomials -- which specialize at $q=0$ and $v=1$ to double $\beta$-Grothendieck polynomials…
Many algorithms for inserting elements into tableaux are known, starting with the Robinson-Schensted algorithm. Much of those processes can be incorporated into the general framework of Fomin's "growth diagrams". Even for single types of…
The M-polynomial, introduced by Deutsch and Klav\v{z}ar in 2015, provides a unifying algebraic framework for the computation of numerous degree-based topological indices such as the Zagreb, Randic, harmonic, and forgotten indices. Despite…
We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our…
Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…
We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…
We develop a theory of multigraded (i.e., $N^l$-graded) combinatorial Hopf algebras modeled on the theory of graded combinatorial Hopf algebras developed by Aguiar, Bergeron, and Sottile [Compos. Math. 142 (2006), 1--30]. In particular we…
We introduce a new basis for the polynomial ring which lifts the complete homogeneous symmetric polynomials while retaining representation theoretic significance. Using a specialized RSK algorithm we give an explicit nonnegative expansion…
We generalize the work of Fomin, Greene, Reiner, and Shimozono on balanced labellings in two directions: (1) we define the diagrams of affine permutations and the balanced labellings on them; (2) we define the set-valued version of the…
We derive new matrix representation for higher order Daehee numbers and polynomials, the higher order lambda-Daehee numbers and polynomials and the twisted lambda-Daehee numbers and polynomials of order k. This helps us to obtain simple and…
The symmetric Grothendieck polynomials representing Schubert classes in the $K$-theory of Grassmannians are generating functions for semistandard set-valued tableaux. We construct a type $A_n$ crystal structure on these tableaux. This…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…
We investigate two classes of multivariate polynomials with variables indexed by the edges of a uniform hypergraph and coefficients depending on certain patterns of union of edges. These polynomials arise naturally to model job-occupancy in…