\documentclass[11pt]{article} \usepackage[a4paper,margin=25mm]{geometry} \usepackage[T1]{fontenc} \usepackage{lmodern,amsmath,amssymb,amsthm,mathtools} \usepackage{microtype,indentfirst} \usepackage[colorlinks=true,linkcolor=blue,citecolor=blue,urlcolor=blue]{hyperref} \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \newcommand{\U}[2]{U[#1,#2]} \newcommand{\E}[3]{E_{#1}[#2,#3]} \newcommand{\PP}{\mathcal P} \newcommand{\TT}{\mathcal T} \newcommand{\kk}{\mathbb K} \allowdisplaybreaks[2] \title{Inclusions and invariant forms of Svinin's recurrences} \author{Jason Turner} \date{18 November 2026} \begin{document} \maketitle \begin{abstract} Svinin's two adjacent-order inclusions hold at every order for sequences with all entries nonzero. We give explicit coefficient maps and disprove both inclusions at every order for unrestricted polynomial solutions. We also prove Svinin's conjectured equivalence of the associated recurrence and its invariant form for every \(g\geq1\) on the nonzero-coordinate domain. \end{abstract} \begingroup \renewcommand{\thefootnote}{} \footnotetext[0]{\textbf{Keywords.} Svinin recurrences, Somos sequences, discrete invariants. \par\textbf{MSC 2020.} Primary 39A20. Secondary 39A36.} \endgroup \section{Introduction} The Somos--4 and Somos--5 equations are bilinear recurrences. Their iterates are Laurent polynomials in the initial values, a property that Fomin and Zelevinsky \cite[Theorem~1.8]{FZ} established for the two-term Gale--Robinson family. Hone \cite[Proposition~2.3]{Hone} gave explicit Somos--5 coefficients for a Somos--4 sequence in terms of its conserved quantity. Svinin \cite[Theorem~5.1]{GR} subsequently showed that Somos--4 sequences satisfy Gale--Robinson recurrences of each type with suitable coefficients. Hone, Roberts and Vanhaecke \cite[Section~4]{HRV} constructed a family of integrable maps associated with the Volterra lattice and obtained Somos--5 solutions from the genus-one map. Svinin \cite{Volterra} used discrete polynomials to express the associated recurrences in higher genus and exhibited the expression that later appeared in the conjectured invariant form \cite[Section~5]{Volterra}. He then proved Laurentness for a family of odd-order homogeneous recurrences and defined its even-order counterpart \cite[Sections~5.3--5.4]{S1}. Tang \cite{Tang} established Laurentness for the even orders. In Conjectures~5.2 and~5.3 of \cite{S1}, Svinin asked whether each even-order sequence satisfies the next odd-order recurrence and each odd-order sequence satisfies the next even-order recurrence, in each case with suitable constant coefficients. A second question concerns the recurrence in ratio coordinates. Svinin \cite[Theorem~2.12]{S2} constructed its invariants and in Conjecture~3.1 proposed an equivalent equation with those invariants as coefficients. He verified the first two cases. In earlier work, Svinin \cite[Section~5.3]{S0} derived the corresponding equation and parameter formulas under a conjectured discrete-polynomial identity, since proved in the \((1,1)\) specialization by the Trureturing project \cite{Trureturing}. Section~\ref{sec:equiv} gives the precise parameter correspondence. The earlier paper also established solution-space inclusions for the recurrences in its \(S\)-polynomial form \cite[Theorem~1]{S0}. We prove both adjacent-order inclusions for nonzero sequences, with explicit coefficient formulas. For unrestricted polynomial solutions we give counterexamples at every order. We also prove the invariant recurrence equivalence, with explicit recovery of the original coefficients. \section{Svinin's recurrences} Work over a field \(\kk\). For a sequence \((t_n)_{n\in\mathbb Z}\) with all entries nonzero, put \begin{equation}\label{eq:uw} w_n=\frac{t_nt_{n+2}}{t_{n+1}^2},\qquad u_n=w_nw_{n+1}=\frac{t_nt_{n+3}}{t_{n+1}t_{n+2}}. \end{equation} For integers \(p,q\) and \(k\geq1\), let \begin{equation}\label{eq:E} \E{k}{p}{q}= \sum_{\substack{p\leq i_1<\cdots0\), insert \(\lambda_1\) right steps before the first left step, \(\lambda_{j+1}-\lambda_j\) between left steps \(j\) and \(j+1\), and \(k+1-\lambda_k\) after the last. For \(k=0\) the walk is one right step. Thus the total unrestricted weight is \(S_{k+2}^k(c-k)\). If \(k