Exponential Diophantine equations in rings of positive characteristic

From MaRDI portal
Publication:5111661

DOI10.1142/S0218216520400027zbMATH Open1442.11170arXiv1712.00508OpenAlexW3105436467WikidataQ115523473 ScholiaQ115523473MaRDI QIDQ5111661FDOQ5111661


Authors: A. A. Chilikov, A. Ya Belov Edit this on Wikidata


Publication date: 27 May 2020

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Abstract: In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive characteristic. Consider the system of exponential-Diophantine equations sumlimits_{i=1}^s P_{ij}(n_1,dots,n_t) b_{ij0} a_{ij1}^{n_1} b_{ij1} dots a_{ijt}^{n_t}b_{ijt}=0 where bijk,aijk are constants from matrix ring of characteristic p, ni are indeterminates. For any solution (n1,dots,nt) of the system we construct a word (over an alphabet containing pt symbols) overlinealpha0,dots,overlinealphaq where overlinealphai is a t-tuple langlen1(i),dots,nt(i)angle, n(i) is the i-th digit in the p-adic representation of n. The main result of this paper is as follows: the set of words corresponding in this sense to solutions of a system of exponential-Diophantine equations is a regular language (i.e. recognizable by a finite automaton). There exists an effective algorithm which calculates this language. This algorithm is constructed in the paper.


Full work available at URL: https://arxiv.org/abs/1712.00508




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Exponential Diophantine equations in rings of positive characteristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111661)