RECORD
Partitions of nonnegative integers with identical representation functions
Number Theory · Submitted 16 Aug 2022
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim In this paper, we prove that there exist two sets $C$ and $D$ with $C\cup D=\mathbb{N}$ and $C\cap D=(r_{1}+m\mathbb{N})\cup (r_{2}+m\mathbb{N})$ such that $R_{C}(n)=R_{D}(n)$ for all $n\in\mathbb{N}$ if and only if there exists a positive integer $l$ such that $r_{1}=2^{2l+1}-2, r_{2}=2^{2l+1}-1, m=2^{2l+2}-2$.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Let $\mathbb{N}$ be the set of all nonnegative integers. For any integer $r$ and $m$, let $r+m\mathbb{N}=\{r+mk: k\in\mathbb{N}\}$. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_{S}(n)$ denote the number of solutions of the equation $n=s+s'$ with $s, s'\in S$ and $s<s'$. Let $r_{1}, r_{2}, m$ be integers with $0<r_{1}<r_{2}<m$ and $2\mid r_{1}$. In this paper, we prove that there exist two sets $C$ and $D$ with $C\cup D=\mathbb{N}$ and $C\cap D=(r_{1}+m\mathbb{N})\cup (r_{2}+m\mathbb{N})$ such that $R_{C}(n)=R_{D}(n)$ for all $n\in\mathbb{N}$ if and only if there exists a positive integer $l$ such that $r_{1}=2^{2l+1}-2, r_{2}=2^{2l+1}-1, m=2^{2l+2}-2$.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Let $\mathbb{N}$ be the set of all nonnegative integers. | background 1.00 | 0.05 | 0.01 | asserted 0.85 |
| s1 | For any integer $r$ and $m$, let $r+m\mathbb{N}=\{r+mk: k\in\mathbb{N}\}$. | background 1.00 | 0.09 | 0.01 | asserted 0.62 |
| s2 | For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_{S}(n)$ denote the number of solutions of the equation $n=s+s'$ with $s, s'\in S$ and $s<s'$. | background 1.00 | 0.08 | 0.02 | unclear 0.59 |
| s3 | Let $r_{1}, r_{2}, m$ be integers with $0<r_{1}<r_{2}<m$ and $2\mid r_{1}$. | background 0.99 | 0.09 | 0.02 | unclear 0.73 |
| s4 | In this paper, we prove that there exist two sets $C$ and $D$ with $C\cup D=\mathbb{N}$ and $C\cap D=(r_{1}+m\mathbb{N})\cup (r_{2}+m\mathbb{N})$ such that $R_{C}(n)=R_{D}(n)$ for all $n\in\mathbb{N}$ if and only if there exists a positive integer $l$ such that $r_{1}=2^{2l+1}-2, r_{2}=2^{2l+1}-1, m=2^{2l+2}-2$. | result 0.97 | 0.96 | 0.97 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Let $\mathbb{N}$ be the set of all nonnegative integers. For any integer $r$ and $m$, let $r+m\mathbb{N}=\{r+mk: k\in\mathbb{N}\}$. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_{S}(n)$ denote the number of solutions of the equation $n=s+s'$ with $s, s'\in S$ and $s<s'$. Let $r_{1}, r_{2}, m$ be integers with $0<r_{1}<r_{2}<m$ and $2\mid r_{1}$. In this paper, we prove that there exist two sets $C$ and $D$ with $C\cup D=\mathbb{N}$ and $C\cap D=(r_{1}+m\mathbb{N})\cup (r_{2}+m\mathbb{N})$ such that $R_{C}(n)=R_{D}(n)$ for all $n\in\mathbb{N}$ if and only if there exists a positive integer $l$ such that $r_{1}=2^{2l+1}-2, r_{2}=2^{2l+1}-1, m=2^{2l+2}-2$.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.