2021
DOI: 10.48550/arxiv.2106.02627
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Generic differential equations are strongly minimal

Abstract: In this manuscript we develop a new technique for showing that a nonlinear algebraic differential equation is strongly minimal based on the recently developed notion of the degree of nonminimality of Freitag and Moosa. Our techniques are sufficient to show that generic order h differential equations with nonconstant coefficients are strongly minimal, answering a question of Poizat (1980).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4

Relationship

3
1

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 21 publications
0
5
0
Order By: Relevance
“…Establishing the notion has been the key step to resolving a number of longstanding open conjectures [6,49]. Despite these factors, there are few enough equations for which the property has been established that a comprehensive list of such equations appears in [13]. In this manuscript, we generalize results of Poizat [57] and Brestovski [4] by showing that Theorem.…”
mentioning
confidence: 79%
See 1 more Smart Citation
“…Establishing the notion has been the key step to resolving a number of longstanding open conjectures [6,49]. Despite these factors, there are few enough equations for which the property has been established that a comprehensive list of such equations appears in [13]. In this manuscript, we generalize results of Poizat [57] and Brestovski [4] by showing that Theorem.…”
mentioning
confidence: 79%
“…First, once strong minimality of an equation is established, the trichotomy theorem, a model theoretic classification result, along with other model theoretic results can often be employed in powerful ways [27,49]. Second, among nonlinear differential equations, the property seems to hold rather ubiquitously; in fact there are theorems to this effect in various settings [13,28]. Even for equations which are not themselves minimal, there is a well-known decomposition technique, semi-minimal analysis 1 [46], which often allows for the reduction of questions to the minimal case.…”
mentioning
confidence: 99%
“…In the theory of differentially closed fields of characteristic zero, Freitag and Moosa [8] give an upper bound for the degree of nonminimality in terms of the U-rank of the type. In [4], DeVilbiss and Freitag use the bounds of [8] along with computations involving the Lascar rank of underdetermined systems of differential equations to give a proof of the strong minimality of generic differential equations of sufficiently high degree. One of the challenging aspects of generalizing the proofs of [4] to various other classes of equations is the complexity of the series of algebraic reductions used to calculate the rank of a certain associated linear system.…”
Section: Nonminimalitymentioning
confidence: 99%
“…These results are especially pertinent because many of the number theoretic functions to which the Pila-Wilkie theorem has been applied have been shown to be strongly minimal in recent years. For these as well as various other strong minimality results on nonlinear higher order differential equations, see [7,8,10,11,15,19,28,34]. Besides results for specific equations, as [11,19] indicate, strong minimality is a pervasive condition for nonlinear differential equations of order at least two -it holds generically both in the space of constant coefficient equations as well as the space of nonconstant equations.…”
mentioning
confidence: 93%