English
Related papers

Related papers: Rank differences for overpartitions

200 papers

We introduce a new foundation rank based in the relation of dividing between partial types. We call DU to this rank. We also introduce a new way to define the D rank over formulas as a foundation rank. In this way, SU, DU and D are…

Logic · Mathematics 2022-02-16 Santiago Cárdenas-Martín , Rafel Farré

We introduce the notion of arithmetic progression blocks or AP-blocks of $\mathbb{Z}_n$, which can be represented as sequences of the form $(x, x+m, x+2m, ..., x+(i-1)m) \pmod n$. Then we consider the problem of partitioning $\mathbb{Z}_n$…

Combinatorics · Mathematics 2008-05-13 William Y. C. Chen , David G. L. Wang , Iris F. Zhang

We prove some distribution results for the $k$-fold divisor function in arithmetic progressions to moduli that exceed the square-root of length $X$ of the sum, with appropriate constrains and averaging on the moduli, saving a power of $X$…

Number Theory · Mathematics 2023-08-15 David T. Nguyen

Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising Ramanujan-type congruences mod 5, 7 and 13. We…

Number Theory · Mathematics 2008-06-11 F. G. Garvan

Motivated by two Legendre-type formulas for overpartitions, we derive a variety of their companions as Legendre theorems for overpartition pairs. This leads to equalities of subclasses of overpartitions and overpartition pairs.

Number Theory · Mathematics 2024-12-17 George E. Andrews , Mohamed El Bachraoui

In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$, where the function $A_j$ counts the number of partitions with certain congruence conditions and the function $B_j$ counts the number of partitions with…

Combinatorics · Mathematics 2022-05-10 Thomas Y. He , Kathy Q. Ji , Alice X. H. Zhao

In this paper, we present new objects, quilts of alternating sign matrices with respect to two given posets. Quilts generalize several commonly used concepts in mathematics. For example, the rank function on submatrices of a matrix gives…

Combinatorics · Mathematics 2026-04-02 Sara Billey , Matjaž Konvalinka

Recently it has been shown that antibrackets may be expressed in terms of Poisson brackets and vice versa for commuting functions in the original bracket. Here we also introduce generalized brackets involving higher antibrackets or higher…

High Energy Physics - Theory · Physics 2019-08-17 Igor Batalin , Robert Marnelius

Inspired by a number of recent papers by Corteel, Dousse, Foda, Uncu and Welsh on cylindric partitions and Rogers-Ramanujan-type identities, we obtain the $\mathrm{A}_2$ (or $\mathrm{A}_2^{(1)}$) analogues of the celebrated Andrews-Gordon…

Combinatorics · Mathematics 2023-07-04 S. Ole Warnaar

Partitions without sequences of consecutive integers as parts have been studied recently by many authors, including Andrews, Holroyd, Liggett, and Romik, among others. Their results include a description of combinatorial properties,…

Number Theory · Mathematics 2015-01-13 Kathrin Bringmann , Karl Mahlburg , Karthik Nataraj

For a given partition of (1, 2, ..., 2n) into two disjoint subsets A and B with n elements in each, consider the maximum number of times any integer occurs as the difference between an element of A and an element of B. The minimum value of…

General Mathematics · Mathematics 2016-09-27 Jan Kristian Haugland

Motivated by earlier work of P.~A.~MacMahon and recent contributions of T.~Amdeberhan, G.~E.~Andrews, K.~Ono, A.~Singh, and R.~Tauraso on higher-order partition enumerants, we study a class of $q$-series arising from nested divisor…

Combinatorics · Mathematics 2025-12-02 Mircea Merca

We utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank <= k and those with k in…

Combinatorics · Mathematics 2007-05-23 Alexander Berkovich , Frank G. Garvan

We prove that for a large class of multiplicative functions, referred to as generalized divisor functions, it is possible to find a lower bound for the corresponding variance in arithmetic progressions. As a main corollary, we deduce such a…

Number Theory · Mathematics 2020-04-16 Daniele Mastrostefano

Generating functions for plane overpartitions are obtained using various methods such as nonintersecting paths, RSK type algorithms and symmetric functions. We extend some of the generating functions to cylindric partitions. Also, we show…

Combinatorics · Mathematics 2010-09-17 Sylvie Corteel , Cyrille Savelief , Mirjana Vuletić

In this Ph.D. dissertation (2018, Emory University) we prove theorems at the intersection of the additive and multiplicative branches of number theory, bringing together ideas from partition theory, $q$-series, algebra, modular forms and…

Number Theory · Mathematics 2020-11-13 Robert Schneider

We develop the theory of copartitions, which are a generalization of partitions with connections to many classical topics in partition theory, including Rogers-Ramanujan partitions, theta functions, mock theta functions, partitions with…

Combinatorics · Mathematics 2021-11-09 Hannah E. Burson , Dennis Eichhorn

In this paper we refine a weighted partition identity of Alladi. We write explicit formulas of generating functions for the number of partitions grouped with respect to a partition statistic other than the norm. We tie our weighted results…

Combinatorics · Mathematics 2016-04-01 Ali Kemal Uncu

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…

Combinatorics · Mathematics 2017-12-27 Doris D. M. Sang , Diane Y. H. Shi

The notion of the spt-crank of a vector partition, or an $S$-partition, was introduced by Andrews, Garvan and Liang. Let $N_S(m,n)$ denote the number of $S$-partitions of $n$ with spt-crank $m$. Andrews, Dyson and Rhoades conjectured that…

Combinatorics · Mathematics 2013-05-10 William Y. C. Chen , Kathy Q. Ji , Wenston J. T. Zang
‹ Prev 1 4 5 6 7 8 10 Next ›