SearcharxivSearch

arXiv · 1710.03304

Algebraic relations between solutions of Painlev\'e equations

Abstract

In this manuscript we make major progress classifying algebraic relations between solutions of Painlev\'e equations. Our main contribution is to establish the algebraic independence of solutions of various pairs of equations in the Painlev\'e families; for generic coefficients, we show all algebraic relations between solutions of equations in the same Painlev\'e family come from classically studied B{\"a}cklund transformations. We also apply our analysis of ranks to establish some transcendence results for pairs of Painlev\'e equations from different families. In that area, we answer several open questions of Nagloo (2016), and in the process answer a question of Boalch (2012). We calculate model theoretic ranks of all Painlev\'e equations in this article, extending results of Nagloo and Pillay (2017). We show that the type of the generic solution of any equation in the second Painlev\'e family is geometrically trivial, extending a result of Nagloo (2015). We give the first model theoretic analysis of several special families of the third Painlev\'e equation, proving results analogous to Nagloo and Pillay (2017). We also give a novel new proof of the irreducibility of the third, fifth and sixth Painlev\'e equations using recent work of Freitag, Jaoui, and Moosa (2022). Our proof is fundamentally different than the existing transcendence proofs of Watanabe (1998) or Cantat and Loray (2009).

Explore related subjects

Keep this discovery

BibTeXRIS

James Freitag, Joel Nagloo. 2017-10-09. Algebraic relations between solutions of Painlev\'e equations. https://arxiv.org/abs/1710.03304

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