Related papers: Division by zero
We study systems of functional equations whose solutions can be parameterized in function of one variable; our main result proves that the partition regularity (PR) of such systems can be completely characterized by the existence of…
In 1974, M. B. Nathanson proved that every irrational number $\alpha$ represented by a simple continued fraction with infinitely many elements greater than or equal to $k$ is approximable by an infinite number of rational numbers $p/q$…
We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…
We consider the problem of Diophantine approximation on semisimple algebraic groups by rational points with restricted numerators and denominators and establish a quantitative approximation result for all real points in the group by…
We separate the criticisms of Hodges \cite{Hodges2005} and others into those against the algorithm itself and those against its physical implementation. We then point out that {\em all} those against the algorithm are either misleading or…
We show that ${\mathbb Z}$ is definable in ${\mathbb Q}$ by a universal first-order formula in the language of rings. We also present an $\forall\exists$-formula for ${\mathbb Z}$ in ${\mathbb Q}$ with just one universal quantifier. We…
Diophantine equations are a popular and active area of research in number theory. In this paper we consider Mordell equations, which are of the form $y^2=x^3+d$, where $d$ is a (given) nonzero integer number and all solutions in integers…
In this paper, we consider the indefinite fractional elliptic problem. A corresponding Liouville-type theorem for the indefinite fractional elliptic equations is established. Furthermore, we obtain a priori bound for solutions in a bounded…
Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…
Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…
We show that existence of positive Lyapounov exponents and/or SRB measures are undecidable (in the algorithmic sense) properties within some parametrized families of interesting dynamical systems: quadratic family and H\'enon maps. Because…
Wirsing's theorem on approximating algebraic numbers by algebraic numbers of bounded degree is a generalization of Roth's theorem in Diophantine approximation. We study variations of Wirsing's theorem where the inequality in the theorem is…
In computable analysis testing a real number for being zero is a fundamental example of a non-computable task. This causes problems for division: We cannot ensure that the number we want to divide by is not zero. In many cases, any real…
Let $p$ and $q$ be polynomials with degree $2$ over an arbitrary field $\mathbb{F}$. In the first part of this article, we characterize the matrices that can be decomposed as $A+B$ for some pair $(A,B)$ of square matrices such that $p(A)=0$…
The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…
The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for…
In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…
We give criteria of the solvability of the diophantine equation $p=x^2+ny^2$ over some imaginary quadratic fields where $p$ is a prime element. The criteria becomes quite simple in special cases.
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
We show that for any class of Boolean algebras with an associative operator, if it contains the complex algebra of (P(N), U), its equational theory is undecidable. Equivalently, any associative normal modal logic valid over the frame (P(N),…