Related papers: A derivation of Dickson polynomials using the Cayl…

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…

The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…

We give a new combinatorial explanation for well-known relations between determinants and traces of matrix powers. Such relations can be used to obtain polynomial-time and poly-logarithmic space algorithms for the determinant. Our new…

We study the computational complexity of a diagonalization technique for multivariate homogeneous polynomials, that is, expressing them as sums of powers of independent linear forms. It is based on Harrison's center theory and consists of a…

We study the invariants (in particular, the central invariants) of suitable Poisson pencils from the point of view of the theory of bi-Hamiltonian reduction, paying a particular attention to the case where the Poisson pencil is exact. We…

We investigate fixed points and cycle types of permutation polynomials and complete permutation polynomials arising from reversed Dickson polynomials of the first kind and second kind over $\mathbb{F}_p$. We also study the permutation…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

We consider products of two Macdonald polynomials of type A, indexed by dominant weights which are respectively a multiple of the first fundamental weight and a weight having zero component on the k-th fundamental weight. We give the…

Polynomial regression is widely used and can help to express nonlinear patterns. However, considering very high polynomial orders may lead to overfitting and poor extrapolation ability for unseen data. The paper presents a method for…

We derive new matrix representation for higher-order changhee numbers and polynomials. This helps us to obtain simple and short proofs of many previous results on higher-order changhee numbers and polynomials. Moreover, we obtain recurrence…

In [5] Cauchon introduced the so-called deleting derivations algorithm. This algorithm was first used in noncommutative algebra to prove catenarity in generic quantum matrices, and then to show that torus-invariant primes in these algebras…

We prove new theorems for the polynomial expansions of $x^n \pm y^n$ in terms of the binary quadratic forms $\alpha x^2 + \beta xy + \alpha y^2 $ and $a x^2 + bxy + a y^2 $. The paper gives new arithmetic differential approach to compute…

In this paper we introduce a new sequence of polynomials, which follow the same recursive rule of the well-known Lucas-Lehmer integer sequence. We show the most important properties of this sequence, relating them to the Chebyshev…

The R-matrix formalism for the construction of integrable systems with infinitely many degrees of freedom is reviewed. Its application to Poisson, noncommutative and loop algebras as well as central extension procedure are presented. The…

This paper investigates the dynamical properties of Dickson polynomials over finite fields, focusing on the periodicity and structural behavior of their iterated sequences. We introduce and analyze the sequence $[D_n(x, \alpha) \mod (x^q -…

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

Polytopes are ubiquitous in different areas of mathematics. Gleason and Hubard established a factorisation theorem, stating that every abstract polytope has a unique factorisation into prime polytopes. We compute the automorphism group of a…

Using Newton polygons, a key factorization result for polynomials over discrete valuation domains is proved, which in particular yields new irreducibility criteria including a generalization of the classical irreducibility criterion of…

We prove that, over a field of characteristic $0$, the degrees of factors of a binomial $t^n-\alpha$ are divisible by the least such degree. As a consequence, we deduce that for relatively prime natural numbers $m,n$, a polynomial has the…

We introduce a refined version of group cohomology and relate it to the space of polynomials on the group in question. We show that the polynomial cohomology with trivial coefficients admits a description in terms of ordinary cohomology…