László Szalay
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
László Szalay has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Takao Komatsu
Department of Mathematics, Institute of Science Tokyo
2 shared publications - Hacène Belbachir
USTHB, Faculty of Mathematics, RECITS Laboratory
1 shared publication - Volker Ziegler
Austrian Academy of Sciences
1 shared publication
Latest Publications
- Open AccessS-Diophantine quadruples with $\mathbf{S=\{2,q\}}$Let $S$ denote a set of primes and let $a_1,\ldots,a_m$ be positive distinct integers. We call the $m$-tuple $(a_1,\ldots,a_m)$ an $S$-Diophantine tuple if $a_ia_j+1=s_{i,j}$ are $S$-integers for all $i\not=j$. In this paper, we show that no $S$-Diophantine quadruple (i.e~$m=4$) exists if $S=\{2,q\}$ with $q\equiv 3\; (\bmod\, 4)$ or $q<10^9$. For two arbitrary primes $p,q<10^5$ we gain the same result.Open AccessS-Diophantine quadruples with $\mathbf{S=\{2,q\}}$Let $S$ denote a set of primes and let $a_1,\ldots,a_m$ be positive distinct integers. We call the $m$-tuple $(a_1,\ldots,a_m)$ an $S$-Diophantine tuple if $a_ia_j+1=s_{i,j}$ are $S$-integers for all $i\not=j$. In this paper, we show that no $S$-Diophantine quadruple (i.e~$m=4$) exists if $S=\{2,q\}$ with $q\equiv 3\; (\bmod\, 4)$ or $q<10^9$. For two arbitrary primes $p,q<10^5$ we gain the same result.
- 1 April 2014
- Published by Springer Nature in Lithuanian Mathematical Journal
- Vol. 54 (2) , 166-181
Shifted poly-Cauchy numbers
- 1 April 2014
- Published by Springer Nature in Lithuanian Mathematical Journal
- Vol. 54 (2) , 166-181
Shifted poly-Cauchy numbers
- Open Access
- 1 April 2014
- Published by Walter de Gruyter GmbH in Mathematica Slovaca
- Vol. 64 (2) , 287-300
Linear recurrences associated to rays in Pascal’s triangle and combinatorial identities
Our main purpose is to describe the recurrence relation associated to the sum of diagonal elements laying along a finite ray crossing Pascal’s triangle. We precise the generating function of the sequence of described sums. We also answer a question of Horadam posed in his paper [Chebyshev and Pell connections, Fibonacci Quart. 43 (2005), 108–121]. Further, using Morgan-Voyce sequence, we establish the nice identity \(F_{n + 1} - iF_n = i^n \sum\limits_{k = 0}^n {(_{2k}^{n + k} )( - 2 - i)^k } \) of Fibonacci numbers, where i is the imaginary unit. Finally, connections to continued fractions, bivariate polynomials and finite differences are given.- 1 April 2014
- Published by Walter de Gruyter GmbH in Mathematica Slovaca
- Vol. 64 (2) , 287-300
Open AccessLinear recurrences associated to rays in Pascal’s triangle and combinatorial identities
Our main purpose is to describe the recurrence relation associated to the sum of diagonal elements laying along a finite ray crossing Pascal’s triangle. We precise the generating function of the sequence of described sums. We also answer a question of Horadam posed in his paper [Chebyshev and Pell connections, Fibonacci Quart. 43 (2005), 108–121]. Further, using Morgan-Voyce sequence, we establish the nice identity \(F_{n + 1} - iF_n = i^n \sum\limits_{k = 0}^n {(_{2k}^{n + k} )( - 2 - i)^k } \) of Fibonacci numbers, where i is the imaginary unit. Finally, connections to continued fractions, bivariate polynomials and finite differences are given. - 1 January 2013
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in TURKISH JOURNAL OF MATHEMATICS
- Vol. 37 (5) , 733-738
Algorithm to solve certain ternary quartic Diophantine equations
In this paper, we develop an algorithm to solve completely the Diophantine equation F(x,y)=z^2, where the quartic inhomogeneous polynomial F(x,y) with integer coefficients satisfies certain technical conditions. The procedure is an extension of the version of Runge's method given by Poulakis.
- 1 January 2013
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in TURKISH JOURNAL OF MATHEMATICS
- Vol. 37 (5) , 733-738
Algorithm to solve certain ternary quartic Diophantine equations
In this paper, we develop an algorithm to solve completely the Diophantine equation F(x,y)=z^2, where the quartic inhomogeneous polynomial F(x,y) with integer coefficients satisfies certain technical conditions. The procedure is an extension of the version of Runge's method given by Poulakis.