Hostname: page-component-745bb68f8f-s22k5 Total loading time: 0 Render date: 2025-01-13T21:56:16.423Z Has data issue: false hasContentIssue false
  • English
  • Français

Algorithms yield upper bounds in differential algebra

Part of: Computability and recursion theory Differential and difference algebra Model theory

Published online by Cambridge University Press:  29 September 2021

Wei Li ,
Alexey Ovchinnikov ,
Gleb Pogudin  and
Thomas Scanlon
Wei Li
Affiliation:
KLMM, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, No. 55, Zhongguancun East Road, Beijing 100190, China e-mail: liwei@mmrc.iss.ac.cn
Alexey Ovchinnikov*
Affiliation:
Department of Mathematics, CUNY Queens College, 65-30 Kissena Boulevard, Queens, NY 11367, USA Ph.D. Programs in Mathematics and Computer Science, CUNY Graduate Center, 365 Fifth Avenue, New York, NY 10016, USA
Gleb Pogudin
Affiliation:
Institut Polytechnique de Paris, LIX, CNRS, École Polytechnique, 1 rue Honoré d’Estienne d’Orves, 91120 Palaiseau, France Faculty of Computer Science, National Research University Higher School of Economics, Moscow, Russia e-mail: gleb.pogudin@polytechnique.edu
Thomas Scanlon
Affiliation:
Department of Mathematics, University of California—Berkeley, Berkeley, CA 94720-3840, USA email: scanlon@math.berkeley.edu
*
e-mail: aovchinnikov@qc.cuny.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that, if the algorithm is guaranteed to terminate on every input, then there is a computable upper bound for the size of the output of the algorithm in terms of the size of the input. We also generalize this to algorithms working with models of good enough theories (including, for example, difference fields).

We then apply this to differential algebraic geometry to show that there exists a computable uniform upper bound for the number of components of any variety defined by a system of polynomial PDEs. We then use this bound to show the existence of a computable uniform upper bound for the elimination problem in systems of polynomial PDEs with delays.

Keywords

delay PDEselimination of unknownsuniform boundsoracle machine

MSC classification

Primary: 12H05: Differential algebra 12H10: Difference algebra 03C10: Quantifier elimination, model completeness and related topics
Secondary: 03C60: Model-theoretic algebra 03D15: Complexity of computation (including implicit computational complexity)
Type
Article
Information
Canadian Journal of Mathematics , Volume 75 , Issue 1 , February 2023 , pp. 29 - 51
Check for updates
Copyright
© Canadian Mathematical Society 2021

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This work was partially supported by the NSF grants CCF-1564132, CCF-1563942, DMS-1760448, DMS-1760413, DMS-1853650, DMS-1853482, and DMS-1800492; the NSFC grants 11971029, 12122118 and 11688101; and the fund of Youth Innovation Promotion Association of CAS.

References

