◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Daniel C. McDonald

7 papers hereh-index 318 citations10 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author6
  • middle author1

Across the 7 of 7 papers where every author was matched, so the position is known.

fields
  • math.CO5
  • math.LO1
  • math.NT1

identity via Semantic Scholar / OpenAlex

activity
20122023
most citedOn-line vertex ranking of trees

4 citations · 11 across the 6 of their papers we have counts for

collaborators
Showing math.NTShow all

1 paper · 1 filter

math.NT2014

A combinatorial proof on partition function parity

Daniel C. McDonald

One of the most basic results concerning the number-theoretic properties of the partition function p(n) is that p(n) takes each value of parity infinitely often. This statement…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.