English
Related papers

Related papers: S-unit equations in modules and linear-exponential…

200 papers

We show that for each n-tuple of positive rational integers (a_1,..,a_n) there are sets of primes S of arbitrarily large cardinality s such that the solutions of the equation a_1x_1+...+a_nx_n=1 with the x_i all S-units are not contained in…

Number Theory · Mathematics 2007-05-23 J. -H. Evertse , P. Moree , C. L. Stewart , R. Tijdeman

Let $S := \{p_1,\ldots ,p_{\ell}\}$ be a finite set of primes and denote by $\mathcal{U}_S$ the set of all rational integers whose prime factors are all in $S$. Let $(U_n)_{n\geq 0}$ be a non-degenerate linear recurrence sequence with order…

Number Theory · Mathematics 2023-02-28 P. K. Bhoi , S. S. Rout , G. K. Panda

Let $R$ be a ring and let $(a_1,\dots,a_n)\in R^n$ be a unimodular vector, where $n\geq 2$ and each $a_i$ is in the center of $R$. Consider the linear equation $a_1X_1+\cdots+a_nX_n=0$, with solution set $S$. Then $S=S_1+\cdots+S_n$, where…

Rings and Algebras · Mathematics 2021-12-28 Rachel Quinlan , Moumita Shau , Fernando Szechtman

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

Logic in Computer Science · Computer Science 2026-03-12 Ruiwen Dong , Doron Shafrir

In the first part we construct algorithms which we apply to solve S-unit, Mordell, cubic Thue, cubic Thue-Mahler and generalized Ramanujan-Nagell equations. As a byproduct we obtain alternative practical approaches for various classical…

Number Theory · Mathematics 2016-05-20 Rafael von Känel , Benjamin Matschke

Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…

Formal Languages and Automata Theory · Computer Science 2013-10-28 Artur Jeż , Alexander Okhotin

We show that for every finite set of prime numbers S, there are at most finitely many singular moduli that are S-units. The key new ingredient is that for every prime number p, singular moduli are p-adically disperse. We prove analogous…

Number Theory · Mathematics 2023-09-07 Sebastián Herrero , Ricardo Menares , Juan Rivera-Letelier

We generalize Dirichlet's $S$-unit theorem from the usual group of $S$-units of a number field $K$ to the infinite rank group of all algebraic numbers having nontrivial valuations only on places lying over $S$. Specifically, we demonstrate…

Number Theory · Mathematics 2012-10-31 Paul Fili , Zachary Miner

We show that there are only finitely many triples of integers $ 0 < a < b < c $ such that the product of any two of them is the value of a given polynomial with integer coefficients evaluated at an $ S $-unit that is also a positive…

Number Theory · Mathematics 2023-04-12 Clemens Fuchs , Sebastian Heintze

Let $p$ be a prime number, $K$ be the henselization of the rational functions over the finite field $\mathbb{F}_p$ and $R$ be the ring of additive polynomials over K. We show that the field of Laurent series over $\mathbb{F}_p$ is decidable…

Logic · Mathematics 2018-10-10 Gönenç Onay

Given a singular modulus $j_0$ and a set of rational primes $S$, we study the problem of effectively determining the set of singular moduli $j$ such that $j-j_0$ is an $S$-unit. For every $j_0 \neq 0$, we provide an effective way of finding…

Number Theory · Mathematics 2022-10-04 Francesco Campagna

In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…

Rings and Algebras · Mathematics 2020-05-12 A. A. Chilikov , A. Ya. Belov

In this paper, we prove two results related to the solutions of norm form equations. Firstly, we give a finiteness result for sums of terms of linear recurrence sequences appearing in the coordinates of solutions of norm form equations.…

Number Theory · Mathematics 2024-10-03 Darsana N , S. S. Rout

Let $h(x,y)$ be a non-degenerate binary cubic form with integral coefficients, and let $S$ be an arbitrary finite set of prime numbers. By a classical theorem of Mahler, there are only finitely many pairs of relatively prime integers $x,y$…

Number Theory · Mathematics 2015-01-27 Dohyeong Kim

We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…

Computational Complexity · Computer Science 2017-04-07 Joel Ouaknine , James Worrell

We give improved lower bounds for the number of solutions of some $S$-unit equations over the integers, by counting the solutions of some associated linear equations as the coefficients in those equations vary over sparse sets. This method…

Number Theory · Mathematics 2011-08-19 Adam J. Harper

We show that Submonoid Membership is decidable in n-dimensional lamplighter groups $(\mathbb{Z}/p\mathbb{Z}) \wr \mathbb{Z}^n$ for any prime $p$ and integer $n$. More generally, we show decidability of Submonoid Membership in semidirect…

Group Theory · Mathematics 2025-05-29 Ruiwen Dong

We discuss Mahler's work on Diophantine approximation and its applications to Diophantine equations, in particular Thue-Mahler equations, S-unit equations and S-integral points on elliptic curves, and go into later developments concerning…

History and Overview · Mathematics 2023-09-19 Jan-Hendrik Evertse , Kálmán Győry , Cameron L. Stewart

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

Formal Languages and Automata Theory · Computer Science 2024-06-04 Juha Honkala

Let $C_n=n2^n+1$ denote the $n$th Cullen number. There has been recent interest in finding all Cullen numbers having a given Diophantine property. We prove that, for a fixed integer $k$ and bounded integers $a_1,\ldots,a_k$, the greatest…

Number Theory · Mathematics 2026-05-28 Vikas Godara , Divyum Sharma
‹ Prev 1 2 3 10 Next ›