Results 71 to 80 of about 4,479,316 (202)

The extensibility of the Diophantine triple {2, b, c}

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021
The aim of this paper is to consider the extensibility of the Diophantine triple {2, b, c}, where 2 < b < c, and to prove that such a set cannot be extended to an irregular Diophantine quadruple.
Adžaga Nikola, Filipin Alan, Jurasić Ana   +2 more
doaj   +1 more source

Moderate Deviation Principles for Lacunary Trigonometric Sums

Mathematische Nachrichten, Volume 299, Issue 5, Page 1028-1044, May 2026.
ABSTRACT Classical works of Kac, Salem, and Zygmund, and Erdős and Gál have shown that lacunary trigonometric sums despite their dependency structure behave in various ways like sums of independent and identically distributed random variables. For instance, they satisfy a central limit theorem (CLT) and a law of the iterated logarithm.
Joscha Prochno, Marta Strzelecka
wiley   +1 more source

Semigroup ideals and linear diophantine equations

Linear Algebra and its Applications, 1999
Let \(S\) be a finitely generated commutative cancellative monoid, and let \(\{n_1,\dots,n_r\}\subset S\) be a set of generators for \(S\). Let \(k\) be a field, \(R=k[S]\) the associated semigroup \(k\)-algebra, \(R=k[X_1,\dots,X_r]\) the polynomial ring, and \(\varphi\colon R\to k[S]\) the \(k\)-algebra homomorphism given by \(\varphi(X_i)=n_i\). The
openaire   +2 more sources

On the exceptional set in Littlewood's discrete conjecture

Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.
Abstract We consider a discrete analogue of the well‐known Littlewood conjecture on Diophantine approximations and obtain a strong upper bound for the number of exceptional vectors in this conjecture.
I. D. Shkredov
wiley   +1 more source

Diophantine Equations Related to Linear Recurrence Sequences

, 2021
The aim of this dissertation is to investigate the solutions of some Diophantine equations connected to linear recurrence sequences. We firstly study the integer solutions of Diophantine equations related to reciprocals and repdigits with linear ...
Hashim, Hayder Raheem
core  

Padovan and Perrin numbers of the form 7ᵗ-5ᶻ-3ʸ-2ˣ [PDF]

Notes on Number Theory and Discrete Mathematics
Consider the Padovan sequence (pₙ)ₙ≥₀ given by pₙ₊₃=pₙ₊₁+pₙ with p₀=p₁=p₂=1. Its companion sequence, the Perrin sequence (℘ₙ)ₙ≥₀, follows the same recursive formula as the Padovan numbers, but with different initial values: p₀=3, p₁=0 and p₂=2.
Djamel Bellaouar, Özen Özer, Noureddine Azzouza   +2 more
doaj   +1 more source

Double‐jump phase transition for the reverse Littlewood–Offord problem

Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract Erdős conjectured in 1945 that for any unit vectors v1,…,vn$v_1, \ldots, v_n$ in R2$\mathbb {R}^2$ and signs ε1,…,εn$\varepsilon _1, \ldots, \varepsilon _n$ taken independently and uniformly in {−1,1}$\lbrace -1,1\rbrace$, the random Rademacher sum σ=ε1v1+⋯+εnvn$\sigma = \varepsilon _1 v_1 + \cdots + \varepsilon _n v_n$ satisfies ∥σ∥2⩽1$\Vert \
Lawrence Hollom, Julien Portier, Victor Souza   +2 more
wiley   +1 more source

On Systems of Linear Diophantine Equations [PDF]

Mathematics Magazine, 1996
Introduction Something happened to me recently I would wager has happened to many who read this note. Teaching a new topic, you cannot understand one of the proofs. Your first attempt to fill the gap fails. You look through your books for an answer. Next, you ask colleagues, go to the library, maybe even use the interlibrary loan. All in vain.
openaire   +1 more source

HNN extensions and embedding theorems for groups

Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract The Higman–Neumann–Neumann (HNN) paper of 1949 is a landmark of group theory in the 20th century. The proof of its main theorem covers less than a page and uses only pre‐existing technology, but the construction that it introduced, the HNN extension, quickly became one of the principal tools of combinatorial group theory, widely used to build ...
Martin R. Bridson, Carl‐Fredrik Nyberg‐Brodda   +1 more
wiley   +1 more source

Discovery of Exact Equations for Integer Sequences

Mathematics
Equation discovery, also known as symbolic regression, is the field of machine learning that studies algorithms for discovering quantitative laws, expressed as closed-form equations or formulas, in collections of observed data.
Boštjan Gec, Sašo Džeroski, Ljupčo Todorovski   +2 more
doaj   +1 more source