Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Attila Bérczes"'
Publikováno v:
Mathematics, Vol 12, Iss 12, p 1814 (2024)
In recent years, convolutional neural networks (CNNs) have emerged as highly efficient architectures for image and audio classification tasks, gaining widespread adoption in state-of-the-art methodologies. While CNNs excel in machine learning scenari
Externí odkaz:
https://doaj.org/article/b82771c911b04758a8a2d5dc1670bea8
Publikováno v:
Results in Mathematics. 78
There are many results in the literature concerning linear combinations of factorials among terms of linear recurrence sequences. Recently, Grossman and Luca provided effective bounds for such terms of binary recurrence sequences. In this paper we sh
Publikováno v:
Analele Universitatii "Ovidius" Constanta - Seria Matematica. 29:93-105
Let ℕ be the set of all positive integers. In this paper, using some known results on various types of Diophantine equations, we solve a couple of special cases of the ternary equation x2 − y2m = zn , x, y, z, m, n ∈ ℕ, gcd(x, y) = 1, m ≥ 2
Publikováno v:
International Mathematics Research Notices. 2021:9045-9082
We study multiplicative dependence between elements in orbits of algebraic dynamical systems over number fields modulo a finitely generated multiplicative subgroup of the field. We obtain a series of results, many of which may be viewed as a blend of
Publikováno v:
Journal of Number Theory. 196:353-363
In this paper we give various finiteness results concerning terms of recurrence sequences U n representable as a sum of S-units with a fixed number of terms. We prove that under certain (necessary) conditions, the number of indices n for which U n al
Publikováno v:
Acta Arithmetica. 190:339-350
Extending earlier research of Erdos and Graham, we consider the problem of products of factorials yielding perfect powers. On the one hand, we describe how the representability of ℓ-th powers behaves when the number of factorials is smaller than, e
Publikováno v:
Glasnik matematički
Volume 55
Issue 1
Volume 55
Issue 1
We investigate the power and polynomial values of the polynomials Pn(X) = ∏nk=0 (X2 · 3k - X3k - 1 ) for n ∈ ℕ. We prove various ineffective and effective finiteness results. In the case 0≤ n ≤ 3, we determine all pairs x,y of integers suc
Publikováno v:
Journal of Number Theory. 183:326-351
In this work, we give upper bounds for n on the title equation. Our results depend on assertions describing the precise exponents of 2 and 3 appearing in the prime factorization of T k ( x ) = ( x + 1 ) k + ( x + 2 ) k + . . . + ( 2 x ) k . Further,
Publikováno v:
2019 10th IEEE International Conference on Cognitive Infocommunications (CogInfoCom).
We analyze a database containing medical data of patients who suffered hemorrhagic stroke. From the original database we built the corresponding comorbidities network, and we analyzed this network using a graph theoretical approach. Our main tool was
Publikováno v:
Journal of Number Theory. 163:43-60
We provide all solutions of the title equation in positive integers x , k , y , n with 1 ≤ x 25 and n ≥ 3 . For these values of the parameters, our result gives an affirmative answer to a related, classical conjecture of Schaffer. In our proofs w