Searcharxiv⌕ Search

arXiv subjects

Larry X. W. Wang

Publications and source records attributed to Larry X. W. Wang.

14 recordsLinked to original sources

Higher Order Turán Inequalities for the Partition Function

The Turán inequalities and the higher order Turán inequalities arise in the study of Maclaurin coefficients of an entire function in the Laguerre-Pólya class. A real sequence $\{a_{n}\}$ is said to satisfy the Turán inequalities if for $n\geq 1$, $a_n^2-a_{n-1}a_{n+1}\geq 0$. It is said to satisfy the higher order Turán inequalities if for $n\geq 1$, $4(a_{n}^2-a_{n-1}a_{n+1})(a_{n+1}^2-a_{n}a_{n+2})-(a_{n}a_{n+1}-a_{n-1}a_{n+2})^2\geq 0$. A sequence satisfying the Turán inequalities is also called log-concave. For the partition function $p(n)$, DeSalvo and Pak showed that for $n>25$, the sequence $\{ p(n)\}_{n> 25}$ is log-concave, that is, $p(n)^2-p(n-1)p(n+1)>0$ for $n> 25$. It was conjectured by Chen that $p(n)$ satisfies the higher order Turán inequalities for $n\geq 95$. In this paper, we prove this conjecture by using the Hardy-Ramanujan-Rademacher formula to derive an upper bound and a lower bound for $p(n+1)p(n-1)/p(n)^2$. Consequently, for $n\geq 95$, the Jensen polynomials $g_{3,n-1}(x)=p(n-1)+3p(n)x+3p(n+1)x^2+p(n+2)x^3$ have only real zeros. We conjecture that for any positive integer $m\geq 4$ there exists an integer $N(m)$ such that for $n\geq N(m) $, the polynomials $\sum_{k=0}^m {m\choose k}p(n+k)x^k$ have only real zeros. This conjecture was independently posed by Ono.

math.CO↗

Finite Differences of the Logarithm of the Partition Function

Let $p(n)$ denote the partition function. DeSalvo and Pak proved that $\frac{p(n-1)}{p(n)}\left(1+\frac{1}{n}\right)> \frac{p(n)}{p(n+1)}$ for $n\geq 2$, as conjectured by Chen. Moreover, they conjectured that a sharper inequality $\frac{p(n-1)}{p(n)}\left( 1+\fracπ{\sqrt{24}n^{3/2}}\right) > \frac{p(n)}{p(n+1)}$ holds for $n\geq 45$. In this paper, we prove the conjecture of Desalvo and Pak by giving an upper bound for $-Δ^{2} \log p(n-1)$, where $Δ$ is the difference operator with respect to $n$. We also show that for given $r\geq 1$ and sufficiently large $n$, $(-1)^{r-1}Δ^{r} \log p(n)>0$. This is analogous to the positivity of finite differences of the partition function. It was conjectured by Good and proved by Gupta that for given $r\geq 1$, $Δ^{r} p(n)>0$ for sufficiently large $n$.

math.NT↗

Average Size of a Self-conjugate (s, t)-Core Partition

Armstrong, Hanusa and Jones conjectured that if $s,t$ are coprime integers, then the average size of an $(s,t)$-core partition and the average size of a self-conjugate $(s,t)$-core partition are both equal to $\frac{(s+t+1)(s-1)(t-1)}{24}$. Stanley and Zanello showed that the average size of an $(s,s+1)$-core partition equals $\binom{s+1}{3}/2$. Based on a bijection of Ford, Mai and Sze between self-conjugate $(s,t)$-core partitions and lattice paths in $\lfloor \frac{s}{2} \rfloor\times \lfloor \frac{t}{2}\rfloor$ rectangle, we obtain the average size of a self-conjugate $(s,t)$-core partition as conjectured by Armstrong, Hanusa and Jones.

math.CO↗

Zeta Functions and the Log-behavior of Combinatorial Sequences

In this paper, we use the Riemann zeta function $ζ(x)$ and the Bessel zeta function $ζ_μ(x)$ to study the log-behavior of combinatorial sequences. We prove that $ζ(x)$ is log-convex for $x>1$. As a consequence, we deduce that the sequence $\{|B_{2n}|/(2n)!\}_{n\geq 1}$ is log-convex, where $B_n$ is the $n$-th Bernoulli number. We introduce the function $θ(x)=(2ζ(x)Γ(x+1))^{\frac{1}{x}}$, where $Γ(x)$ is the gamma function, and we show that $\log θ(x)$ is strictly increasing for $x\geq 6$. This confirms a conjecture of Sun stating that the sequence $\{\sqrt[n] {|B_{2n}}|\}_{n\geq 1}$ is strictly increasing. Amdeberhan, Moll and Vignat defined the numbers $a_n(μ)=2^{2n+1}(n+1)!(μ+1)_nζ_μ(2n)$ and conjectured that the sequence $\{a_n(μ)\}_{n\geq 1}$ is log-convex for $μ=0$ and $μ=1$. By proving that $ζ_μ(x)$ is log-convex for $x>1$ and $μ>-1$, we show that the sequence $\{a_n(μ)\}_{n\geq 1}$ is log-convex for any $μ>-1$. We introduce another function $θ_μ(x)$ involving $ζ_μ(x)$ and the gamma function $Γ(x)$ and we show that $\log θ_μ(x)$ is strictly increasing for $x>8e(μ+2)^2$. This implies that $\sqrt[n]{a_n(μ)}<\sqrt[n+1]{a_{n+1}(μ)}$ for $n> 4e(μ+2)^2$. Based on Dobinski's formula, we prove that $\sqrt[n]{B_n}<\sqrt[n+1]{B_{n+1}}$ for $n\geq 1$, where $B_n$ is the $n$-th Bell number. This confirms another conjecture of Sun. We also establish a connection between the increasing property of $\{\sqrt[n]{B_n}\}_{n\geq 1}$ and Hölder's inequality in probability theory.

