On the parity of the number of multiplicative partitions

被引：1
|
作者：
Zaharescu, Alexandru [1 ,2 ]
Zaki, Mohammad [3 ]
机构：
[1] Acad Romana, Inst Math, Bucharest 014700, Romania
[2] Univ Illinois, Dept Math, Urbana, IL 61801 USA
[3] Ohio No Univ, Dept Math, Ada, OH 45810 USA
来源：
ACTA ARITHMETICA | 2010年 / 145卷 / 03期
基金：
美国国家科学基金会;
关键词：
parity problems; multiplicative partitions; ARITHMETIC PROGRESSIONS; VALUES;
D O I：
10.4064/aa145-3-2
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
[No abstract available]
引用
收藏
页码：221 / 232
页数：12
相关论文
共 50 条
  • [21] PARITY RESULTS FOR PARTITIONS WHEREIN EACH PART APPEARS AN ODD NUMBER OF TIMES
    Hirschhorn, Michael D.
    Sellers, James A.
    [J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2019, 99 (01) : 51 - 55
  • [22] Maximal Multiplicative Properties of Partitions
    Bessenrodt, Christine
    Ono, Ken
    [J]. ANNALS OF COMBINATORICS, 2016, 20 (01) : 59 - 64
  • [23] Maximal Multiplicative Properties of Partitions
    Christine Bessenrodt
    Ken Ono
    [J]. Annals of Combinatorics, 2016, 20 : 59 - 64
  • [24] MULTIPLICATIVE PARTITIONS OF BIPARTITE NUMBERS
    LANDMAN, BM
    GREENWELL, RN
    [J]. FIBONACCI QUARTERLY, 1991, 29 (03): : 264 - 267
  • [25] Cluster parity indices of partitions
    Kağan Kurşungöz
    [J]. The Ramanujan Journal, 2010, 23 : 195 - 213
  • [26] Partitions with Parts Separated by Parity
    George E. Andrews
    [J]. Annals of Combinatorics, 2019, 23 : 241 - 248
  • [27] UNLIMITED PARITY ALTERNATING PARTITIONS
    Chern, Shane
    [J]. QUAESTIONES MATHEMATICAE, 2019, 42 (10) : 1345 - 1352
  • [28] Partitions weighted by the parity of the crank
    Choi, Dohoon
    Kang, Soon-Yi
    Lovejoy, Jeremy
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2009, 116 (05) : 1034 - 1046
  • [29] Parity successions in set partitions
    Mansour, Toufik
    Shattuck, Mark
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 439 (09) : 2642 - 2650
  • [30] Cluster parity indices of partitions
    Kursungoez, Kagan
    [J]. RAMANUJAN JOURNAL, 2010, 23 (1-3): : 195 - 213
12345