Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Consistent systems of linear differential and difference equations (1605.02616v2)

Published 9 May 2016 in math.CA

Abstract: We consider systems of linear differential and difference equations \begin{eqnarray*} \partial Y(x) =A(x)Y(x), \sigma Y(x) =B(x)Y(x) \end{eqnarray*} with $\partial = \frac{d}{dx}$, $\sigma$ a shift operator $\sigma(x) = x+a$, $q$-dilation operator $\sigma(x) = qx$ or Mahler operator $\sigma(x) = xp$ and systems of two linear difference equations \begin{eqnarray*} \sigma_1 Y(x) =A(x)Y(x), \sigma_2 Y(x) =B(x)Y(x) \end{eqnarray*} with $(\sigma_1,\sigma_2)$ a sufficiently independent pair of shift operators, pair of $q$-dilation operators or pair of Mahler operators. Here $A(x)$ and $B(x)$ are $n\times n$ matrices with rational function entries. Assuming a consistency hypothesis, we show that such system can be reduced to a system of a very simple form. Using this we characterize functions satisfying two linear scalar differential or difference equations with respect to these operators. We also indicate how these results have consequences both in the theory of automatic sets, leading to a new proof of Cobham's Theorem, and in the Galois theories of linear difference and differential equations, leading to hypertranscendence results.

Summary

We haven't generated a summary for this paper yet.