Apoloniusz Tyszka

Dr. Apoloniusz Tyszka

orcid

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications


1 July 2018 in Open Computer Science
Verified
Journal Article
Open access
PDF file
ATApoloniusz Tyszka
Apoloniusz Tyszka
We define a computable function f from positive integers to positive integers. We formulate a hypothesis which states that if a system S of equations of the forms xi· xj = xk and xi + 1 = xi has only finitely many solutions in non-negative integers x1, . . . , xi, then the solutions of S are bounded from above by f (2n). We prove the following: (1) the hypothesis implies that there exists an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the heights of integer (non-negative integer, positive integer, rational) solutions, if the solution set is finite; (2) the hypothesis implies that the question of whether or not a given Diophantine equation has only finitely many rational solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has a rational solution; (3) the hypothesis implies that the question of whether or not a given Diophantine equation has only finitely many integer solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has an integer solution; (4) the hypothesis implies that if a set M ⊆ N has a finite-fold Diophantine representation, thenMis computable.

1 August 2013 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
ATApoloniusz Tyszka
Apoloniusz Tyszka
Let En = {xi = 1; xi + xj = xk; xi · xj = xk : i; j; k ∈ {1,...,n}}. We conjecture that if a system $S \subseteq E_n$ has only finitely many solutions in integers x1,...,xn, then each such solution (x1,...,xn) satisfies |x1|,...,|xn| ≤ 22n−1. Assuming the conjecture, we prove: (1) there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set, (2) if a set $\cal{M} \subseteq \mathbb{N}$ is recursively enumerable but not recursive, then a finite-fold Diophantine representation of $\cal{M}$ does not exist.

1 January 2022 in Journal of Applied Computer Science & Mathematics
Verified
Journal Article
Open access
ATApoloniusz Tyszka
Apoloniusz Tyszka
Edmund Landau’s conjecture states that the set 𝓟𝒏𝟐+𝟏 of primes of the form 𝒏𝟐+𝟏 is infinite. La

29 March 2010 in Mathematical Logic Quarterly
Verified
Journal Article
Closed access
PDF file
ATApoloniusz Tyszka
Apoloniusz Tyszka