Related papers: On Ternary Inclusion-Exclusion Polynomials

We extend some results about shifted Schur functions to the general context of shifted Macdonald polynomials. We obtain two explicit formulas for these polynomials: a $q$-integral representation and a combinatorial formula. Our main tool is…

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…

In this note, a criterion for a class of binomials to be permutation polynomials is proposed. As a consequence, many classes of binomial permutation polynomials and monomial complete permutation polynomials are obtained. The exponents in…

We give some new $q$-supercongruences on truncated forms of squares of basic hypergeometric series. Most of them are modulo the cube of a cyclotomic polynomial, and two of them are modulo the fourth power of a cyclotomic polynomial. The…

We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct…

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

We consider orthogonal polynomials p_n with respect to an exponential weight function w(x) = exp(-P(x)). The related equations for the recurrence coefficients have been explored by many people, starting essentially with Laguerre [49], in…

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…

In this paper we study q-Euler numbers and polynomials by using p-adic q-fermionic integrals on Z_p. The methods to study q-Euler numbers and polynomials in this paper are new.

Borwein and Choi conjectured that a polynomial $P(x)$ with coefficients $\pm1$ of degree $N-1$ is cyclotomic iff $$P(x)=\pm \Phi_{p_1}(\pm x)\Phi_{p_2}(\pm x^{p_1})\cdots \Phi_{p_r}(\pm x^{p_1p_2\cdots p_{r-1}})$$ where $N=p_1p_2\cdots…

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…

We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.

Let $N=p_1p_2... p_n$ be a product of $n$ distinct primes. Define $P_N(x)$ to be the polynomial $(1-x^N)\prod_{1\leq i<j\leq n}(1-x^{N/(p_ip_j)})/\prod_{i=1}^n (1-x^{N/p_i})$. (When $n=2$, $P_{pq}(x)$ is the $pq$-th cyclotomic polynomial,…

In this paper, by using the theory of circulant matrices we study some matrices over finite fields which involve the quadratic character and trinomial coefficients.

In this paper, we construct two classes of permutation polynomials over $\mathbb{F}_{q^2}$ with odd characteristic from rational R\'{e}dei functions. A complete characterization of their compositional inverses is also given. These…

We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…

We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…

Let $\Phi_n(q)$ be the $n$-th cyclotomic polynomial in $q$. Recently, the author and Zudilin provide a creative microscoping method to prove some $q$-supercongruences mainly modulo $\Phi_n(q)^3$ by introducing an additional parameter $a$.…