中文
相关论文

相关论文: M_2-rank differences for partitions without repeat…

200 篇论文

Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…

组合数学 · 数学 2025-10-03 Y. Q. Chen , Thomas Y. He , X. M. Huang , T. T. Zou

We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…

组合数学 · 数学 2026-05-13 Nathan Reading

Inspired by the recent work by Nadji, Ahmia and Ram\'irez, we examined the arithmetic properties of $\bar{B}_{l_1,l_2} (n)$, the number of overpartitions of n whose parts are neither divisible by $l_1$ nor divisible by $l_2$. In particular,…

数论 · 数学 2025-07-04 Anakha V

We construct Andrews-Gordon type evidently positive series as generating functions of partitions satisfying certain difference conditions in six conjectures by Kanade and Russell. We construct generating functions for missing partition…

组合数学 · 数学 2018-08-07 Kağan Kurşungöz

It is known that partial spreads is a class of bent partitions. In \cite{AM2022Be,MP2021Be}, two classes of bent partitions whose forms are similar to partial spreads were presented. In \cite{AKM2022Ge}, more bent partitions $\Gamma_{1},…

信息论 · 计算机科学 2023-01-03 Jiaxin Wang , Fang-Wei Fu , Yadi Wei

The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs,…

统计方法学 · 统计学 2009-06-18 Roberto Fontana , Giovanni Pistone

This paper provides some statistics for the coefficients of Russell- Type modular equations for the modular function, {\lambda}({\tau}). The results hold uniformly for all odd primes. They do not rely on any numerical evaluations of…

数论 · 数学 2016-08-08 Timothy Redmond , Charles Ryavec

An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…

组合数学 · 数学 2007-05-23 Edwin O'Shea

By considering the $M_2$-rank of an overpartition as well as a residual crank, we give another combinatorial refinement of the congruences $\overline{\mbox{spt}}_2(3n)\equiv \overline{\mbox{spt}}_2(3n+1)\equiv 0\pmod{3}$. Here…

数论 · 数学 2014-06-23 Chris Jennings-Shaffer

Let $\alpha$ and $\beta$ be two nonnegative integers such that $\beta < \alpha$. For an arbitrary sequence $\{a_n\}_{n\geqslant 1}$ of complex numbers, we consider the generalized Lambert series in order to investigate linear combinations…

组合数学 · 数学 2021-02-03 Mircea Merca

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…

数论 · 数学 2021-01-25 Zachary Hoelscher , Eyvindur Ari Palsson

We consider the symmetrized moments of three ranks and cranks, similar to the work of Garvan for the rank and crank of a partition. By using Bailey pairs and elementary rearrangements, we are able to find useful expressions for these…

数论 · 数学 2014-12-12 Chris Jennings-Shaffer

The rank of partitions play an important role in the combinatorial interpretations of several Ramanujan's famous congruence formulas. In 2005 and 2008, the $D$-rank and $M_2$-rank of an overpartition were introduced by Lovejoy,…

组合数学 · 数学 2019-03-06 Huan Xiong , Wenston J. T. Zang

The nonnegative integer rank of a matrix is a variant of the classical nonnegative rank, introduced in the 1980s, where factorizations are required to have integer entries. While computing nonnegative integer rank is generally very hard, we…

组合数学 · 数学 2026-02-27 João Gouveia , Amy Wiebe

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…

组合数学 · 数学 2019-09-04 Jacob Sprittulla

When factorizing binary matrices, we often have to make a choice between using expensive combinatorial methods that retain the discrete nature of the data and using continuous methods that can be more efficient but destroy the discrete…

离散数学 · 计算机科学 2016-10-07 Stefan Neumann , Rainer Gemulla , Pauli Miettinen

We investigate the parity of the coefficients of certain eta-quotients, extensively examining the case of $m$-regular partitions. Our theorems concern the density of their odd values, in particular establishing lacunarity modulo 2 for…

组合数学 · 数学 2022-03-07 William J. Keith , Fabrizio Zanello

Recently the Euler forms on numerical Grothendieck groups of rank 4 whose properties mimick that of the Euler form of a smooth projective surface have been classified. This classification depends on a natural number $m$, and suggests the…

代数几何 · 数学 2018-11-22 Pieter Belmans , Dennis Presotto , Michel Van den Bergh

We present an infinite family of recursive formulas that count binary integer partitions satisfying natural divisibility conditions and show that these counts are interrelated via partial sums. Moreover, we interpret the partitions we study…

代数拓扑 · 数学 2022-05-11 Scott M. Bailey , Donald M. Larson

We study the graded derivation-based noncommutative differential geometry of the $Z_2$-graded algebra ${\bf M}(n| m)$ of complex $(n+m)\times(n+m)$-matrices with the ``usual block matrix grading'' (for $n\neq m$). Beside the…

数学物理 · 物理学 2009-10-31 Harald Grosse , Gert Reiter