Searcharxiv⌕ Search

arXiv subjects

William Y. C. Chen

Publications and source records attributed to William Y. C. Chen.

At least 145 records · Page 8Linked to original sources
arXiv2007

Derangements and Relative Derangements of Type $B$

By introducing the notion of relative derangements of type $B$, also called signed relative derangements, which are defined in terms of signed permutations, we obtain a type $B$ analogue of the well-known relation between relative derangements and the classical derangements. While this fact can be proved by using the principle of inclusion and exclusion, we present a combinatorial interpretation with the aid of the intermediate structure of signed skew derangements.

math.CO↗
arXiv2007

The Limiting Distribution of the Coefficients of the $q$-Catalan Numbers

We show that the limiting distributions of the coefficients of the $q$-Catalan numbers and the generalized $q$-Catalan numbers are normal. Despite the fact that these coefficients are not unimodal for small $n$, we conjecture that for sufficiently large $n$, the coefficients are unimodal and even log-concave except for a few terms of the head and tail.

math.CO↗
arXiv2007

The Bivariate Rogers-Szegö Polynomials

We present an operator approach to deriving Mehler's formula and the Rogers formula for the bivariate Rogers-Szegö polynomials $h_n(x,y|q)$. The proof of Mehler's formula can be considered as a new approach to the nonsymmetric Poisson kernel formula for the continuous big $q$-Hermite polynomials $H_n(x;a|q)$ due to Askey, Rahman and Suslov. Mehler's formula for $h_n(x,y|q)$ involves a ${}_3ϕ_2$ sum and the Rogers formula involves a ${}_2ϕ_1$ sum. The proofs of these results are based on parameter augmentation with respect to the $q$-exponential operator and the homogeneous $q$-shift operator in two variables. By extending recent results on the Rogers-Szegö polynomials $h_n(x|q)$ due to Hou, Lascoux and Mu, we obtain another Rogers-type formula for $h_n(x,y|q)$. Finally, we give a change of base formula for $H_n(x;a|q)$ which can be used to evaluate some integrals by using the Askey-Wilson integral.

math.CO↗
arXiv2007

On the Bilateral Series $_2ψ_2$

We obtain a formula which reduces the evaluation of a $_2ψ_2$ series to two $_2ϕ_1$ series. In some sense, this identity may be considered as a companion of Slater's formulas. We also find that a two-term ${}_2ψ_2$ summation formula due to Slater can be derived from a unilateral summation formula of Andrews by bilateral extension and parameter augmentation.

math.CO↗
arXiv2006

Linked Partitions and Linked Cycles

The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which counts the number of Schroder paths. In this paper we give a bijective proof of this result. Then we introduce the structures of linked partitions and linked cycles. We present various combinatorial properties of noncrossing linked partitions, linked partitions, and linked cycles, and connect them to other combinatorial structures and results, including increasing trees, partial matchings, k-Stirling numbers of the second kind, and the symmetry between crossings and nestings over certain linear graphs.

math.CO↗
arXiv2006

The Abel Lemma and the q-Gosper Algorithm

Chu has recently shown that the Abel lemma on summations by parts can serve as the underlying relation for Bailey's ${}_6ψ_6$ bilateral summation formula. In other words, the Abel lemma spells out the telescoping nature of the ${}_6ψ_6$ sum. We present a systematic approach to compute Abel pairs for bilateral and unilateral basic hypergeometric summation formulas by using the $q$-Gosper algorithm. It is demonstrated that Abel pairs can be derived from Gosper pairs. This approach applies to many classical summation formulas.

math.CO↗
arXiv2006

Labeled Partitions and the q-Derangement Numbers

By a re-examination of MacMahon's original proof of his celebrated theorem on the distribution of the major indices over permutations, we give a reformulation of his argument in terms of the structure of labeled partitions. In this framework, we are able to establish a decomposition theorem for labeled partitions that leads to a simple bijective proof of Wachs' formula on the q-derangement numbers.

math.CO↗
arXiv2006

BG-ranks and 2-cores

We find the number of partitions of $n$ whose BG-rank is $j$, in terms of $pp(n)$, the number of pairs of partitions whose total number of cells is $n$, giving both bijective and generating function proofs. Next we find congruences mod 5 for $pp(n)$, and then we use these to give a new proof of a refined system of congruences for $p(n)$ that was found by Berkovich and Garvan.

math.CO↗
arXiv2006

Riordan Paths and Derangements

Riordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a correspondence between Riordan paths and $(321,3\bar{1}42)$-avoiding derangements. We also present a combinatorial proof of a recurrence relation for the Riordan numbers in the spirit of the Foata-Zeilberger proof of a recurrence relation on the Schröder numbers.

math.CO↗
arXiv2005

Crossings and Nestings of Matchings and Partitions

We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block elements, the crossing number and the nesting number of partitions have a symmetric joint distribution. It follows that the crossing numbers and the nesting numbers are distributed symmetrically over all partitions of $[n]$, as well as over all matchings on $[2n]$. As a corollary, the number of $k$-noncrossing partitions is equal to the number of $k$-nonnesting partitions. The same is also true for matchings. An application is given to the enumeration of matchings with no $k$-crossing (or with no $k$-nesting).

