Generalized mex-functions and partitions with congruence restrictions on parts

In a recent work, Andrews and Newman introduced the statistic [Formula: see text] of a partition [Formula: see text], and obtained many interesting identities concerning the functions [Formula: see text] and [Formula: see text], the number of partitions of n whose [Formula: see text] are congruent to a and [Formula: see text] modulo [Formula: see text], respectively. Their pioneering work attracted much attention and inspired numerous subsequent studies. In this paper, motivated by the idea of Andrews–Newman, we consider a more general counting function [Formula: see text] induced by [Formula: see text], the number of partitions of n whose [Formula: see text] are congruent to [Formula: see text] modulo [Formula: see text] for [Formula: see text], and obtain a series of equality relations that connect the difference of two distinct [Formula: see text] functions to the number of partitions with congruence restrictions on parts. Moreover, we extend the counting functions [Formula: see text] to overpartitions as [Formula: see text], and then obtain some relevant equalities.

Authors

Institutions

Publication Details

Journal
International Journal of Number Theory
Published
2025-04-23
DOI
https://doi.org/10.1142/s1793042125500915
Primary Topic
Advanced Algebra and Logic
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generalized mex-functions and partitions with congruence restrictions on parts

Jane Y. X. Yang, Xuewei You
International Journal of Number Theory
Advanced Algebra and Logic
article

Generalized mex-functions and partitions with congruence restrictions on parts

Jane Y. X. Yang, Xuewei You
article en

Abstract

In a recent work, Andrews and Newman introduced the statistic [Formula: see text] of a partition [Formula: see text], and obtained many interesting identities concerning the functions [Formula: see text] and [Formula: see text], the number of partitions of n whose [Formula: see text] are congruent to a and [Formula: see text] modulo [Formula: see text], respectively. Their pioneering work attracted much attention and inspired numerous subsequent studies. In this paper, motivated by the idea of Andrews–Newman, we consider a more general counting function [Formula: see text] induced by [Formula: see text], the number of partitions of n whose [Formula: see text] are congruent to [Formula: see text] modulo [Formula: see text] for [Formula: see text], and obtain a series of equality relations that connect the difference of two distinct [Formula: see text] functions to the number of partitions with congruence restrictions on parts. Moreover, we extend the counting functions [Formula: see text] to overpartitions as [Formula: see text], and then obtain some relevant equalities.

International Journal of Number TheoryVol. 21(08)
Chongqing University of Posts and Telecommunications (CN)
Openalex Percentile: Top 91%
Advanced Algebra and Logic
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.