math.CO↗

Infinitely Log-monotonic Combinatorial Sequences

We introduce the notion of infinitely log-monotonic sequences. By establishing a connection between completely monotonic functions and infinitely log-monotonic sequences, we show that the sequences of the Bernoulli numbers, the Catalan numbers and the central binomial coefficients are infinitely log-monotonic. In particular, if a sequence $\{a_n\}_{n\geq 0}$ is log-monotonic of order two, then it is ratio log-concave in the sense that the sequence $\{a_{n+1}/a_{n}\}_{n\geq 0}$ is log-concave. Furthermore, we prove that if a sequence $\{a_n\}_{n\geq k}$ is ratio log-concave, then the sequence $\{\sqrt[n]{a_n}\}_{n\geq k}$ is strictly log-concave subject to a certain initial condition. As consequences, we show that the sequences of the derangement numbers, the Motzkin numbers, the Fine numbers, the central Delannoy numbers, the numbers of tree-like polyhexes and the Domb numbers are ratio log-concave. For the case of the Domb numbers $D_n$, we confirm a conjecture of Sun on the log-concavity of the sequence $\{\sqrt[n]{D_n}\}_{n\geq 1}$.

math.CO↗

Interlacing Log-concavity of the Boros-Moll Polynomials

We introduce the notion of interlacing log-concavity of a polynomial sequence $\{P_m(x)\}_{m\geq 0}$, where $P_m(x)$ is a polynomial of degree m with positive coefficients $a_{i}(m)$. This sequence of polynomials is said to be interlacing log-concave if the ratios of consecutive coefficients of $P_m(x)$ interlace the ratios of consecutive coefficients of $P_{m+1}(x)$ for any $m\geq 0$. Interlacing log-concavity is stronger than the log-concavity. We show that the Boros-Moll polynomials are interlacing log-concave. Furthermore we give a sufficient condition for interlacing log-concavity which implies that some classical combinatorial polynomials are interlacing log-concave.

math.CO↗

Balanced Properties of the q-Derangement Numbers and the q-Catalan Numbers

Based on Bona's condition for the balanced property of the number of cycles of permutations, we give a general criterion for the balanced property in terms of the generating function of a statistic. We show that the q-derangement numbers and the q-Catalan numbers satisfy the balanced property.

math.CO↗

Higher Order Log-Concavity in Euler's Difference Table

Let $e_{n}^k$ be the entries in the classical Euler's difference table. We consider the array $d_{n}^{k}=e_n^k/k!$ for $0\leq k \leq n$, where $d_n^k$ can be interpreted as the number of k-fixed-points-permutations of [n]. We show that the sequence $\{d_n^k\}_{0\leq k\leq n}$ is 2-log-concave and reverse ultra log-concave for any given n.

math.CO↗

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↗

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↗

The q-Log-convexity of the Generating Functions of the Squares of Binomial Coefficients

We prove a conjecture of Liu and Wang on the q-log-convexity of the polynomial sequence $\{\sum_{k=0}^n{n\choose k}^2q^k\}_{n\geq 0}$. By using Pieri's rule and the Jacobi-Trudi identity for Schur functions, we obtain an expansion of a sum of products of elementary symmetric functions in terms of Schur functions with nonnegative coefficients. Then the principal specialization leads to the q-log-convexity. We also prove that a technical condition of Liu and Wang holds for the squares of the binomial coefficients. Hence we deduce that the linear transformation with respect to the triangular array $\{{n\choose k}^2\}_{0\leq k\leq n}$ is log-convexity preserving.

math.CO↗

Recurrence Relations for Strongly q-Log-Convex Polynomials

We consider a class of strongly q-log-convex polynomials based on a triangular recurrence relation with linear coefficients, and we show that the Bell polynomials, the Bessel polynomials, the Ramanujan polynomials and the Dowling polynomials are strongly q-log-convex. We also prove that the Bessel transformation preserves log-convexity.

math.CO↗

Schur Positivity and the $q$-Log-convexity of the Narayana Polynomials

Using Schur positivity and the principal specialization of Schur functions, we provide a proof of a recent conjecture of Liu and Wang on the $q$-log-convexity of the Narayana polynomials, and a proof of the second conjecture that the Narayana transformation preserves the log-convexity. Based on a formula of Bränd$\mathrm{\acute{e}}$n which expresses the $q$-Narayana numbers as the specializations of Schur functions, we derive several symmetric function identities using the Littlewood-Richardson rule for the product of Schur functions, and obtain the strong $q$-log-convexity of the Narayana polynomials and the strong $q$-log-concavity of the $q$-Narayana numbers.

math.CO↗

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↗