math.CO↗
arXiv2005

A Telescoping method for Double Summations

We present a method to prove hypergeometric double summation identities. Given a hypergeometric term $F(n,i,j)$, we aim to find a difference operator $ L=a_0(n) N^0 + a_1(n) N^1 +...+a_r(n) N^r $ and rational functions $R_1(n,i,j),R_2(n,i,j)$ such that $ L F = Δ_i (R_1 F) + Δ_j (R_2 F)$. Based on simple divisibility considerations, we show that the denominators of $R_1$ and $R_2$ must possess certain factors which can be computed from $F(n, i,j)$. Using these factors as estimates, we may find the numerators of $R_1$ and $R_2$ by guessing the upper bounds of the degrees and solving systems of linear equations. Our method is valid for the Andrews-Paule identity, Carlitz's identities, the Apéry-Schmidt-Strehl identity, the Graham-Knuth-Patashnik identity, and the Petkovšek-Wilf-Zeilberger identity.

math.CO↗
arXiv2005

The Butterfly Decomposition of Plane Trees

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one correspondence between doubly rooted plane trees and free Dyck paths, which implies a simple derivation of a relation between the Catalan numbers and the central binomial coefficients. We also establish a one-to-one correspondence between leaf-colored doubly rooted plane trees and free Schröder paths. The classical Chung-Feller theorem on free Dyck paths and some generalizations and variations with respect to Dyck paths and Schröder paths with flaws turn out to be immediate consequences of the butterfly decomposition and the preorder traversal of plane trees. We obtain two involutions on free Dyck paths and free Schröder paths, leading to two combinatorial identities. We also use the butterfly decomposition to give a combinatorial treatment of the generating function for the number of chains in plane trees due to Klazar. We further study the average size of chains in plane trees with $n$ edges and show that this number asymptotically tends to ${n+9 \over 6}$.

math.CO↗
arXiv2005

Weighted Forms of Euler's Theorem

In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan's "Lost" Notebook, we obtain weighted forms of Euler's theorem on partitions with odd parts and distinct parts. This work is inspired by the insight of Andrews on the connection between Ramanujan's identities and Euler's theorem. Our combinatorial formulations of Ramanujan's identities rely on the notion of rooted partitions. Iterated Dyson's map and Sylvester's bijection are the main ingredients in the weighted forms of Euler's theorem.

math.CO↗
arXiv2005

Noncrossing Trees and Noncrossing Graphs

We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of Panholzer and Prodinger for noncrossing trees and find a correspondence between a class of noncrossing trees, called proper oncrossing trees, and the set of symmetric ternary trees. The second result of this paper is a parity reversing involution on connected noncrossing graphs which leads to a relation between the number of noncrossing trees with a given number of edges and descents and the number of connected noncrossing graphs with a given number of vertices and edges.

math.CO↗
arXiv2005

Nonterminating Basic Hypergeometric Series and the $q$-Zeilberger Algorithm

We present a systematic method for proving nonterminating basic hypergeometric identities. Assume that $k$ is the summation index. By setting a parameter $x$ to $xq^n$, we may find a recurrence relation of the summation by using the $q$-Zeilberger algorithm. This method applies to almost all nonterminating basic hypergeometric summation formulas in the book of Gasper and Rahman. Furthermore, by comparing the recursions and the limit values, we may verify many classical transformation formulas, including the Sears-Carlitz transformation, transformations of the very-well-poised $_8ϕ_7$ series, the Rogers-Fine identity, and the limiting case of Watson's formula that implies the Rogers-Ramanujan identities.

math.CO↗
arXiv2005

Matrix Identities on Weighted Partial Motzkin Paths

We give a combinatorial interpretation of a matrix identity on Catalan numbers and the sequence $(1, 4, 4^2, 4^3, ...)$ which has been derived by Shapiro, Woan and Getu by using Riordan arrays. By giving a bijection between weighted partial Motzkin paths with an elevation line and weighted free Motzkin paths, we find a matrix identity on the number of weighted Motzkin paths and the sequence $(1, k, k^2, k^3, ...)$ for any $k \geq 2$. By extending this argument to partial Motzkin paths with multiple elevation lines, we give a combinatorial proof of an identity recently obtained by Cameron and Nkwanta. A matrix identity on colored Dyck paths is also given, leading to a matrix identity for the sequence $(1, t^2+t, (t^2+t)^2, ...)$.

math.CO↗
arXiv2005

Stanley's Zrank Problem on Skew Partitions

We present an affirmative answer to Stanley's zrank problem, namely, the zrank and rank are equal for any skew partition. We show that certain classes of restricted Cauchy matrices are nonsingular and furthermore, the signs depend on the number of zero entries. Similar to notion of the jrank of a skew partition, we give a characterization of the rank in terms of the Giambelli type matrices of the corresponding skew Schur functions. We also show that the sign of the determinant of a factorial Cauchy matrix is uniquely determined by the number of its zero entries, which implies the nonsingularity of the inverse binomial coefficient matrix.

math.CO↗