中文
相关论文

相关论文: An overpartition analogue of the $q$-binomial coef…

200 篇论文

Let $\overline{\mathrm{spt}}k(n)$ denote the number of overpartitions of $n$ where the smallest non-overlined part, say $s(\pi)$, appears $k$ times and every overlined part is bigger than $s(\pi)$. Let $\overline{\mathrm{spt}}k_o(n)$ denote…

组合数学 · 数学 2026-02-03 Nayandeep Deka Baruah , Haijun Li , Pankaj Jyoti Mahanta

We present new proofs and generalizations of unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker…

组合数学 · 数学 2014-03-13 Igor Pak , Greta Panova

Let $s_{ij}$ represent a tranposition in $S_n$. A polynomial $P$ in $\mathbb{Q}[X_n]$ is said to be $m$-quasiinvariant with respect to $S_n$ if $(x_i-x_j)^{2m+1}$ divides $(1-s_{ij})P$ for all $1 \leq i, j \leq n$. We call the ring…

组合数学 · 数学 2007-05-23 Jason Bandlow , Gregg Musiker

In a recent work, Andrews defined the singular overpartitions with the goal of presenting an overpartition analogue to the theorems of Rogers--Ramanujan type for ordinary partitions with restricted successive ranks. As a small part of his…

组合数学 · 数学 2017-12-27 Doris D. M. Sang , Diane Y. H. Shi

We prove polynomial boson-fermion identities for the generating function of the number of partitions of $n$ of the form $n=\sum_{j=1}^{L-1} j f_j$, with $f_1\leq i-1$, $f_{L-1} \leq i'-1$ and $f_j+f_{j+1}\leq k$. The bosonic side of the…

q-alg · 数学 2009-10-30 S. O. Warnaar

Using $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, which was the subject of an earlier paper, $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, can be…

组合数学 · 数学 2022-11-23 M. J. Kronenburg

In the present paper combinatorial identities involving q-dual sequences or polynomials with coefficients q-dual sequences are derived. Further, combinatorial identities for q-binomial coefficients(Gaussian coefficients), q-Stirling numbers…

组合数学 · 数学 2007-05-23 Sharon J. X. Hou , Jiang Zeng

By applying Chinese remainder theorem for coprime polynomials and the "creative microscoping" method recently introduced by the author and Zudilin, we establish parametric generalizations of three $q$-supercongruences modulo the fourth…

数论 · 数学 2019-12-03 Victor J. W. Guo

We give "hybrid" proofs of the $q$-binomial theorem and other identities. The proofs are "hybrid" in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the…

数论 · 数学 2019-01-17 Dennis Eichhorn , James Mc Laughlin , Andrew V. Sills

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

组合数学 · 数学 2026-03-16 D. S. Gireesh , B. Hemanthkumar

The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…

组合数学 · 数学 2017-12-21 Ivica Martinjak , Ivana Zubac

We prove some special cases of Bergeron's inequality involving two Gaussian polynomials (or $q$-binomials).

组合数学 · 数学 2023-04-10 Tewodros Amdeberhan , David Callan

Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…

数论 · 数学 2014-08-07 Cristina Ballantine , Mircea Merca

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…

组合数学 · 数学 2009-06-16 Victor Reiner , Dennis Stanton

In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…

组合数学 · 数学 2016-05-10 Zhumagali Shomanov

In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…

数论 · 数学 2024-05-31 Shi-Chao Chen , Michael D. Hirschhorn , James A. Sellers

$q$-analogues of quantities in mathematics involve perturbations of classical quantities using the parameter $q$, and revert to the original quantities when $q$ goes $1$. An important example is the $q$-analogues of binomial coefficients…

组合数学 · 数学 2021-05-18 Semin Yoo

We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…

组合数学 · 数学 2019-07-23 Peter S Chami , Bernd Sing , Norris Sookoo

Recently, $4$-regular partitions into distinct parts are connected with a family of overpartitions. In this paper, we provide a uniform extension of two relations due to Andrews for the two types of partitions. Such an extension is made…

组合数学 · 数学 2023-01-27 George E. Andrews , Shane Chern

Recently, several mathematicians have investigated various partition functions with the goal of discovering Ramanujan-type congruences. One such function is $\overline{B}_{2^\alpha}(n)$, which represents the number of $2^\alpha-$regular…

数论 · 数学 2025-02-25 Hemanthkumar B. , Sumanth Bharadwaj H. S