REVIEW 2 cited by
Oligomorphic groups and tensor categories
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Given an oligomorphic group $G$ and a measure $\mu$ for $G$ (in a sense that we introduce), we define a rigid tensor category $\underline{\mathrm{Perm}}(G; \mu)$ of "permutation modules," and, in certain cases, an abelian envelope $\underline{\mathrm{Rep}}(G; \mu)$ of this category. When $G$ is the infinite symmetric group, this recovers Deligne's interpolation category. Other choices for $G$ lead to fundamentally new tensor categories. For example, we construct the first known semi-simple pre-Tannakian categories in positive characteristic with super-exponential growth. One interesting aspect of our construction is that, unlike previous work in this direction, our categories are concrete: the objects are modules over a ring, and the tensor product receives a universal bi-linear map. Central to our constructions is a novel theory of integration on oligomorphic groups, which could be of more general interest. Classifying the measures on an oligomorphic group appears to be a difficult problem, which we solve in only a few cases.
Forward citations
Cited by 2 Pith papers
-
Classification of simple commutative algebras in the Delannoy category
Every simple commutative algebra in the Delannoy category Rep(G), for G = Aut(R,<), is isomorphic to the Schwartz algebra C(R^(n)) of functions on ordered n-tuples; tensor-product relative versions (Theorems B and C) ...
-
Classical interpolation categories
Ultraproduct and oligomorphic-group constructions of interpolation categories for finite classical groups agree, and the categories depend only on a parameter t, with an additional parity label in the orthogonal case.
Discussion (0). Continue with ORCID to comment.