Related papers: Characterizing integers among rational numbers wit…

Let $m$ and $n$ be positive integers. For the quantum integer $[n]_q = 1 + q + ... + q^{n-1}$ there is a natural polynomial addition such that $[m]_q \oplus_q [n]_q = [m+n]_q$ and a natural polynomial multiplication such that $[m]_q…

It has been a well-known fact since Euclid's time that there exist infinitely many rational primes. Two natural questions arise: In which other rings, sufficiently similar to the integers, are there infinitely many irreducible elements? Is…

Some polynomials $P$ with rational coefficients give rise to well defined maps between cyclic groups, $\Z_q\longrightarrow\Z_r$, $x+q\Z\longmapsto P(x)+r\Z$. More generally, there are polynomials in several variables with tuples of rational…

A number field $k$ admits a binary integral quadratic form which represents all integers locally but not globally if and only if the class number of $k$ is bigger than one. In this case, there are only finitely many classes of such binary…

Let K be a ring and let A be a subset of K. We say that a map f:A \to K is arithmetic if it satisfies the following conditions: if 1 \in A then f(1)=1, if a,b \in A and a+b \in A then f(a+b)=f(a)+f(b), if a,b \in A and a \cdot b \in A then…

It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple…

We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…

In 2016 J. Koenigsmann refined a celebrated theorem of J. Robinson by proving that $\mathbb Q\setminus\mathbb Z$ is diophantine over $\mathbb Q$, i.e., there is a polynomial $P(t,x_1,\ldots,x_{n})\in\mathbb Z[t,x_1,\ldots,x_{n}]$ such that…

These lecture notes cover classical undecidability results in number theory, Hilbert's 10th problem and recent developments around it, also for rings other than the integers. It also contains a sketch of the authors result that the integers…

We prove that the algorithm for desingularization of algebraic varieties in characteristic zero of the first two authors is functorial with respect to regular morphisms. For this purpose, we show that, in characteristic zero, a regular…

Let $S$ be a subset of $\overline{\mathbb Z}$, the ring of all algebraic integers. A polynomial $f \in \mathbb Q[X]$ is said to be integral-valued on $S$ if $f(s) \in \overline{\mathbb Z}$ for all $s \in S$. The set $\text{Int}_{\mathbb…

We develop a general ring theory in the o-minimal setting culminating in a description of all the definable rings in an arbitrary o-minimal structure. We show that every definably connected ring with non-trivial multiplication defines an…

Let K be an expansion of either an ordered field or a valued field. Given a definable set X $\subseteq$ K^m let C(X) be the ring of continuous definable functions from X to K. Under very mild assumptions on the geometry of X and…

We introduce the notions of quantum characteristic and quantum flatness for arbitrary rings. More generally, we develop the theory of quantum integers in a ring and show that the hypothesis of quantum flatness together with positive quantum…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

In this paper we present an alternative approach to formalize the theory of logic programming. In this formalization we allow existential quantified variables and equations in queries. In opposite to standard approaches the role of answer…

In [1], finite associative rings wih identity and such that the set of all zero-divisors form and ideal M, called the Jacobson Radical, of cube zero and square non-zero, were constructed for all the characteristics. These rings are…

In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula…

In this paper, a new approximate syllogistic reasoning schema is described that expands some of the approaches expounded in the literature into two ways: (i) a number of different types of quantifiers (logical, absolute, proportional,…

In this paper, we prove the existence of a first-order definition of the polynomial ring over a nonprincipal ultraproduct of finite fields of unbounded cardinalities in its fraction field by a universal-existential formula in the language…