English
Related papers

Related papers: A general formula in Additive Number Theory

200 papers

Computing a basis for the exponent lattice of algebraic numbers is a basic problem in the field of computational number theory with applications to many other areas. The main cost of a well-known algorithm…

Symbolic Computation · Computer Science 2019-12-17 Tao Zheng

In this paper, we prove the finiteness of the number of integer solutions of the decomposable form inequalities. We also study the number of integer solutions of a sequence of decomposable form inequalities.

Number Theory · Mathematics 2007-05-23 Kalman Gyory , Min Ru

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

Rings and Algebras · Mathematics 2026-02-24 Vesselin Drensky

In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…

Combinatorics · Mathematics 2025-05-15 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

We present a general algorithm for solving all two-variable polynomial Diophantine equations consisting of three monomials. Before this work, even the existence of an algorithm for solving the one-parameter family of equations…

Number Theory · Mathematics 2023-07-07 Bogdan Grechuk , Tetiana Grechuk , Ashleigh Wilcox

We study the problem of Diophantine approximation on lines in R^2 with prime numerator and denominator.

Number Theory · Mathematics 2013-09-23 Stephan Baier , Anish Ghosh

For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. In this paper, for a sequence of integers $B=\{1<b_1<b_2<\cdots\}$ and $3b_1+5\leq b_2\leq 6b_1+10$, we determine the critical value for $b_3$ such that there exists an…

Number Theory · Mathematics 2020-05-20 Min Tang , Hongwei Xu

In this paper, we consider the problem about finding out perfect powers in an alternating sum of consecutive cubes. More precisely, we completely solve the Diophantine equation $(x+1)^3 - (x+2)^3 + \cdots - (x + 2d)^3 + (x + 2d + 1)^3 =…

Number Theory · Mathematics 2017-05-12 Pranabesh Das , Pallab Kanti Dey , B. Maji , S. S. Rout

Many results related to quantitative problems in the metric theory of Diophantine approximation are asymptotic, such as the number of rational solutions to certain inequalities grows with the same rate almost everywhere modulo an asymptotic…

Number Theory · Mathematics 2024-03-01 Ying Wai Lee , Andrew Scoones

We prove a refined version of Markov's theorem in Diophantine approximation. More precisely, we characterize completely the set of irrationals $x$ such that $\left|x-\frac{p}{q}\right|<\frac{1}{3q^2}$ has only finitely many rational…

Number Theory · Mathematics 2026-02-11 Zhe Cao , Harold Erazo , Carlos Gustavo Moreira

A sequence of integers of the form $\lfloor n^{\alpha}\rfloor$ $(n=1,2,\ldots)$ for some fixed non-integral $\alpha>1$ is called a Piatetski-Shapiro sequence, where $\lfloor x\rfloor$ denotes the integer part of $x$. Let…

Number Theory · Mathematics 2025-09-11 Kota Saito

In this paper we propose a method of solving a Nonlinear Diophantine Equation by converting it into a System of Diophantine Linear Equations.

General Mathematics · Mathematics 2009-10-14 Florentin Smarandache

We give upper and lower bounds for the largest integer not representable as positive linear combination of three given integers, disproving an upper bound conjectured by Beck, Einstein and Zacks.

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

This paper is devoted to the study of a problem of Cassels in multiplicative Diophantine approximation which involves minimising values of a product of affine linear forms computed at integral points. It was previously known that values of…

Number Theory · Mathematics 2016-01-15 Alexander Gorodnik , Pankaj Vishe

We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…

Number Theory · Mathematics 2007-05-23 Iskander Aliev , Martin Henk

We associate in a canonical way a substitution to any abstract numeration system built on a regular language. In relationship with the growth order of the letters, we define the notion of two independent substitutions. Our main result is…

Combinatorics · Mathematics 2009-07-28 Fabien Durand , Michel Rigo

We consider the problem of existential quantifier elimination for Boolean formulas in Conjunctive Normal Form (CNF). We present a new method for solving this problem called Derivation of Dependency-Sequents (DDS). A Dependency-sequent…

Logic in Computer Science · Computer Science 2013-06-04 Eugene Goldberg , Panagiotis Manolios

In this paper we discuss a general problem on metrical Diophantine approximation associated with a system of linear forms. The main result is a zero-one law that extends one-dimensional results of Cassels and Gallagher. The paper contains a…

Number Theory · Mathematics 2015-05-13 Victor Beresnevich , Sanju Velani

We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is…

History and Overview · Mathematics 2010-06-22 Chris Preston