Bächler, T., Gerdt, V., Lange-Hegermann, M., and Robertz, D., Algorithmic Thomas decomposition of algebraic and differential systems. J. Symbolic Comput. 47(2012), no. 10, 1233–1266. https://doi.org/10.1016/j.jsc.2011.12.043 CrossRefGoogle Scholar
Blum, L., Cucker, F., Shub, M., and Smale, S., Complexity and real computation, Springer, New York, 1998. https://doi.org/10.1007/978-1-4612-0701-6CrossRefGoogle Scholar
Boulier, F., Lazard, D., Ollivier, F., and Petitot, M., Computing representations for radicals of finitely generated differential ideals. Appl. Algebra Engrg. Comm. Comput. 20(2009), 73–121. https://doi.org/10.1007/s00200-009-0091-7 CrossRefGoogle Scholar
Chapuis, O. and Koiran, P., Saturation and stability in the theory of computation over the reals. Ann. Pure Appl. Logic. 99(1999), no. 1, 1–49. https://doi.org/10.1016/S0168-0072(98)00060-8 Google Scholar
Gao, X.-S., Luo, Y., and Yuan, C., A characteristic set method for ordinary difference polynomial systems. J. Symbolic Comput. 44(2009), no. 3, 242–260. https://doi.org/10.1016/j.jsc.2007.05.005 CrossRefGoogle Scholar
Gao, X.-S., Van der Hoeven, J., Yuan, C.-M., and Zhang, G.-L., Characteristic set method for differential-difference polynomial systems. J. Symbolic Comput. 44(2009), no. 9, 1137–1163. https://doi.org/10.1016/j.jsc.2008.02.010 CrossRefGoogle Scholar
Gerdt, V. and Robertz, D., Algorithmic approach to strong consistency analysis of finite difference approximations to PDE systems. In: Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation (ISSAC’19), Bradford, R. ed., ACM Press, New York, 2019, 163–170. https://doi.org/10.1145/3326229.3326255CrossRefGoogle Scholar
Golubitsky, O., Kondratieva, M., Ovchinnikov, A., and Szanto, A., A bound for orders in differential Nullstellensatz. J. Algebra 322(2009), no. 11, 3852–3877. https://doi.org/10.1016/j.jalgebra.2009.05.032 CrossRefGoogle Scholar
Goode, J. B., Accessible telephone directories. J. Symb. Log. 59(1994), 92–105. https://www.jstor.org/stable/2275252 CrossRefGoogle Scholar
Gustavson, R., Kondratieva, M., and Ovchinnikov, A., New effective differential Nullstellensatz. Adv. Math. 290(2016), 1138–1158. http://doi.org/10.1016/j.aim.2015.12.021 Google Scholar
Harrison-Trainor, M., Klys, J., and Moosa, R., Nonstandard methods for bounds in differential polynomial rings. J. Algebra 360(2012), 71–86. https://doi.org/10.1016/j.jalgebra.2012.03.013 CrossRefGoogle Scholar
Heintz, J., Definability and fast quantifier elimination in algebraically closed fields. Theoret. Comput. Sci. 24(1983), no. 3, 239–277. https://doi.org/10.1016/0304-3975(83)90002-6 CrossRefGoogle Scholar
Kolchin, E., Differential algebra and algebraic groups, Academic Press,New York, 1973.Google Scholar
Léon Sánchez, O., On the model companion of partial differential fields with an automorphism. Israel J. Math. 212(2016), 419–442. https://doi.org/10.1007/s11856-016-1292-y CrossRefGoogle Scholar
León Sánchez, O., Estimates for the coefficients of differential dimension polynomials. Math. Comp. 88(2019), 2959–2985. https://doi.org/10.1090/mcom/3429 CrossRefGoogle Scholar
Léon Sánchez, O. and Moosa, R., The model companion of differential fields with free operators. J. Symb. Log. 81(2016), no. 2, 493–509. https://doi.org/10.1017/jsl.2015.76 CrossRefGoogle Scholar
Levin, A., Difference algebra, Algebra and Applications, 8, Springer,New York, 2008. https://doi.org/10.1007/978-1-4020-6947-5 CrossRefGoogle Scholar
Li, W., Ovchinnikov, A., Pogudin, G., and Scanlon, T.. Elimination of unknowns for systems of algebraic differential-difference equations, Trans. Amer. Math. Soc. 374(1):303–326, 2021. https://doi.org/10.1090/tran/8219CrossRefGoogle Scholar
Marker, D., Model theory: an introduction, Springer,New York, 2002. https://doi.org/10.1007/b98860 Google Scholar
McAloon, K., Petri nets and large finite sets. Theoret. Comput. Sci. 32(1984), nos. 1–2, 173–183. https://doi.org/10.1016/0304-3975(84)90029-X CrossRefGoogle Scholar
McGrail, T., The model theory of differential fields with finitely many commuting derivations. J. Symb. Log. 65(2000), no. 2, 885–913. https://doi.org/10.2307/2586576 Google Scholar
Mikhalev, A. V., Levin, A., Pankratiev, E., and Kondratieva, M., Differential and difference dimension polynomials, Mathematics and Its Applications, 461, Springer, Dordrecht, 1999. https://doi.org/10.1007/978-94-017-1257-6 Google Scholar
Moosa, R. and Scanlon, T., Model theory of fields with free operators in characteristic zero. J. Math. Log. 14(2014), no. 2, 1450009. https://doi.org/10.1142/s0219061314500093 CrossRefGoogle Scholar
Papadimitriou, C. H., Computational complexity, Pearson, New York, 1993.Google Scholar
Rust, C. J. and Reid, G. J., Rankings of partial derivatives. In: Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC’97), Küchlin, W., ed., ACM Press, New York, 1997, 9–16. https://doi.org/10.1145/258726.258737CrossRefGoogle Scholar
Simmons, W. and Towsner, H., Proof mining and effective bounds in differential polynomial rings. Adv. Math. 343(2019), 567–623. https://doi.org/10.1016/j.aim.2018.11.026 CrossRefGoogle Scholar
van den Dries, L. and Shmidt, K., Bounds in the theory of polynomial rings over fields. A nonstandard approach. Invent. Math. 76(1984), 77–91. https://doi.org/10.1007/BF01388493 CrossRefGoogle Scholar