中文
相关论文

相关论文: Combinatorial proof of a result on generalized ove…

200 篇论文

This note is devoted to a combinatorial proof of a Schmidt type theorem due to Andrews and Paule. A four-variable refinement of Andrews and Paule's theorem is also obtained based on this combinatorial construction.

组合数学 · 数学 2022-09-27 Kathy Q. Ji

In 2012 Bryson, Ono, Pitman and Rhoades showed how the generating functions for certain strongly unimodal sequences are related to quantum modular and mock modular forms. They proved some parity results and conjectured some mod 4…

数论 · 数学 2020-10-28 Rong Chen , Frank Garvan

We generalize recent results of Breuer and Kronholm, and Chern on partitions and overpartitions with bounded differences between largest and smallest parts. We prove our generalization both analytically and combinatorially.

组合数学 · 数学 2018-05-24 Shane Chern , Ae Ja Yee

Since their introduction by Andrews, generalized Frobenius partitions have interested a number of authors, many of whom have worked out explicit formulas for their generating functions in specific cases. This has uncovered interesting…

数论 · 数学 2016-10-25 Kathrin Bringmann , Larry Rolen , Michael Woodbury

In a recent article on overpartitions, Merca considered the auxiliary function $a(n)$ which counts the number of partitions of $n$ where odd parts are repeated at most twice (and there are no restrictions on the even parts). In the course…

数论 · 数学 2025-08-11 James A. Sellers

Our results can be viewed as applications of algebraic combinatorics in random matrix theory. These applications are motivated by the predictive power of random matrix theory for the statistical behavior of the celebrated Riemann…

组合数学 · 数学 2018-05-21 Helen Riedtmann

We investigate combinatorics of the instanton partition function for the generic four dimensional toric orbifolds. It is shown that the orbifold projection can be implemented by taking the inhomogeneous root of unity limit of the q-deformed…

高能物理 - 理论 · 物理学 2012-03-03 Taro Kimura

In a recent paper, Merca posed three conjectures on congruences for specific convolutions of a sum of odd divisor functions with a generating function for generalized $m$-gonal numbers. Extending Merca's work, we complete the proof of these…

数论 · 数学 2021-07-22 Kaya Lakein , Anne Larsen

Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that…

组合数学 · 数学 2017-01-31 Eugene Curtin , Suho Oh

The starting point for this work is the family of functions $\overline{p}_{-t}(n)$ which counts the number of $t$--colored overpartitions of $n.$ In recent years, several infinite families of congruences satisfied by $\overline{p}_{-t}(n)$…

数论 · 数学 2024-05-30 James A. Sellers

Recently, Lin introduced two new partition functions PD$_t(n)$ and PDO$_t(n)$, which count the total number of tagged parts over all partitions of $n$ with designated summands and the total number of tagged parts over all partitions of $n$…

数论 · 数学 2023-01-30 Nayandeep Deka Baruah , Mandeep Kaur

We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…

组合数学 · 数学 2021-06-09 Galyna Dobrovolska

Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…

组合数学 · 数学 2025-05-15 Dandan Chen , Rong Chen , Mengjie Zhao

We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the…

组合数学 · 数学 2009-11-10 J. Haglund , M. Haiman , N. Loehr

Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…

信息论 · 计算机科学 2019-07-16 Can Xiang , Xin Ling , Qi Wang

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

逻辑 · 数学 2024-12-23 Lorna Gregory

In this paper a new conjecture equivalent to Collatz conjecture is presented. In particural, showing that (all) the solution(s) of newly introduced iterative functional equation(s) have a given property is equivalent to prove Collatz…

综合数学 · 数学 2023-05-18 Giulio Masetti

In important work on the parity of the partition function, Ono related values of the partition function to coefficients of a certain mock theta function modulo 2. In this paper, we use M\"obius inversion to give analogous results which…

数论 · 数学 2014-05-29 Marie Jameson , Robert P. Schneider

We provide explicit formulas for quadratic Gauss sums over $\mathbb{Z}^n/c\mathbb{Z}^n$, which generalize some of the existing formulas, e.g., Skoruppa and Zagier's (for $n=2$), and Iwaniec and Kowalski's (for arbitrary $n$). We then give…

数论 · 数学 2025-12-18 Xiao-Jie Zhu

The known facts about solvability of equations over groups are considered from a more general point of view. A generalized version of the theorem about solvability of unimodular equations over torsion-free groups is proved. In a special…

群论 · 数学 2007-05-23 Anton A. Klyachko