SearcharxivSearch

arXiv · 2510.16314

A transformal transcendence result for algebraic difference equations

Abstract

Given an algebraic difference equation of the form \[\sigma^n(y)=f\big(y, \sigma(y),\dots,\sigma^{n-1}(y)\big)\] where $f$ is a rational function over a field $k$ of characteristic zero on which $\sigma$ acts trivially, it is shown that if there is a nontrivial algebraic relation amongst any number of $\sigma$-disjoint solutions, along with their $\sigma$-transforms, then there is already such a relation between three solutions. Here ``$\sigma$-disjoint" means $a\neq\sigma^r(b)$ for any integer $r$. A weaker version of the theorem, where ``three" is replaced by $n+4$, is also obtained when $\sigma$ acts non-trivially on $k$. Along the way a number of other structural results about primitive rational dynamical systems are established. These theorems are deduced as applications of a detailed model-theoretic study of finite-rank quantifier-free types in the theory of existentially closed difference fields of characteristic zero. In particular, it is also shown that the degree of non-minimality of such types over fixed-field parameters is bounded by $2$.

Explore related subjects

Keep this discovery

BibTeXRIS

Moshe Kamensky, Rahim Moosa. 2025-10-18. A transformal transcendence result for algebraic difference equations. https://arxiv.org/abs/2510.16314

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO