Exponential Diophantine equations in rings of positive characteristic

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

b_{i j k}, a_{i j k}

are constants from matrix ring of characteristic

p

,

n_{i}

are indeterminates. For any solution

(n_{1}, d o t s, n_{t})

of the system we construct a word (over an alphabet containing

p^{t}

symbols)

o v e r l i n e a l p h a_{0}, d o t s, o v e r l i n e a l p h a_{q}

where

o v e r l i n e a l p h a_{i}

is a

t

-tuple

l a n g l e n_{1}^{(i)}, d o t s, n_{t}^{(i)} a n g l e

,

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.

Recommendations

Cites work

Cited in

(1)

scientific article; zbMATH DE number 1567958 (Why is no real title available?)

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)