betaFeedback

WorksMathematics

On quantitative aspects of ideal membership certificate and GCD inequality for polynomials evaluated at almost units

Abstract

In this paper, we obtain an effective bounds for the ideal membership certificate in polynomial rings over almost all rings of S-integers, thereby generalizing results of Aschenbrenner and Evertse and Gyory. We also establish an effective refinement of a result of Xiao, building on earlier work of Levin and Corvaja and Zannier. In particular, we provide explicit bounds for both the number and the total degrees of the exceptional hypersurfaces arising in an inequality that bounds the greatest common divisor of multivariable polynomials evaluated at almost S-units under consideration. As an application of our results, we obtain an effective refinement of a theorem of Corvaja and Zannier: Let (Fn)n(F_n)_n and (Gn)n(G_n)_n be two linear recurrence sequences and N\mathcal{N} be the set of positive integers nn such that Fn/GnF_n/G_n is an integer. Hadamard quotient theorem, conjectured by Pisot and proven by Van der Poorten states that if the set N\mathcal{N} coincides with N\mathbb{N} then (Fn/Gn)n\left(F_n/G_n\right)_n is itself linear recurrence sequence. Corvaja-Zannier proved that if N\mathcal{N} is infinite set, then there exists a nonzero polynomial P(X)P(X) such that (P(n)Fn/Gn)n\left( P(n)F_n/G_n\right)_n agrees with a linear recurrence sequence for all nn in a suitable arithmetic progression. We give an explicit bound CC, depending explicitly on the parameters of the recurrence sequences such that, the conclusion holds if N\mathcal{N} contains at least CC elements.

Introduction and main results.

We investigate two related questions: the complexity of the ideal membership problem for polynomial rings over the ring of SS-integers and quantitative aspects of the greatest common divisor of polynomials evaluated at almost units.

On the complexity of the ideal membership problem for polynomial rings.

The study of the complexity of ideal membership in polynomial rings over a field was motivated by a project of Hentzelt and Noether [37], which aimed to establish bounds for fundamental operations in commutative algebra. In this direction, Hermann [38] gave, in 1926, a bound for the complexity of the ideal membership problem for polynomial rings over a field by proving the following result: Given f0,…,fn∈F[x1,…,xN]f_0,\ldots,f_n \in F[x_1,\ldots,x_N] of total degree at most dd over a field FF. If f0∈⟨f1,…,fn⟩f_0 \in\langle f_1,\ldots,f_n\rangle, then

f0=f1g1+⋯+fngnf_0=f_1g_1+\cdots+f_ng_n

Date: November 10, 2026.

2020 Mathematics Subject Classification. 11D75, 11D45, 11J87, 11B37.

Key words and phrases. multi-recurrences, effective Diophantine geometry and geometry of numbers. for certain g1,⋯ ,gn∈F[x1,⋯ ,xN]g_1,\cdots,g_n \in F[x_1,\cdots,x_N] whose degrees are bounded by an explicit constant β(N,d)\beta(N,d) only depending on NN and dd (not on the polynomials f1,⋯ ,fnf_1,\cdots,f_n and the field FF). Although Hermann’s original proof was incomplete, Seidenberg [64] subsequently supplied a complete proof in 1974. Renschuch [61] later showed that one may take

β(N,d)=(2d)2N.\beta(N,d)=(2d)^{2^N}.

Mayr and Meyer [55] proved that this bound is essentially optimal in the sense that the doubly exponential growth is unavoidable. However, Sharper bounds are available in special cases. When f0=1f_0=1, Kollár [40], using Hilbert’s Nullstellensatz, obtained the bound (2d)2N(2d)^{2^N} for d>2d>2; for d=2d=2 Sombra [69] established the bound 2N+12^{N+1}. Further improvements are possible under additional geometric hypotheses on the variety defined by ⟨f1,⋯ ,fn⟩\langle f_1,\cdots,f_n\rangle, for instance, hypotheses controlling its dimension.

