Results 51 to 60 of about 4,224,396 (192)

On the moments of exponential sums over r$r$‐free polynomials

Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract Let Fq[t]${\mathbb {F}}_q[t]$ denote the ring of polynomials over the finite field Fq${\mathbb {F}}_q$. Building off of techniques of Balog and Ruzsa and of Keil in the integer setting, we determine the precise order of magnitude of k$k$th moments of exponential sums over r$r$‐free polynomials in Fq[t]${\mathbb {F}}_q[t]$ for all k>0$k>0$.
Ben Doyle
wiley   +1 more source

Common values of two k-generalized Pell sequences [PDF]

Notes on Number Theory and Discrete Mathematics
Let k≥2 and let (Pₙ⁽ᵏ⁾)ₙ≥₂₋ₖ be the k-generalized Pell sequence defined by Pₙ⁽ᵏ⁾=2Pₙ₋₁⁽ᵏ⁾+2Pₙ₋₂⁽ᵏ⁾+...+2Pₙ₋ₖ⁽ᵏ⁾ for n≥2 with initial conditions P₋₍ₖ₋₂₎⁽ᵏ⁾=P₋₍ₖ₋₃₎⁽ᵏ⁾=...=P₋₁⁽ᵏ⁾=P₀⁽ᵏ⁾=0, and P₁⁽ᵏ⁾=1.
Zafer Şiar, Florian Luca, Faith Shadow Zottor   +2 more
doaj   +1 more source

An elegant model of the geodesic flow on the modular surface

Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract Caroline Series' [The modular surface and continued fractions, J. Lond. Math. Soc. (2), 31, no. 1, (1985), 69–80] gives a clear framework linking, in a deceptively simple way, the dynamics of the geodesic flow on the modular surface with the dynamics of the regular continued fraction, through a well‐chosen symbolic coding.
Pierre Arnoux, Thomas A. Schmidt
wiley   +1 more source

Linear Recurrence Sequences in Diophantine Analysis [PDF]

, 2022
Diophantine analysis is an area of number theory concerned with finding integral solutions to polynomial equations defined over the rationals, or more generally over a number field.
Bellah, Elisa
core   +1 more source

On the Diophantine Equation $\left(9d^2 + 1\right)^x + \left(16d^2 - 1\right)^y = (5d)^z$ Regarding Terai's Conjecture

Journal of New Theory
This study proves that the Diophantine equation $\left(9d^2+1\right)^x+\left(16d^2-1\right)^y=(5d)^z$ has a unique positive integer solution $(x,y,z)=(1,1,2)$, for all $d>1$.
Murat Alan, Tuba Çokoksen
doaj   +1 more source

Multiplicatively dependent integer vectors on a hyperplane

Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract We establish several asymptotic formulae and upper bounds for the count of multiplicatively dependent integer vectors that lie on a fixed affine hyperplane and have bounded height. This work constitutes a direct extension of the results obtained by Pappalardi, Sha, Shparlinski, and Stewart.
Muhammad Afifurrahman, Valentio Iverson, Gian Cordana Sanjaya   +2 more
wiley   +1 more source

Solution of an odds inversion problem [PDF]

Notes on Number Theory and Discrete Mathematics
Consider the problem of determining the possible numbers of balls of two different colors in an urn such that if two are drawn out at random, the odds that they are different colors are a given value. We present a general solution of this problem for all
Robert K. Moniot
doaj   +1 more source

Definability of complex functions in o‐minimal structures

Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract We prove that holomorphic continuations of functions in the classes an∗$\mathbf {an}^*$ and G$\mathcal {G}$ are definable in the o‐minimal structures Ran∗$\mathbb {R}_{\operatorname{an}^*}$ and RG$\mathbb {R}_{\mathcal {G}}$, respectively. More specifically, we give complex domains on which the holomorphic continuations are definable and show ...
Adele Padgett, Patrick Speissegger
wiley   +1 more source

Random Diophantine equations in the primes

Mathematika, Volume 72, Issue 3, July 2026.
Abstract We consider equations of the form a1x1k+⋯+asxsk=0$a_{1}x_{1}^{k}+\cdots +a_{s}x_{s}^{k}=0$ where the variables xi$x_{i}$ are all taken to be primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove that, whenever k⩾2$k\geqslant 2$, s⩾3k+2$s\geqslant 3k+2$, this holds
Philippa Holdridge
wiley   +1 more source

On Terms of Generalized Fibonacci Sequences which are Powers of their Indexes

Mathematics, 2019
The k-generalized Fibonacci sequence ( F n ( k ) ) n (sometimes also called k-bonacci or k-step Fibonacci sequence), with k ≥ 2 , is defined by the values 0 , 0 , … , 0 , 1 of starting k its terms and such way ...
Pavel Trojovský
doaj   +1 more source