Given an rc-graph R of permutation w and an rc-graph Y of permutation v, we provide an insertion algorithm, which defines an rc-graph R ← Y in the case when v is a shuffle with the descent at r and w has no descents greater than r or in the case when v is a shuffle, whose shape is a hook. This algorithm gives a combinatorial rule for computing the generalized Littlewood-Richardson coefficients ...

We investigate products J of ideals of “row initial” minors in the polynomial ring K [X ] defined by a generic m × n-matrix. The defining “shape” of J determines a set of “row initial” standard bitableaux that we call superstandard. They form a Gröbner basis of J , and J has a linear minimal free resolution. These results are used to derive a new generating set for the Grothendieck group of fin...

Abstract Phase equilibrium data ( $$p$$ p , $$T$$ T $$y$$ y ) for the binary systems of carbon dioxide + dimethyl carbonate and ethyl methyl were obtained. All measured isotherms ranging from 298.2 K to 328.2 with pressure between 0.13 MPa 10.6 MPa. A static technique was est...

We provide a combinatorial proof for the coincidence of Knuth equivalence classes, Kazhdan–Lusztig left cells and Vogan classes for the symmetric group, involving only Robinson-Schensted algorithm and the combinatorial part of the Kazhdan–Lusztig cell theory. The determination of Kazhdan–Lusztig cells for the symmetric group is given in the proof of [4, Thm1.4]. The argument is largely combinat...

Article history: Received 22 December 2010 Available online xxxx