A fundamental question raised by Kronecker (see [23]) in the context of constructive mathematics is whether there exists an effective procedure for deciding ideal membership in polynomial rings over Z\mathbb{Z}. This problem has been studied extensively; see, for instance, [7], [24], and [8]. In the broader context of deciding the truth of universal sentences in classes of commutative rings, Simmons [68] provided a nondeterministic algorithm (in other words, a procedure that is not primitive recursive, in the sense that it uses an unbounded loop such as ”while”) to decide whether a given polynomial f0∈Z[x1,⋯ ,xN]f_0 \in\mathbb{Z}[x_1,\cdots,x_N] belongs to a given ideal of Z[x1,⋯ ,xN]\mathbb{Z}[x_1,\cdots,x_N] generated by polynomials f1,⋯ ,fnf_1,\cdots,f_n. The question of finding a primitive recursive procedure (i.e., a procedure that can be obtained using only the loop ”for”) for this task is commonly referred to as the Kronecker problem. To address this problem, Gallo and Mishra [34] adapted Buchberger’s algorithm for the construction of Gröbner bases and obtained a primitive recursive procedure for deciding the ideal membership problem for polynomials in NN variables over Z\mathbb{Z}, thereby answering Kronecker’s problem. By analyzing their algorithm, they obtained the following bound on its complexity:

W4N+8(h(f0)+⋯+h(fn)+N),W_{4N+8}(h(f_0)+\cdots+h(f_n)+N),

where h(⋅)h(\cdot) is the logarithm Weil function that we will define in § 2 and WkW_k is often call the kkth Wainer hierachy function (see [71]). For the initial terms, we have

w0(n)=n+1,w1(n)=2n+1,w2(n)=2nw_0(n)=n+1,\quad w_1(n)=2n+1,\quad w_2(n)=2^n

and w3w_3 is comparable to the nn-times iterated exponential function. Clearly, this function grows extremely rapidly: depending on the indexing convention, the initial levels describe elementary growth rates, while higher levels eventually dominate iterated exponential functions of increasing height. Thus, although the procedure is primitive recursive, its complexity bound is very large and not explicit.

Notice that a fundamental difference between the ideal membership problem over a field and that over Z\mathbb{Z} is that, in the former setting, Hermann’s degree bound is uniform in the coefficients of the input polynomials. Over Z\mathbb{Z}, by contrast, the bound for some ideal membership certificates can not depend only on the number of variables and the degrees of the input polynomials. The following example, due to Aschenbrenner [6], illustrates the necessity of incorporating arithmetic information into such bounds. Let m>1m>1 and d≥1d\ge1 be integers. We have

1∈⟨1−mX,mdX⟩1\in\langle1-mX,m^dX\rangle

meaning that 11 belongs to the ideal of Z[X]\mathbb{Z}[X] generated by 1−mX1-mX and mdXm^dX since

1=(1−mX)(1+mX+⋯+(mX)d−1)+Xd−1mdX.1=(1-mX)(1+mX+\cdots+(mX)^{d-1})+X^{d-1}m^dX.

Using the fact that 1−mX1-mX is unit in (Z/mdZ)[X](\mathbb{Z}/m^d\mathbb{Z})[X], it follows that, if

1=(1−mX)g1+mdXg21=(1-mX)g_1+m^dXg_2

then max⁡{deg⁡g1,deg⁡g2}≥d−1\max\{\deg g_1,\deg g_2\}\ge d-1 which give us the desired result.

To obtain explicit bounds for the degrees of ideal membership certificates over Z\mathbb{Z}, Aschenbrenner [6] established the following result.

Theorem 1. Let f0,…,fn∈Z[x1,…,xN]f_0,\ldots,f_n\in\mathbb{Z}[x_1,\ldots,x_N] be the polynomials with

f0∈⟨f1,…,fn⟩f_0\in\langle f_1,\ldots,f_n\rangle

whose their total degrees are at most dd and logarithm Weil height of f1,…,fnf_1,\ldots,f_n (define in section 2) are at most hh, then

f0=g1f1+⋯+gnfnf_0=g_1f_1+\cdots+g_nf_n

for certain polynomials g1,…,gn∈Z[x1,…,xN]g_1,\ldots,g_n\in\mathbb{Z}[x_1,\ldots,x_N] of degree at most

γ(N,d,h)=(2d)2O(Nlog⁡N+1)(h+1).\gamma(N,d,h)=(2d)^{2^{O(N\log N+1)}}(h+1).

The constant hidden in the OO-notation in γ\gamma is explicit. Evertse and Győry [29 Theorem 6.1.2] combined Aschenbrenner’s result (Theorem 1) with the result of Borosh et al. [13] to obtain a deterministic algorithm for the ideal membership problem for polynomial rings over Z\mathbb{Z}, together with an explicit bound for the complexity.

