2-Variable Riley Polynomial in Knot Theory

• The 2-variable Riley polynomial is a defining algebraic object that encodes non-abelian SL(2,C) representations for 2-bridge knots using two eigen-parameters.
• It leverages recursive formulas and combinatorial data from sign-sequences to compute A-polynomials and analyze deformation spaces efficiently.
• Its closed-form and recursive structures bridge knot group presentations with geometric invariants, deepening insights into knot theory and 3-manifold topology.

The 2-variable Riley polynomial is a key algebraic object encoding the non-abelian $\mathrm{SL}(2,\mathbb{C})$ representation variety of 2-bridge knot and link groups. It arises naturally in the study of the character variety, the $A$-polynomial, and the detection of non-abelian representations and their deformations. The polynomial captures, via explicit algebraic conditions, the structure of the representation space as a plane curve in terms of two variables corresponding to eigen-parameters of the generators or traces of meridians. Recent developments substantially clarify its combinatorial and algebraic structure, offering effective computational routes to produce $A$-polynomials for arbitrary 2-bridge knots.

1. Fundamental Definition and Presentation

Let $K$ be a 2-bridge knot or link with a symmetric group presentation

$G(\epsilon)=\langle x, y\,|\, w\,x = y\,w \rangle,$

where $w$ is a word with sign sequence $$\epsilon = (\epsilon_1, \ldots, \epsilon_{\alpha-1})$$, $\epsilon_i = \pm 1$, exhibiting palindromicity: $\epsilon_i = \epsilon_{\alpha - i}$. A non-abelian $\mathrm{SL}(2,\mathbb{C})$-representation

$$\rho(x) = \begin{pmatrix} M & 1 \ 0 & M^{-1} \end{pmatrix}, \qquad \rho(y) = \begin{pmatrix} M & 0 \ \lambda & M^{-1} \end{pmatrix},\qquad M \in \mathbb{C}^*,\; \lambda \in \mathbb{C},$$

parametrizes a Zariski open subset of the $\mathrm{SL}(2,\mathbb{C})$ character variety. Given the explicit formula for $W=\rho(w)$: $$W = \begin{pmatrix} W_{11} & W_{12} \ \lambda W_{12} & W_{22} \end{pmatrix},$$ Riley's Proposition states that the factorization descends precisely when $W_{11} - z W_{12} = 0$ with $z = M - M^{-1}$. The 2-variable Riley polynomial is then defined by

$$\boxed{ \mathcal{R}(M, \lambda) = W_{11}(M, \lambda) - (M - M^{-1}) W_{12}(M, \lambda) }$$

This polynomial is monic of degree $(\alpha-1)/2$ in $\lambda$ and normalized in $\mathbb{Z}[M^{\pm 1}, \lambda]$. The vanishing locus of $\mathcal{R}(M, \lambda)$ for $M \in \mathbb{C} \setminus \{0, \pm 1\}$ specifies the non-abelian representation classes associated to $K$ (Jo et al., 24 Jan 2026).

2. Closed Forms and Recursive Structures

Recent work establishes an explicit closed-form for $\mathcal{R}(M, \lambda)$ in terms of combinatorial data determined by the sign-sequence $\epsilon$. Transitioning to the generalized symplectic quandle method, one has

$$\mathcal{R}(M, \lambda) = f_{\alpha-1}(M, \tilde{\lambda}), \qquad \tilde{\lambda} = \lambda + (M - M^{-1})^2,$$

where

$$f_n(M, \tilde{\lambda}) = \sum_{k=0}^{\lfloor n/2 \rfloor} \widetilde{c}_{2k}^{\, n}(M, \epsilon) \, \tilde{\lambda}^k$$

with $\widetilde{c}_{2k}^{\, n}(M, \epsilon)$ explicit Laurent monomials in $M$. The polynomial families $(f_n, g_n)$ further satisfy succinct recursions dependent only on $\epsilon$: $$\boxed{ \begin{aligned} g_n &= e_n\,M^{-e_n} f_{n-1} + M^{-2 e_n} g_{n-1},\ f_n &= M^{2e_n} f_{n-2} + (\lambda - 1 + M^{-2 e_n}) f_{n-1} + e_n \tilde{\lambda} (M + M^{-1}) g_{n-1} \end{aligned} }$$ with $f_0 = 1$, $g_0 = 0$, $f_1 = 1 + \tilde{\lambda}$ (Jo et al., 24 Jan 2026).

