[Paper Review] An automaton-theoretic approach to the representation theory of quantum algebras

Jason P. Bell, Stéphane Launois+1 more|ArXiv.org|Jan 29, 2009

semigroups and automata theory13 references3 citations

TL;DR

This paper develops an automaton-theoretic framework to study torus-invariant primitive ideals in quantum matrices, showing that for fixed m, the number of such ideals in m×n quantum matrices satisfies a linear recurrence over ℚ. For m=3, it derives an explicit closed-form formula using Cauchon diagrams and Pfaffians, confirming a conjecture on the structure of these ideals.

ABSTRACT

We develop a new approach to the representation theory of quantum algebras supporting a torus action via methods from the theory of finite-state automata and algebraic combinatorics. We show that for a fixed number $m$, the torus-invariant primitive ideals in $m imes n$ quantum matrices can be seen as a regular language in a natural way. Using this description and a semigroup approach to the set of Cauchon diagrams, a combinatorial object that paramaterizes the primes that are torus-invariant, we show that for $m$ fixed, the number of torus-invariant primitive ideals in $m imes n$ quantum matrices satisfies a linear recurrence in $n$ over the rational numbers. In the $3 imes n$ case we give a concrete description of the torus-invariant primitive ideals and use this description to give an explicit formula for the number P(3,n).

Motivation & Objective

• To understand the structure of torus-invariant primitive ideals in quantum matrix algebras O_q(M_{m,n}).
• To establish a connection between automata theory and the representation theory of quantum algebras.
• To prove that the number of such ideals satisfies a linear recurrence over ℚ for fixed m.
• To provide an explicit formula for the number of primitive H-primes in 3×n quantum matrices.

Proposed method

• Modeling Cauchon diagrams as regular languages using finite-state automata.
• Introducing a semigroup structure on the set of Cauchon diagrams to analyze their combinatorial properties.
• Using skew-adjacency matrices associated with Cauchon diagrams to determine primitivity via determinant conditions.
• Showing that invertibility of the skew-adjacency matrix is equivalent to the determinant being a power of 4, enabling modular testing mod 3.
• Applying generating functions and character theory of S_4 × {±1} to compute the generating function for primitive diagrams.
• Using Pfaffians of skew-symmetric matrices derived from diagrams to characterize primitivity and derive explicit formulas.

Experimental results

Research questions

• RQ1 Does the number of torus-invariant primitive ideals in O_q(M_{m,n}) satisfy a linear recurrence in n for fixed m?
• RQ2 Can an explicit closed-form formula be derived for the number of such ideals in the 3×n case?
• RQ3 Is the set of Cauchon diagrams corresponding to primitive ideals a regular language under a natural automaton model?
• RQ4 What is the algebraic significance of the sign of the Pfaffian of the skew-adjacency matrix in Cauchon diagrams?
• RQ5 Is the image of the semigroup of Cauchon diagrams under a certain map a finite group?

Key findings

• For any fixed m, the number P(m,n) of torus-invariant primitive ideals in m×n quantum matrices satisfies a linear recurrence over ℚ.
• In the 3×n case, the number of such ideals is given by the explicit formula: P(3,n) = (1/8)(15·4^n - 18·3^n + 13·2^n - 6·(-1)^n + 3·(-2)^n).
• The generating function for primitive Cauchon diagrams in the 3×n case is rational and explicitly computed via character theory.
• The Pfaffian of the skew-adjacency matrix associated with a Cauchon diagram is always ±2^k, and this property is used to characterize primitivity.
• The set of Cauchon diagrams forms a regular language, enabling automaton-theoretic analysis of their enumeration.
• The image of the semigroup of Cauchon diagrams under the map to ℤ₃[Ex₃]/J_m is a group of order 384 for m=3.