Lajos Hajdu

On the Diophantine Equation <i>n</i>(<i>n</i> + <i>d</i>) · · · (<i>n</i> + (<i>k</i> − 1)<i>d</i>) = <i>by</i>^<i>l</i>

Kálmán Győry, Lajos Hajdu, N. Saradha · Canadian Mathematical Bulletin · 2004 · 343 citations · Full text

Consecutive Positive Terms, Analytic Number Theory, Arithmetic Progressions +4

Powers from Products of Consecutive Terms in Arithmetic Progression

Michael A. Bennett, Nils Bruin, Kálmán Győry et al. · Proceedings of the London Mathematical Society · 2006 · 46 citations

Computational Number Theory, Diophantine Analysis, Modular Form +6

An algorithm for discrete tomography

Lajos Hajdu, Robert Tijdeman · Linear Algebra and its Applications · 2001 · 35 citations

Geometric Modeling, Computed Tomography, Image Reconstruction +10

Perfect powers from products of consecutive terms in arithmetic progression

Kálmán Győry, Lajos Hajdu, Ákos Pintér · Compositio Mathematica · 2009 · 33 citations · Full text

Galois Representation Approach, Computational Number Theory, Perfect Powers +5

Lattice of generalized neighbourhood sequences in nD

Attila Fazekas, András Hajdú, Lajos Hajdu · 2004 · 30 citations

Discrete Geometry, Image Analysis, Engineering +12