◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Foster Tom

12 papers hereh-index 344 citations17 works total

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

author position
  • sole author5
  • first author4
  • middle author1
  • last author2

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

fields
  • math.CO11
  • cs.CR1

identity via Semantic Scholar / OpenAlex

activity
20172026
most citedA horizontal-strip LLT polynomial is determined by its weighted graph

1 citations · 2 across the 11 of their papers we have counts for

collaborators
Showing 2024Show all

3 papers · 1 filter

math.CO2024

Adjacent cycle-chains are e-positive

Foster Tom, Aarush Vailaya

We describe a way to decompose the chromatic symmetric function as a positive sum of smaller pieces. We show that these pieces are e-positive for cycles. Then we prove that attac…

math.CO2024

Graphs missing a connected partition

Foster Tom

We prove that a graph with a cut vertex whose deletion produces at least five connected components must be missing a connected partition of some type. We prove that this also holds…

math.CO2024

Chromatic symmetric functions and change of basis

Bruce E. Sagan, Foster Tom

We prove necessary conditions for certain elementary symmetric functions, eλ​, to appear with nonzero coefficient in Stanley's chromatic symmetric function as well as in the gene…

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