Nathaniel Thiem

University of Colorado Boulder

H-index: 11

North America-United States

About Nathaniel Thiem

Nathaniel Thiem, With an exceptional h-index of 11 and a recent h-index of 7 (since 2020), a distinguished researcher at University of Colorado Boulder, specializes in the field of Algebraic Combinatorics, Representation Theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

Hopf structures in the representation theory of direct products

A categorification of the Malvenuto–Reutenauer algebra via a tower of groups

The fully commutative elements of G (d, 1, n) and a 2-paneled window presentation

The structure of normal lattice supercharacter theories

Pattern groups and a poset based Hopf monoid

The generalized Gelfand–Graev characters of GLn (Fq)

Nathaniel Thiem Information

University	University of Colorado Boulder
Position	___
Citations(all)	530
Citations(since 2020)	139
Cited By	459
hIndex(all)	11
hIndex(since 2020)	7
i10Index(all)	13
i10Index(since 2020)	3
Email	Access Email
University Profile Page	University of Colorado Boulder
Google Scholar	View Google Scholar Profile

Nathaniel Thiem Skills & Research Interests

Algebraic Combinatorics

Representation Theory

Top articles of Nathaniel Thiem

Title	Journal	Author(s)	Publication Date
Hopf structures in the representation theory of direct products	arXiv preprint arXiv:2111.03131	Farid Aliniaeifard Nathaniel Thiem	2021/11/4
A categorification of the Malvenuto–Reutenauer algebra via a tower of groups	Advances in Mathematics	Farid Aliniaeifard Nathaniel Thiem	2021/6/4
The fully commutative elements of G (d, 1, n) and a 2-paneled window presentation		Thomas Magnuson	2021
The structure of normal lattice supercharacter theories	Algebraic Combinatorics	Farid Aliniaeifard Nathaniel Thiem	2020
Pattern groups and a poset based Hopf monoid	Journal of Combinatorial Theory, Series A	Farid Aliniaeifard Nathaniel Thiem	2020/5/1
The generalized Gelfand–Graev characters of GLn (Fq)	Discrete Mathematics & Theoretical Computer Science	Scott Andrews Nathaniel Thiem	2020/4/22