arXiv subjects

Ali K. Uncu

Publications and source records attributed to Ali K. Uncu.

22 records · Page 2Linked to original sources

arXiv2019

Polynomial Identities Implying Capparelli's Partition Theorems

We propose and recursively prove polynomial identities which imply Capparelli's partition theorems. We also find perfect companions to the results of Andrews, and Alladi, Andrews and Gordon involving $q$-trinomial coefficients. We follow Kurşungöz's ideas to provide direct combinatorial interpretations of some of our expressions. We use of the trinomial analogue of Bailey's lemma to derive new identities. These identities relate triple sums and products. A couple of new Slater type identities are also noted.

math.NT↗

arXiv2018

Elementary Polynomial Identities Involving $q$-Trinomial Coefficients

We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial identities, which imply Capparelli's partition theorems when the degree of the polynomial tends to infinity. This way we also obtain an interesting new result for the sum of the Capparelli's products. We finish this paper by proposing an infinite hierarchy of polynomial identities.

math.NT↗

arXiv2017

On some polynomials and series of Bloch-Polya Type

We will show that $(1-q)(1-q^2)\dots (1-q^m)$ is a polynomial in $q$ with coefficients from $\{-1,0,1\}$ iff $m=1,\ 2,\ 3,$ or $5$ and explore some interesting consequences of this result. We find explicit formulas for the $q$-series coefficients of $(1-q^2)(1-q^3)(1-q^4)(1-q^5)\dots$ and $(1-q^3)(1-q^4)(1-q^5)(1-q^6)\dots$. In doing so, we extend certain observations made by Sudler in 1964. We also discuss the classification of the products $(1-q)(1-q^2)\dots (1-q^m)$ and some related series with respect to their absolute largest coefficients.

math.NT↗

arXiv2017

Some Elementary Partition Inequalities and Their Implications

We prove various inequalities between the number of partitions with the bound on the largest part and some restrictions on occurrences of parts. We explore many interesting consequences of these partition inequalities. In particular, we show that for $L\geq 1$, the number of partitions with $l-s \leq L$ and $s=1$ is greater than the number of partitions with $l-s\leq L$ and $s>1$. Here $l$ and $s$ are the largest part and the smallest part of the partition, respectively.

math.CO↗