Related papers: Uncrowding algorithm for hook-valued tableaux
Refined canonical stable Grothendieck polynomials were introduced by Hwang, Jang, Kim, Song, and Song. There exist two combinatorial models for these polynomials: one using hook-valued tableaux and the other using pairs of a semistandard…
Lascoux polynomials generalize Grassmannian stable Grothendieck polynomials and may be viewed as K-theoretic analogs of key polynomials. The latter two polynomials have combinatorial formulas involving tableaux: Lascoux and…
Set-valued tableaux, introduced by Buch to express the tableaux-sum formula for stable Grothendieck polynomials, generalize semistandard tableaux. We provide a new recursive proof that the number of set-valued tableaux of a given shape is…
We introduce a new row insertion algorithm on decreasing tableaux and increasing tableaux, generalizing Edelman-Greene (EG) row insertion. Our row insertion algorithm is a nontrivial variation of Hecke column insertion which generalizes EG…
Graph clustering involves the task of dividing nodes into clusters, so that the edge density is higher within clusters as opposed to across clusters. A natural, classic and popular statistical setting for evaluating solutions to this…
We present a new family of hook-length formulas for the number of standard increasing tableaux which arise in the study of factorial Grothendieck polynomials. In the case of straight shapes our formulas generalize the classical hook-length…
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 give combinatorial proofs of two types of duality for Grothendieck polynomials by constructing a unified combinatorial framework incorporating set-valued tableaux, musltiset-valued tableaux, reverse plane partitions and valued-set…
The notion of set-valued Young tableaux was introduced by Buch in his study of the Littlewood-Richardson rule for stable Grothendieck polynomials. Knutson, Miller and Yong showed that the double Grothendieck polynomials of 2143-avoiding…
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…
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…
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…
In this article, we prove a tableau formula for the double Grothendieck polynomials associated to $321$-avoiding permutations. The proof is based on the compatibility of the formula with the $K$-theoretic divided difference operators.
We derive formulae for the number of set-valued standard tableaux of two-rowed shapes, keeping track of the total number of entries, the number of entries in the first row, and the number of entries in the second row. Key in the proofs is a…
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…
In recent years, there has been great interest in the study of categorification, specifically as it applies to the theory of quantum groups. In this thesis, we would like to provide a new approach to this problem by looking at Hall…
We give a $U_q(\mathfrak{sl}_n)$-crystal structure on multiset-valued tableaux, hook-valued tableaux, and valued-set tableaux, whose generating functions are the weak symmetric, canonical, and dual weak symmetric Grothendieck functions,…
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…
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…
Progressive Hedging is a popular decomposition algorithm for solving multi-stage stochastic optimization problems. A computational bottleneck of this algorithm is that all scenario subproblems have to be solved at each iteration. In this…