By generalizing Gessel-Xin’s Laurent series method for proving the Zeilberger-Bressoud q-Dyson Theorem, we establish a family of q-Dyson style constant term identities. These identities give explicit… (More)

In this paper, the closed-form expressions for the coefficients of x 2 r x 2 s and x 2 r xsxt in the Dyson product are found by applying an extension of Good's idea. As consequences, we find several… (More)

We introduce an elementary method to give unified proofs of the Dyson, Morris, and Aomoto identities for constant terms of Laurent polynomials. These identities can be expressed as equalities of… (More)

We introduce an elementary method using only property of polynomials to give unified proofs of the Dyson, Morris, and Aomoto constant term identities. Such constant terms are polynomial in one… (More)

Based on the classic bijective algorithm for trees due to Chen, we present a decomposition algorithm for noncrossing trees. This leads to a combinatorial interpretation of a formula on noncrossing… (More)

Tree structures play an important role in computer science. For instance, the binary tree is a fundamental data structure for rapidly storing sorted data and rapidly retrieving stored data. In this… (More)

2016 9th International Symposium on Computational…

2016

Notations and techniques from discrete mathematics play an important role in computer science. In this paper, by applying the concatenation of some restricted lattice paths, we derive the… (More)

We give a characterization of matchings in terms of the canonical reduced decompositions. As an application, the canonical reduced decompositions of 12312avoiding matchings are obtained. Based on… (More)