In what follows, we extend Aschenbrenner’s result to the following setting. Let KK be a number field of degree dd and SS be a finite set of places of KK containing all archimedean places and the nonarchimedean places corresponding to prime ideals dividing a set of integral ideals representing the ideal classes of the class group of KK. Let P1,…,Pt\mathcal{P}_1,\ldots,\mathcal{P}_t denote the prime ideals corresponding to the finite places in SS and set

QS=N(P1⋯Pt),Q_S=N(\mathcal{P}_1\cdots\mathcal{P}_t),

where N(⋅)N(\cdot) denotes the norm function on KK. Let S∞S_\infty be the set of all archimedean places of KK. Finally, set

c4:=87d!d−1dlog⁡d.c_4:=87d!\sqrt{d-1}d\log d.

From [12 Proposition 5.3.6, Chap V], it is clear that OS\mathcal{O}_S is a principal ideal domain. Let m,nm,n be two positive integers and a=max⁡{m,n}a=\max\{m,n\}. We set D=OS[X1,…,XN]D=\mathcal{O}_S[X_1,\ldots,X_N]. Let AA be an m×nm\times n-matrix with entries aij∈Da_{ij}\in D, and let b∈Dmb\in D^m be a column vector. Let UU be the maximum of the total degrees of the entries aija_{ij} and the coordinates of bb, and put h:=hhom⁡(1,aij,bi∣(i,j)∈{1,…,m}×{1,…,n})h:=h^{\operatorname{hom}}(1,a_{ij},b_i\mid(i,j)\in\{1,\ldots,m\}\times\{1,\ldots,n\}) be the homogeneous logarithm height of the vectors formed by all the coefficients of aij,bia_{ij},b_i and 11 (see section 2, for definition the homogeneous logarithm height). We denote by RKR_K the regulator of KK and hKh_K the class number of KK.

Theorem 2. If the system AX=bAX=b has a solution in DnD^n, then it admits a solution whose coordinates have total degrees at most

C:=γ1⋅3(a(N+U+γN))3log⁡(a(N+U+γN))(h+T+1),C:=\gamma_1\cdot3\left(a\left(\frac{N+U+\gamma}{N}\right)\right)^3\log\left(a\left(\frac{N+U+\gamma}{N}\right)\right)(h+T+1),

where

γ1=d323N(2(a+1)⋅U)23N+1(N+1)N\gamma_1=d3^{2^{3N}}(2(a+1)\cdot U)^{2^{3N+1}(N+1)^N}

and

γ=(2(a+1)⋅U)2((N+1)N−1)\gamma=(2(a+1)\cdot U)^{2((N+1)^N-1)}

and

T=c4RK+hKlog⁡QS.T=c_4R_K+h_K\log Q_S.

If S=S∞S=S_\infty, then we replace TT by c4RK+1c_4R_K+1.

Remark 1. Aschenbrenner [6, Theorem 6.5] established a non-effective analogue of Theorem 2 when OS\mathcal{O}_S is replaced by the ring of algebraic integers OK\mathcal{O}_K of the number field KK. The non-effectivity arises from his reliance on [6 Lemma 1.4], whose proof uses a qualitative result of Lang [41, Chapter V, Theorem 1].

A related problem is to obtain explicit height bounds for solutions of systems of homogeneous linear equations over rings of integers. Siegel initiated this line of research by proving what is now known as Siegel’s lemma in the case OK=Z\mathcal{O}_K=\mathbb{Z}. Bombieri and Vaaler [11] subsequently extended this result to number fields, obtaining a basis constitute of elements in OKN\mathcal{O}_K^N of the subspace VV associated with the system, whose such elements are bounded in height in terms of the discriminant of KK. Results of Roy and Thunder [62] and Masser [53] show that the dependence on the discriminant in the Bombieri–Vaaler bounds is essentially optimal.

We extend this line of investigation in the following setting. Let m,nm,n be two positive integers and a=max⁡{m,n}a=\max\{m,n\}. Let AA be an m×nm\times n-matrix with entries aij∈OSa_{ij}\in\mathcal{O}_S. Define the OS\mathcal{O}_S-module of solutions of the associated homogeneous system by