For classical two-bridge knots presented as $C(2n,3)$, the Riley–Mednykh polynomial $P_{2n}(x, M)$ satisfies binomial sum formulas explicit for both $n \geq 0$ and $n < 0$, capturing the full representation structure (Ham et al., 2016).

3. Geometric Interpretation of Variables

The variable $M$ encodes the eigenvalue of a meridian, namely, $M$ (up to sign) is the meridian's eigenvalue under $\rho$; geometrically this is related to the trace of a meridian. The auxiliary variable $x$ (in the $C(2n, 3)$ case) or $\lambda$ (in the symplectic quandle context) records, up to affine transformation, the negative trace of the commutator $\rho(st^{-1})$ or $\rho(xy^{-1})$. These parameters define a sheet of the character variety, and the elimination of $x$ (or $\lambda$) in favor of the longitude eigenvalue $L$ gives the two-variable curve associated to the $A$-polynomial.

Consider the two-bridge knot $K = C(2n,3)$, with $X_{2n} = S^3 \setminus C(2n,3)$ presented by: $$\pi_1(X_{2n}) = \langle s, t \mid s (ts^{-1} t s t^{-1} s)^n t^{-1} (ts^{-1} t s t^{-1} s)^{-n} = 1 \rangle,$$ where $\rho(s)$ and $\rho(t)$ are parameterized as above, and $x$ encodes the trace of the commutator. The longitude's eigenvalue $L$ is then directly related to $x$ and $M$ via an explicit rational function (Ham et al., 2016).

4. Passage to the $A$-Polynomial

The $A$-polynomial $A_K(L, M)$ arises by eliminating $x$ (or $\lambda$) between the vanishing of the Riley polynomial and the longitude parameterization: $L = -M^{-4n-2} \, \frac{M^{-2} + x}{M^2 + x}$ for the $C(2n,3)$ case, or, more generally,

$$L\,M^{2\sigma} = \frac{\tilde{\lambda}\, g_{\alpha-1}(M, \tilde{\lambda})^2}{1 - f_{\alpha-1}(M, \tilde{\lambda})\, f_{\alpha-2}(M, \tilde{\lambda})}$$

for a general $S(\alpha, \beta)$ knot with $\sigma = \sum_i \epsilon_i$. The $A$-polynomial is obtained as the resultant of these two equations, reflecting the algebraic locus of boundary-restricting representations and encoding the geometric type of the character curve (Ham et al., 2016, Jo et al., 24 Jan 2026).

5. Computational Approaches and Applications

The recursive formulation of the two-variable Riley polynomial, made explicit through the symplectic quandle formalism, supports highly efficient computation for arbitrary 2-bridge knots. By expressing the polynomial in terms of $\epsilon$-dependent recursions and closed combinatorial forms, one can compute the associated $A$-polynomials for hundreds of knots in practical computational time, as demonstrated using Mathematica implementations (Jo et al., 24 Jan 2026). This enables systematic exploration of representation spaces and algebraic structure across broad knot families.

Table: Key Data in 2-Variable Riley Polynomial Construction

Parameter	Geometric/Algebraic Role	Reference Expression
$M$	Meridian eigenvalue	$\rho(x)_{11}$ or $\rho(s)_{11}$
$x$ or $\lambda$	Negative commutator trace	$- \operatorname{tr}(\rho(st^{-1}))$ or as above
$L$	Longitude eigenvalue	rational function in $x, M$ or $\lambda, M$
$\mathcal{R}(M, \lambda)$	2-variable Riley polynomial	$W_{11} - z W_{12}$
$A(L, M)$	$A$-polynomial	resultant of Riley and longitude equations

The structural invariance under $M \leftrightarrow M^{-1}$, degree computations in $x$, and the relation to classical Riley polynomials for small $n$ (e.g., the trefoil for $n=1$) are immediate corollaries of the explicit construction (Ham et al., 2016).

6. Significance, Limitations, and Future Directions

The two-variable Riley polynomial furnishes a concrete representation-theoretic link between knot group presentations, character varieties, and the $A$-polynomial, with direct implications for geometry and topology of 3-manifolds. Its recursive, combinatorial structure tightly connects algebraic and topological knot invariants, facilitating automated computation and broadening understanding of deformation spaces of representations. The method extends naturally via the generalized symplectic quandle framework, suggesting deeper algebraic structures underlying representation varieties.

A plausible implication is that further refinement of the symplectic quandle approach or alternate recursion-based frameworks could unlock new families of invariants or provide more refined stratifications of character varieties for wider classes of knots and links, beyond the 2-bridge case (Jo et al., 24 Jan 2026).