activity
20052024
most citedGröbner methods for representations of combinatorial categories

122 citations · 901 across the 71 of their papers we have counts for

collaborators
Showing 2023Show all

9 papers · 1 filter

math.RT2023

Arboreal tensor categories

Nate Harman, Ilia Nekrasov, Andrew Snowden

We introduce some new symmetric tensor categories based on the combinatorics of trees: a discrete family , for an integer, and a continuous family $\mathc…

math.RT2023

On the representation theory of the symmetry group of the Cantor set

Andrew Snowden

In previous work with Harman, we introduced a new class of representations for an oligomorphic group , depending on an auxiliary piece of data called a measure. In this paper, w…

math.RT2023

Some fast-growing tensor categories

Andrew Snowden

Given a semi-simple pre-Tannakian category over a finite field, we show that (a slight modification of) its linearization over a field of characteristic 0 is also semi-simple and p…

math.AG2023

Uniformity for limits of tensors

Arthur Bik, Jan Draisma, Rob Eggermont +1

There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank locus…

math.RT2023

Discrete pre-Tannakian categories

Nate Harman, Andrew Snowden

Pre-Tannakian categories are a natural class of tensor categories that can be viewed as generalizations of algebraic groups. We define a pre-Tannkian category to be discrete if it…

math.AC2023

Systems of ideals parametrized by combinatorial structures

Robert P. Laudone, Andrew Snowden

A symmetric chain of ideals is a rule that assigns to each finite set an ideal in the polynomial ring such that if is an emb…