English
Related papers

Related papers: Two Answers to a Common Question on Diagonalizatio…

200 papers

We generalize Dirichlet's diophantine approximation theorem to approximating any real number $\alpha$ by a sum of two rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2}$ with denominators $1 \leq q_1, q_2 \leq N$. This turns out to be…

Number Theory · Mathematics 2007-05-23 Tsz Ho Chan

Noncommutative surfaces finite over their centres can be realised as orders over surfaces. The aim of this paper is to present a noncommutative generalisation of rational singularities, which we call numerical rationality, for such orders.…

Algebraic Geometry · Mathematics 2009-12-01 Kenneth Chan

Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…

Logic · Mathematics 2024-11-20 Pedro Hack , Daniel A. Braun , Sebastian Gottwald

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

Logic · Mathematics 2020-06-23 Sam Sanders

We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.

Logic · Mathematics 2015-06-26 Eudes Naziazeno

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

Logic · Mathematics 2023-09-28 Marco Barone , Nicolás Caro-Montoya , Eudes Naziazeno

We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…

Optimization and Control · Mathematics 2022-04-15 Daniel Bienstock , Alberto del Pia , Robert Hildebrand

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…

Logic · Mathematics 2020-05-22 Marco Barone , Nicolás Caro , Eudes Naziazeno

We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…

Number Theory · Mathematics 2007-05-23 Tsz Ho Chan

In the present article, modeling certain rational numbers, that are represented in terms of Cantor series, are described. The statements on relations between digits in the representations of rational numbers by Cantor series (for the case…

Number Theory · Mathematics 2021-01-05 Symon Serbenyuk

<p>We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consider methods of establishing such assertions using only restricted…

Logic in Computer Science · Computer Science 2017-01-11 Jeremy Avigad , Harvey Friedman

Danos and Regnier introduced generalized (non-binary) multiplicative connectives in Danos and Regnier [2]. They showed that there exist generalized multiplicative connectives that cannot be defined by any combination of the tensor and par…

Logic · Mathematics 2026-01-28 Yuki Nishimuta

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…

Number Theory · Mathematics 2026-03-23 Kathrin Bringmann , Min-Joo Jang , Ben Kane , Cheuk Hin Alvin Tse

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

Number Theory · Mathematics 2015-05-13 Damien Roy

The article is devoted to the investigation of representation of rational numbers by Cantor series. Necessary and sufficient conditions for a rational number to be representable by a positive Cantor series are formulated for the case of an…

Number Theory · Mathematics 2019-04-23 Symon Serbenyuk

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

General Mathematics · Mathematics 2011-03-04 N. A. Carella

This paper presents geometric proofs for the irrationality of square roots of select integers, extending classical approaches. Building on known geometric methods for proving the irrationality of sqrt(2), the authors explore whether similar…

History and Overview · Mathematics 2024-10-21 Zongyun Chen , Steven J. Miller , Chenghan Wu

We take quantum theory and replace $\mathbb{C}$ by $\mathbb{C}[\varepsilon]$ where $\varepsilon^2=0$, i.e. we extend quantum theory to the ring of dual complex numbers. The aim is to develop a common language in which to treat continuous…

Quantum Physics · Physics 2026-03-19 P. Arrighi , D. Bakircioglu , N. L. Houyet

Today, science have a powerful tool for the description of reality - the numbers. However, the concept of number was not immediately, lets try to trace the evolution of the concept. The numbers emerged as the need for accurate estimates of…

Artificial Intelligence · Computer Science 2011-10-14 Elena S. Vishnevksaya