The Algorithm Z and Ramanujan's $_1ψ_1$ Summation
We use the Algortihm Z on partitions due to Zeilberger, in a variant form, to give a combinatorial proof of Ramanujan's $_1ψ_1$ summation formula.
math.CO↗
arXiv subjects
William Y. C. Chen
Publications and source records attributed to William Y. C. Chen.
On Singletons and Adjacencies of Set Partitions of Type B
We show that the joint distribution of the number of singleton pairs and the number of adjacency pairs is symmetric over the set partitions of type $B_n$ without zero-block, in analogy with the result of Callan for ordinary partitions.
math.CO↗
An Operator Approach to the Al-Salam-Carlitz Polynomials
We present an operator approach to Rogers-type formulas and Mehler's formulas for the Al-Salam-Carlitz polynomials $U_n(x,y,a;q)$. By using the q-exponential operator, we obtain a Rogers-type formula which leads to a linearization formula. With the aid of a bivariate augmentation operator, we get a simple derivation of Mehler's formula due to by Al-Salam and Carlitz, which requires a terminating condition on a ${}_3ϕ_2$ series. By means of the Cauchy companion augmentation operator, we obtain Mehler's formula in a similar form, but it does not need the terminating condition. We also give several identities on the generating functions for products of the Al-Salam-Carlitz polynomials which are extensions of formulas for Rogers-Szegö polynomials.
math.CA↗
Congruences for the Number of Cubic Partitions Derived from Modular Forms
We obtain congruences for the number a(n) of cubic partitions using modular forms. The notion of cubic partitions is introduced by Chan and named by Kim in connection with Ramanujan's cubic continued fractions. Chan has shown that a(n) has several analogous properties to the number p(n) of partitions, including the generating function, the continued fraction, and congruence relations. To be more specific, we show that $a(25n+22)\equiv 0 ({\rm mod} 5)$, $a(49n+15) \equiv a(49n+29) \equiv a(49n+36) \equiv a(49n+43) \equiv 0 ({\rm mod} 7)$. Furthermore, we prove that a(n) takes infinitely many even values and infinitely odd values.
math.NT↗
On Balanced Colorings of the n-Cube
A 2-coloring of the n-cube in the n-dimensional Euclidean space can be considered as an assignment of weights of 1 or 0 to the vertices. Such a colored n-cube is said to be balanced if its center of mass coincides with its geometric center. Let $B_{n,2k}$ be the number of balanced 2-colorings of the n-cube with 2k vertices having weight 1. Palmer, Read and Robinson conjectured that for $n\geq 1$, the sequence $\{B_{n,2k}\}_{k=0, 1 ... 2^{n-1}}$ is symmetric and unimodal. We give a proof of this conjecture. We also propose a conjecture on the log-concavity of $B_{n,2k}$ for fixed k, and by probabilistic method we show that it holds when n is sufficiently large.
math.CO↗
Minimally Intersecting Set Partitions of Type B
Motivated by Pittel's study of minimally intersecting set partitions, we investigate minimally intersecting set partitions of type B. We find a formula for the number of minimally intersecting r-tuples of $B_n$-partitions, as well as a formula for the number of minimally intersecting r-tuples of $B_n$-partitions without zero-block. As a consequence, it follows the formula of Benoumhani for the Dowling number in analogy to Dobinski's formula.
math.CO↗
Identities Derived from Noncrossing Partitions of Type B
Based on weighted noncrossing partitions of type B, we obtain type B analogues of Coker's identities on the Narayana polynomials. A parity reversing involution is given for the alternating sum of Narayana numbers of type B. Moreover, we find type B analogues of the refinements of Coker's identities due to Chen, Deutsch and Elizalde. By combinatorial constructions, we provide type B analogues of three identities of Mansour and Sun also on the Narayana polynomials.
math.CO↗
The Extended Zeilberger's Algorithm with Parameters
For a hypergeometric series $\sum_k f(k,a, b, ...,c)$ with parameters $a, b, >...,c$, Paule has found a variation of Zeilberger's algorithm to establish recurrence relations involving shifts on the parameters. We consider a more general problem concerning several similar hypergeometric terms $f_1(k, a, b,..., c)$, $f_2(k, a,b, ..., c)$, $...$, $f_m(k, a, b, ..., c)$. We present an algorithm to derive a linear relation among the sums $\sum_k f_i(k,a,b,...,c)$ $(1\leq i \leq m)$. Furthermore, when the summand $f_i$ contains the parameter $x$, we can require that the coefficients be $x$-free. Such relations with $x$-free coefficients can be used to determine whether a polynomial sequence satisfies the three term recurrence and structure relations for orthogonal polynomials. The $q$-analogue of this approach is called the extended $q$-Zeilberger's algorithm, which can be employed to derive recurrence relations on the Askey-Wilson polynomials and the $q$-Racah polynomials.
math.CA↗
Mixed Statistics on 01-Fillings of Moon Polyominoes
We establish a stronger symmetry between the numbers of northeast and southeast chains in the context of 01-fillings of moon polyominoes. Let $\M$ be a moon polyomino with $n$ rows and $m$ columns. Consider all the 01-fillings of $\M$ in which every row has at most one 1. We introduce four mixed statistics with respect to a bipartition of rows or columns of $\M$. More precisely, let $S \subseteq \{1,2,..., n\}$ and $\mathcal{R}(S)$ be the union of rows whose indices are in $S$. For any filling $M$, the top-mixed (resp. bottom-mixed) statistic $α(S; M)$ (resp. $β(S; M)$) is the sum of the number of northeast chains whose top (resp. bottom) cell is in $\mathcal{R}(S)$, together with the number of southeast chains whose top (resp. bottom) cell is in the complement of $\mathcal{R}(S)$. Similarly, we define the left-mixed and right-mixed statistics $γ(T; M)$ and $δ(T; M)$, where $T$ is a subset of the column index set $\{1,2,..., m\}$. Let $λ(A; M)$ be any of these four statistics $α(S; M)$, $β(S; M)$, $γ(T; M)$ and $δ(T; M)$, we show that the joint distribution of the pair $(λ(A; M), λ(\bar A; M))$ is symmetric and independent of the subsets $S, T$. In particular, the pair of statistics $(λ(A;M), λ(\bar A; M))$ is equidistributed with $(\se(M),\ne(M))$, where $\se(M)$ and $\ne(M)$ are the numbers of southeast chains and northeast chains of $M$, respectively.
math.CO↗
Random $k$-noncrossing RNA Structures
In this paper we derive polynomial time algorithms that generate random $k$-noncrossing matchings and $k$-noncrossing RNA structures with uniform probability. Our approach employs the bijection between $k$-noncrossing matchings and oscillating tableaux and the $P$-recursiveness of the cardinalities of $k$-noncrossing matchings. The main idea is to consider the tableaux sequences as paths of stochastic processes over shapes and to derive their transition probabilities.
math.CO↗
A generalization of the brauer algebra
We study two variations of the Brauer algebra $B_n(x)$. The first is the algebra $A_n(x)$, which generalizes the Brauer algebra by considering loops. The second is the algebra $L_n(x)$, the $A_n(x)$-subalgebra generated by diagrams without horizontal arcs. $A_n(x)$ and $L_n(x)$ have for $x \neq 0$ an hereditary-chain indexed by all integers. Following the ideas of Martin in the context of the partition algebra, and Doran et al. for the Brauer algebra, we study semisimplicity of $A_n(x)$ using restriction and induction in $A_n(x)$ and $L_n(x)$. Our main result is that $A_n(x)$ is semisimple if $x \notin Z$ and that $L_n(x)$ is semisimple if $x \neq 0$.
math.CO↗
The Reverse Ultra Log-Concavity of the Boros-Moll Polynomials
We prove the reverse ultra log-concavity of the Boros-Moll polynomials. We further establish an inequality which implies the log-concavity of the sequence $\{i!d_i(m)\}$ for any $m\geq 2$, where $d_i(m)$ are the coefficients of the Boros-Moll polynomials $P_m(a)$. This inequality also leads to the fact that in the asymptotic sense, the Boros-Moll sequences are just on the borderline between ultra log-concavity and reverse ultra log-concavity. We propose two conjectures on the log-concavity and reverse ultra log-concavity of the sequence $\{d_{i-1}(m) d_{i+1}(m)/d_i(m)^2\}$ for $m\geq 2$.
math.CO↗
Families of Sets with Intersecting Clusters
A family of $k$-subsets $A_1, A_2, ..., A_d$ on $[n]=\{1,2,..., n\}$ is called a $(d, c)$-cluster if the union $A_1\cup A_2 \cup ... \cup A_d$ contains at most $ck$ elements with $c<d$. Let $\mathcal{F}$ be a family of $k$-subsets of an $n$-element set. We show that for $k \geq 2$ and $n \geq k+2$, if every $(k, 2)$-cluster of $\mathcal{F}$ is intersecting, then $\mathcal{F}$ contains no $(k-1)$-dimensional simplices. This leads to an affirmative answer to Mubayi's conjecture for $d=k$ based on Chvátal's simplex theorem. We also show that for any $d$ satisfying $3 \leq d \leq k$ and $n \geq \frac{dk}{d-1}$, if every $(d, {d+1\over 2})$-cluster is intersecting, then $|\mathcal{F}|\leq {{n-1} \choose {k-1}}$ with equality only when $ \mathcal{F}$ is a complete star. This result is an extension of both Frankl's theorem and Mubayi's theorem.
math.CO↗
A Proof of Moll's Minimum Conjecture
Let $d_i(m)$ denote the coefficients of the Boros-Moll polynomials. Moll's minimum conjecture states that the sequence $\{i(i+1)(d_i^2(m)-d_{i-1}(m)d_{i+1}(m))\}_{1\leq i \leq m}$ attains its minimum with $i=m$. This conjecture is a stronger than the log-concavity conjecture proved by Kausers and Paule. We give a proof of Moll's conjecture by utilizing the spiral property of the sequence $\{d_i(m)\}_{0\leq i \leq m}$, and the log-concavity of the sequence $\{i!d_i(m)\}_{0\leq i \leq m}$.
math.CO↗
The Ratio Monotonicity of the Boros-Moll Polynomials
In their study of a quartic integral, Boros and Moll discovered a special class of Jacobi polynomials, which we call the Boros-Moll polynomials. Kauers and Paule proved the conjecture of Moll that these polynomials are log-concave. In this paper, we show that the Boros-Moll polynomials possess the ratio monotone property which implies the log-concavity and the spiral property. We conclude with a conjecture which is stronger than Moll's conjecture on the $\infty$-log-concavity.
math.CO↗
Hook Length Formulas for Trees by Han's Expansion
Recently Han obtained a general formula for the weight function corresponding to the expansion of a generating function in terms of hook lengths of binary trees. In this paper, we present formulas for k-ary trees, plane trees, plane forests, labeled trees and forests. We also find appropriate generating functions which lead to unifications of the hook length formulas due to Du and Liu, Han, Gessel and Seo, and Postnikov.
math.CO↗
A Unification of Two Refinements of Euler's Partition Theorem
We obtain a unification of two refinements of Euler's partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodt's insertion algorithm for a generalization of the Andrews-Olsson partition identity is used in our combinatorial construction.
math.CO↗
Major Index for 01-Fillings of Moon Polyominoes
We propose a major index statistic on 01-fillings of moon polyominoes which, when specialized to certain shapes, reduces to the major index for permutations and set partitions. We consider the set F(M, s; A) of all 01-fillings of a moon polyomino M with given column sum s whose empty rows are A, and prove that this major index has the same distribution as the number of north-east chains, which are the natural extension of inversions (resp. crossings) for permutations (resp. set partitions). Hence our result generalizes the classical equidistribution results for the permutation statistics inv and maj. Two proofs are presented. The first is an algebraic one using generating functions, and the second is a bijection on 01-fillings of moon polyominoes in the spirit of Foata's second fundamental transformation on words and permutations.
math.CO↗