◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Samuel Creedon

4 papers here

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

author position
  • first author4

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

fields
  • math.RT4
same name
  • Samuel Creedon — 1 paper

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
20242026
collaborators
Showing math.RTShow all

4 papers · 1 filter

math.RT2026

Kostant's problem for permutations of shape (n−2,1,1) and (n−3,2,1)

Samuel Creedon, Volodymyr Mazorchuk

For a permutation z in the symmetric group Sn​, denote by Lz​ the corresponding simple highest weight module in the principal block of the BGG category $\mathcal…

math.RT2025

A stability phenomenon in Kazhdan-Lusztig combinatorics

Samuel Creedon, Volodymyr Mazorchuk

We prove that, when n goes to infinity, the expression, with respect to the dual Kazhdan-Lusztig basis, of the product H​^​x​H​y​ of elements of the d…

math.RT2025

Consecutive Patterns, Kostant's Problem and Type A6​

Samuel Creedon, Volodymyr Mazorchuk

For a permutation w in the symmetric group Sn​, let L(w) denote the simple highest weight module in the principal block of the BGG category O for the…

math.RT2024

Almost all permutations and involutions are Kostant negative

Samuel Creedon, Volodymyr Mazorchuk

We prove that, when n goes to infinity, Kostant's problem has negative answer for almost all simple highest weight modules in the principal block of the BGG category $\mathcal{O}…

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