References

  1. [1]L. M. Adelman, C. Pomerance, R. S. Rumely, On distinguishing prime numbers from composite numbers. Ann. Math. 117 (1), 173 – 206 (1983).
  2. [2]M. Agrawal, S. Akshay, B. Genest, and P. S. Thiagarajan, Approximate verification of the symbolic dynamics of Markov chains, J. ACM 62(1) (2015) 2:1 – 2:34.
  3. [3]N. Ailon, Z. Rudnick, Torsion points on curves and common divisors of aᵏ − 1 and bᵏ − 1. Acta Arith., 113 (1), 31 – 38 (2004).DOI
  4. [4]S. Ahlgren, The set of solutions of a polynomial-exponential equation, Acta Arith. 87 (1999), 189–207.DOI
  5. [5]F. Amoroso and E. Viada, On the zeros of linear recurrence sequences. Acta Arith. 147 (4) (2011), 387 – 396.
  6. [6]M. Aschenbrenner Ideal membership in polynomial ring over the integers, J. Amer. Math. Soc. 17(2) (2004), 407 – 441.DOI
  7. [7]C. Ayoub, On constructing bases for ideals in polynomial rings over the integers, J. Numb. Theory 17 (1983), no. 2, 204 – 225.DOI
  8. [8]W. Baur, Rekursive Algebren mit Kettenbedingungen. Z. Math. Logik Grundlagen Math., 20(1974), 37 – 46.
  9. [9]J. Berstel, and M. Mignotte Deux propriétés décidables des suites récurrentes linéaires. Bull. Soc. Math. France 104 (1976).
  10. [10]F. Beukers and C. Smyth, F, Cyclotomic points on curves. Proceedings of the Millennial Conference in Urbana-Champaign, 2002.
  11. [11]E. Bombieri and J. Vaaler, On Siegel’s lemma, Invent. Math.,73 (1983), 11 – 32.DOI
  12. [12]E. Bombieri and W. Gubler, Heights in Diophantine geometry, Cambridge university press, 2006.
  13. [13]I. Borosh , M. Flahive, D. Rubin, and B. Treybig, A sharp bound for solutions of linear Diophantine equations, Proc. Amer. Math. Soc., 105 (1989), 844 – 846.
  14. [14]Y. Bugeaud, K. Győry and K. Yu, Bounds for the solutions of unit equations, Acta Arith., 74 (1996), 67 – 80.
  15. [15]Y. Bugeaud, P. Corvaja and U. Zannier, An upper bound for the G. C. D. of aⁿ − 1 and bⁿ − 1, Math. Z., 243(1), 79 – 84 (2003).
  16. [16]J. W. S. Cassels, An introduction to the geometry of numbers, Springer, 1959.
  17. [17]P. Corvaja and U. Zannier, On the number of integral points on algebraic curves, J. reine angew. Math., 565 (2003), 27 – 42.
  18. [18]P. Corvaja and U. Zannier, On the greatest prime factor of (ab + 1)(ac + 1), Proc. Amer. Math. Soc., 131(6), 1705 – 1709 (2003).
  19. [19]P. Corvaja and U. Zannier, A lower bound for the height of a rational function at S-unit points, Monatsh. Math., 144(3), 203 – 224 (2005).
  20. [20]P. Corvaja and U. Zannier, Finiteness of integral value for the ratio of two linear recurrence, Invent. math., 149(3), 431 – 451 (2002).
  21. [21]P. Corvaja and U. Zannier, Some cases of Vojta’s conjecture on integral points over function fields, J. Algebraic Geom. 17 (2008), p. 295–333. Addendum in Asian Journal of Math., 14(2010), p. 581 – 584
  22. [22]P. Corvaja and U. Zannier, On the maximal order of a torsion point on a curve in Gₘⁿ, Rend. Lincei Mat. Appl. 19 (2008): 73 – 78, 2010.
  23. [23]H. M. Edwards, Kronecker’s views on the foundations of mathematics. The History of Modern Mathematics, Vol. I (Kurekhepsie, NY, 1989), Academic Press, Boston, MA, 1989, P. 67–77.DOI
  24. [24]T. Evans Some connections between residual finiteness, finite embeddability and the word problem, J. London Math. Soc. (2)1 (1969), 399 – 403.
  25. [25]J.-H. Evertse, On sums of S-units and linear recurrences. Compos. Math. 53(2) (1984), 225–244.
  26. [26]J.-H. Evertse, An improvement of the quantitative Subspace Theorem, Compos. Math. 101(3) (1996), 225–311.
  27. [27]J.-H. Evertse and R. G. Ferretti, An further improvement of the quantitative Subspace Theorem, Ann. of Math., 177 (2023), 513–590.
  28. [28]J.-H. Evertse and H. P. Schlickewei, A quantitative version of the absolute Subspace Theorem, J. Reine. Angew. Math., 548 (2002), 21–127.
  29. [29]J.-H. Evertse and K. Győry, Effective results and methods for Diophantine equations over finitely generated domains, London Math. Soc. Lecture Note Ser. 475, Cambridge University Press, Cambridge, 2022.
  30. [30]G. Faltings and G. Wüstholz, Diophantine approximation on projective space, Invent. Math., 116 (1994), 109–138.
  31. [31]C. Fuchs and S. Heintze, On the growth of multi-recurrences. Arch. Math. (Basel) 119 (2022), 489–494.DOI
  32. [32]C. Fuchs and S. Heintze, On the growth of linear recurrences in function fields. Bull. Austr. Math. Soc. 104(1) (2021).
  33. [33]C. Fuchs and A. Noubissie, On Growth of Multi-recurrences. Journ. Number Theory 293 (2027), 105 – 127.
  34. [34]G. Gallo and B. Mishra, T. Evans A solution to Kronecker’s problem, Appl. Algebra in Engrg. Comm. Comput. 5 (1994), no. 6, 343 – 370.DOI
  35. [35]N. Grieve and J. Wang, Greatest common divisors with moving targets and consequences for linear recurrence sequences. Trans. American Math. Soc., 373 (2020), 8095 – 8126.
  36. [36]K. Győry and K. Yu, Bounds for the solutions of S-unit equations and decomposable form equations, Acta Arith., 126 (2006), 9 – 41.
  37. [37]K. Hentzelt and E. Noether, Zur Theorie der Polynomidale und Resultanten. Math. Ann. 88(1923), 53–79.DOI
  38. [38]G. Hermann, die frage der endlich vielen schritte in der theorie der polynomideale, Math. Ann., 95 (1926), 736–788.DOI
  39. [39]S. Hernández, F. Luca, On the largest prime factor of (ab+1)(ac+1)(bc+1), Bol. Soc. Mat. Mex., (3)9 (2), 235–244 (2003).
  40. [40]J. Kollar, Sharp effective Nullstellensatz.J. Amer. Math. Soc. 1(1988), 963–975.DOI
  41. [41]S. Lang, Fundamentals of Diophantine Geometry, Springer-Verlag, New York, 1983.DOI
  42. [42]S. Lang, Division points on curves, Annali di matematica pura ed applicata (IV) LXX (1965) pp. 229–234.
  43. [43]M. LAURENT, Equation exponentielles polynomes et suite recurrentes lineaires II, J. Number Theory 31 (1989), 24-53.DOI
  44. [44]L. Leroux, Computing the torsion points of a variety defined by lacunary polynomials. Math. Comp. 81(279) (2012), 1587–1607.arxiv.org/abs/0911.2594
  45. [45]A. Levin, Greatest common divisors and Vojta’s conjecture for blowups of algebraic tori. Invent. math. 215, 493 – 533 (2019).DOI
  46. [46]T. Loher and D. Masser, Uniformly counting points of bounded height, Acta Arith., 111(2004): 277 – 297.DOI
  47. [47]B. H. Loxton and and A. J. Van der Poorten, On the growth of linear recurrences . Math. Proc. Camb. Phil. Soc. (1977), 81, 369.
  48. [48]F. Luca and A. Noubissie, Linear combinations of factorial and S-units in a ternary recurrence sequence with a double root. Periodica Mathematica Hungarica, 86, 422–441 (2023).
  49. [49]F. Luca and J. Ouaknine and J. Worrell , Universal Skolem set with positive lower density. Proceedings of MFCS 22, LIPIcs 241, 2022.DOI
  50. [50]F. Luca and J. Ouaknine and J. Worrell , Universal Skolem Set . Proceedings of LICS 21, 2021.
  51. [51]F. Luca, J. Ouaknine, and J. Worrell, Algebraic model checking for discrete linear dynamical Systems FORMATS 2022, Lecture note in Computer Sciences, vol. 13465, springer, 22, pp. 3–15.DOI
  52. [52]F. Luca, J. Maynard, A. Noubissie, J. Ouaknine, J. Worrell, Skolem meets Bateman-Horn, To appear in Theoretical CS Journal. //arxiv.org/abs/2308.01152v2arxiv.org/abs/2308.01152
  53. [53]D. W. Masser, A note on Siegel’s Lemma, The Rocky Mountain Journal of Mathematics, 26 (1996) No. 3, 1057 – 1068.DOI
  54. [54]G. Maurin, Courbes algébriques et équations multiplicatives, Math. Ann., 341 (2008): 789 – 824.DOI
  55. [55]E. Mayr and A. Meyer, The complexity of the word problems for commutative semigroups and polynomial ideals, Adv. Math. 46 (1982), no. 3, 305–329.DOI
  56. [56]M. Mignotte, T. Shorey, and R. Tijdeman The distance between terms of an algebraic recurrence sequence. J. fur die reine und angewandte Math., 349 (1984) .DOI
  57. [57]A. Noubissie, A Quantitative Growth of Linear Recurrences. Journal of Aus. Math. Soc., 120(1), 107 – 140 (2026).
  58. [58]A. Ostafe and I. Shparlinski, On the Skolem problem and some related questions for parametric families of linear recurrence sequences,Canada Journal of Math., 74(3) : 773 – 792, 2022.arxiv.org/abs/2005.06713
  59. [59]J. Ouaknine, and J. Worrell, On linear recurrence sequences and loop termination, ACM SIGLOG, New 2 (2015) no. 2, 4–13.DOI
  60. [60]J. Ouaknine and J. Worrell . 2014c. Ultimate Positivity Problem is Decidable for Simple Linear Recurrence Sequences. In Proc. ICALP (LNCS), Vol. 8573. Springer.arxiv.org/abs/1309.1914
  61. [61]B. Renschuch, Beiträge zur konstruktiven Theorie der Polynomidale. XVII/1. Zur Hent zelt/Noether/Hermannschen Theorie der endlich vielen Schritte, Wiss. Z. P?dagog. Hochsch. ”Karl Liebknecht” Potsdam 24(1980), no. 1 87 – 99.
  62. [62]D. Roy and J.Thunder, A note on Siegel’s Lemma over number fields, Monatsh. Math.,120 (1995), 307 – 318.DOI
  63. [63]P. Samuel, Algebraic theory of numbers, Hermann publisher, Paris, 1967.
  64. [64]A. Seidenberg, Constructions in algebra. Trans. Amer. Math. Soc. , 197 (1974), 273–313.DOI
  65. [65]H. P. Schlickewei and W. M. Schmidt , The number of solution of the polynomials-exponential equations. Compos. Math. 120 (2000), 193–225.
  66. [66]H. P. Schlickewei and A. J. Van der Poorten, The growth conditions for recurrence sequences. Macquarie Math. Report 82-0041 (August 1982), Macquarie University, Australia, 2109.
  67. [67]W. M. Schmidt, The zero multiplicity of linear recurrence sequences. Acta Math. 182 (1999), 243–282.DOI
  68. [68]H. Simmons, The solution of a decision problem for several classes of rings. Pacific J. Math.., 34, No. 2, 1970.DOI
  69. [69]M. Sombra, A sparse effective Nullstellensatz, Adv. in Appl. Math., 22 (1999), 271–295.
  70. [70]N. K. Vereshchagin, The problem of appearance of a zero in a linear recurrence sequence (in Russian). Mat. Zametki 38, 2 (1985).
  71. [71]S. S. Wainer, A classification of the ordinal recursive functions, Arch. Math. Logik Grundla g enforsch. , 13 (1970), 136–153.DOI
  72. [72]M. Waldschmidt, Diophantine approximation on linear algebraic groups. Vol. 326 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 2000. Transcendence properties of the exponential function in several variables.DOI
  73. [73]Z. Xiao, Greatest common divisors for polynomials in almost units and applications to linear recurrence sequences, Math. Z. 306(4) (2024), Paper No. 61, 42 p.arxiv.org/abs/2110.01751

Paper details

vlnc:W_bvub6jep
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

GPT-6

View statement
Looking for related papers…
Contents