ARITHMETIC PROPERTIES SATISFIED BY A RECENT INTEGER PARTITION FUNCTION OF DOMBOS

Abstract The set of integer partitions of n , wherein the parts are either divisible by 4 or congruent to ± 1 ( mod 6 ) $\pm 1 \pmod {6}$ plus or minus 1 left parenthesis mod 6 right parenthesis , arose in a natural way in work of Dombos [‘A new grounded partition identity of type D 4 ( 3 ) $D_4^{(3)}$ upper D 4 Superscript left parenthesis 3 right parenthesis ’, SIGMA 22 (2026), Article no. 042]. Denote the function that counts the number of such partitions of n by dp ( n ) $\mathit {dp}(n)$ italic dp left parenthesis n right parenthesis . Using elementary generating function manipulations and classical q -series results, we prove several congruences satisfied by dp ( n ) $\mathit {dp}(n)$ italic dp left parenthesis n right parenthesis . As an example, we prove that, for all α ≥ 1 $\alpha \geq 1$ alpha greater than or equals 1 and all n ≥ 0 $n \geq 0$ n greater than or equals 0 , d p ( 3 2 α

Authors

Institutions

Publication Details

Journal
Bulletin of the Australian Mathematical Society
Published
2026-11-03
DOI
https://doi.org/10.1017/s0004972726102226
Primary Topic
Advanced Mathematical Identities
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ARITHMETIC PROPERTIES SATISFIED BY A RECENT INTEGER PARTITION FUNCTION OF DOMBOS

James A. Sellers, R Ferreira da Silva
Bulletin of the Australian Mathematical Society
Advanced Mathematical Identities
article

ARITHMETIC PROPERTIES SATISFIED BY A RECENT INTEGER PARTITION FUNCTION OF DOMBOS

James A. Sellers, R Ferreira da Silva
article en

Abstract

Abstract The set of integer partitions of n , wherein the parts are either divisible by 4 or congruent to ± 1 ( mod 6 ) $\pm 1 \pmod {6}$ plus or minus 1 left parenthesis mod 6 right parenthesis , arose in a natural way in work of Dombos [‘A new grounded partition identity of type D 4 ( 3 ) $D_4^{(3)}$ upper D 4 Superscript left parenthesis 3 right parenthesis ’, SIGMA 22 (2026), Article no. 042]. Denote the function that counts the number of such partitions of n by dp ( n ) $\mathit {dp}(n)$ italic dp left parenthesis n right parenthesis . Using elementary generating function manipulations and classical q -series results, we prove several congruences satisfied by dp ( n ) $\mathit {dp}(n)$ italic dp left parenthesis n right parenthesis . As an example, we prove that, for all α ≥ 1 $\alpha \geq 1$ alpha greater than or equals 1 and all n ≥ 0 $n \geq 0$ n greater than or equals 0 , d p ( 3 2 α

Bulletin of the Australian Mathematical Society
University of Minnesota, Duluth (US), Universidade Federal de São Paulo (BR)
Openalex Percentile: Top 48%
Advanced Mathematical Identities
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon