◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Harris

67 papers hereh-index 161.1k citations104 works total

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

author position
  • sole author1
  • first author17
  • middle author42
  • last author5

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

fields
  • math.CO45
  • math.NT9
  • math.RT7
  • q-bio.PE2
  • math.GR1
  • math.PR1
same name
  • P. Harris — 75 papers
  • P. Harris — 59 papers, h 0
  • P. Harris — 58 papers
  • P. Harris — 34 papers, h 28
  • P. Harris — 34 papers
  • P. Harris — 31 papers

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20112023
most citedDiversity of Artists in Major U.S. Museums

68 citations · 203 across the 58 of their papers we have counts for

collaborators
Showing 2021Show all

4 papers · 1 filter

math.CO2021

Enumerating k-Naples Parking Functions Through Catalan Objects

João Pedro Carvalho, Pamela E. Harris, Gordon Rojas Kirby +2

This paper studies a generalization of parking functions named k-Naples parking functions, where backward movement is allowed. One consequence of backward movement is that the nu…

math.RT2021★ 1 cited

On Kostant's weight q-multiplicity formula for sp6​(C)

Pamela E. Harris, Peter Hollander, Daniel C. Qin +1

Kostant's weight q-multiplicity formula is an alternating sum over a finite group known as the Weyl group, whose terms involve the q-analog of Kostant's partition function. The…

math.CO2021

Very Well-Covered Graphs with the Erdős-Ko-Rado Property

Jessica De Silva, Adam B. Dionne, Aidan Dunkelberg +1

A family of independent r-sets of a graph G is an r-star if every set in the family contains some fixed vertex v. A graph is r-EKR if the maximum size of an intersecting…

math.CO2021

On (t,r) broadcast domination of directed graphs

Pamela E. Harris, Peter Hollander, Erik Insko

A dominating set of a graph G is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of G is the order of a minimum dominati…

◍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.