On some Diophantine systems involving symmetric polynomials. - Maciej Ulas (Math. Comput., 2014)

On formal inverse of the Prouhet-Thue-Morse sequence. - Maciej Gawron; Maciej Ulas (Discret. Math., 2016)

On a problem of Pethő. - Szabolcs Tengely; Maciej Ulas (J. Symb. Comput., 2018)

On arithmetic properties of binary partition polynomials. - Maciej Ulas; Blazej Zmija (Adv. Appl. Math., 2019)

A Fibonacci type sequence with Prouhet-Thue-Morse coefficients. - Eryk Lipka; Maciej Ulas (CoRR, 2021)

On a generalization of Schur theorem concerning resultants. - Maciej Ulas (Period. Math. Hung., 2021)

On Consecutive 1's in Continued Fractions Expansions of Square Roots of Prime Numbers. - Piotr Miska; Maciej Ulas (Exp. Math., 2022)

Arithmetic properties of polynomial solutions of the Diophantine equation P(x)xn+1+Q(x)(x+1)n+1=1. - Karl Dilcher; Maciej Ulas (Period. Math. Hung., 2022)

Construction of diagonal quintic threefolds with infinitely many rational points. - Maciej Ulas (Math. Comput., 2024)

Binary sequences meet the Fibonacci sequence. - Piotr Miska; Bartosz Sobolewski; Maciej Ulas (Adv. Appl. Math., 2025)