Related papers: A note on a conjecture by Ulas on polynomial subst…

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

We show that all of the "new" permutation polynomials in the recent paper arXiv:2207.13335 (H. Song et al.) are in fact known. We also present a new type of question in this area.

The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…

In this note, we prove an irreducibility criterion for the polynomial of the form $f(x) = a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{m}x^{m} + p^{u} \in \mathbb{Z}[x]$, where $p$ is a prime number, $u \geqslant 1$, $\gcd(u, m) = 1$, $p \nmid…

A family of congruences interpolating between those of Wilson and Giuga is constructed. Several elementary results are established, in order to present a possible approach to establishing Giuga's conjecture.

In an earlier work [K. Castillo et al., J. Math. Anal. Appl., 514 (2022) 126358], we give positive answer to the first, and apparently more easy, part of a conjecture of M. Ismail concerning the characterization of the continuous $q$-Jacobi…

We give a reformulation of the Lehmer conjecture about algebraic integers in terms of a simple counting problem modulo p.

We report the results of our empirical investigations on the Bateman-Horn conjecture. This conjecture, in its commonly known form, produces rather large deviations when the polynomials involved are not monic. We propose a modified version…

The conjecture by Steklov was solved negatively by Rakhmanov in 1979. His original proof was based on the formula for orthogonal polynomial obtained by adding point masses to the measure of orthogonality. In this note, we show how this…

We introduce a new conjecture on products of two distinct primes that would provide a partial answer to a conjecture of McIntosh. Also, $\binom{2p-1}{p-1}-1$ is written in terms of a polynomial in prime $p$ over the integers and we discuss…

We give a geometric proof of a conjecture of W. Fulton on the multiplicities of irreducible representations in a tensor product of irreducible representations for GL(r).

We provide new sufficient conditions under which Ryser's conjecture holds.

We prove the multiplicity one case of Lusztig's conjecture on the irreducible characters of reductive algebraic groups for all fields with characteristic above the Coxeter number.

It is shown that the $L^\alpha$-norms polynomials Rudin conjecture fails. Our counterexample is inspired by Bourgain's work on NLS. Precisely, his study of the Strichartz's inequality of the $L^6$-norm of the periodic solutions given by the…

We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-$t$-Macdonald polynomials of two rows.

We prove certain identities involving Euler and Bernoulli polynomials that can be treated as recurrences. We use these and also other known identities to indicate connection of Euler and Bernoulli numbers with entries of inverses of certain…

We prove an irreducibility criterion for polynomials with power series coefficients generalizing previous known results concerning quasi-ordinary polynomials.

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

We prove the conjecture of Friedlander et al. about sums over Littelmann patterns for the the root system of type $G_2$, which is an analogue of Tokuyama's theorem for root systems of type $A_r$. We use elementary means to show that the…

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…