ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a0=1a_0=1, and for each positive integer nn, let ana_n be the number of triangulations of a regular nn-gon such that every internal vertex has degree at least 66. Define the generating function

A(x)=1+∑n=1∞anxn.A(x)=1+ \sum_{n=1}^{\infty}a_nx^n.

Let bnb_n be the dimension of the invariant subspace in the nn-th tensor power of the 77-dimensional fundamental representation of G2G_2, and define

B(x)=1+∑n=1∞bnxn.B(x)=1+\sum_{n=1}^{\infty}b_nx^n.

Kuperberg's conjecture. The exponential growth rate of the triangulation numbers is

lim sup⁡n→∞ann=7B(1/7).\limsup_{n\to\infty}\sqrt[n]{a_n}=\frac{7}{B(1/7)}.

Equivalently, the radius of convergence of A(x)A(x) is exactly B(1/7)/7B(1/7)/7. Kuperberg's identity B(x)=A(xB(x))B(x)=A(xB(x)) gives the corresponding upper bound on the growth rate, and the conjecture asserts that this bound is sharp.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.