RECORD
Unlimited parity alternating partitions
Combinatorics · Submitted 2 Mar 2018
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim In particular, we obtain its asymptotic behavior by employing Ingham's Tauberian theorem.
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
We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by employing Ingham's Tauberian theorem.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). | contribution 1.00 | 0.88 | 0.11 | asserted 0.99 |
| s1 | Various properties of this partition function are studied. | contribution 1.00 | 0.82 | 0.06 | asserted 0.83 |
| s2 | In particular, we obtain its asymptotic behavior by employing Ingham's Tauberian theorem. | method 0.51 | 0.93 | 0.39 | 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
We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by employing Ingham's Tauberian theorem.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.