Related papers: Power Values of Certain Quadratic Polynomials
This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…
Fractional $q$-extensions of some classical $q$-orthogonal polynomials are introduced and some of the main properties of the new defined functions are given. Next, a fractional $q$-difference equation of Gauss type is introduced and solved…
In 2012, for any integer $n \ge 2$, Kedlaya constructed an infinite class of monic irreducible polynomials of degree $n$ with integer coefficients having squarefree discriminants. Such polynomials are necessarily monogenic. Further, by…
We prove a strong factorization property of interpolation Macdonald polynomials when $q$ tends to $1$. As a consequence, we show that Macdonald polynomials have a strong factorization property when $q$ tends to $1$, which was posed as an…
We investigate some Galois groups of linearized polynomials over fields such as $\mathbb{F}_q(t)$. The space of roots of such a polynomial is a module for its Galois group. We present a realization of the symmetric powers of this module, as…
For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…
Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…
We are concerned with power series in 1/T over a finite field of 3 elements $\F_3$. In a previous article, Alain Lasjaunias investigated the existence of particular power series of elements algebraic over $\F_3[T]$, having all partial…
Given a "black box" function to evaluate an unknown rational polynomial f in Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine…
In this paper, we show some expressions of certain $q$-multiple zeta-star values at roots of unity. These explicit formulas are expressed by using the determinants or Bell polynomials. Explicit formulas for other types of values can be…
Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…
We study the question up to which power an irreducible integer-valued polynomial that is not absolutely irreducible can factor uniquely. For example, for integer-valued polynomials over principal ideal domains with square-free denominator,…
The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes and present a new class of codes called Quasi Group Codes…
We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must…
We give an optimal necessary and sufficient condition for the quotient polynomial and remainder in the division algorithm to have positive coefficients.
Let $q$ be a prime power and $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $n>1$. We introduce the class of the linearized polynomials $L(x)$ over $\mathbb F_{q^n}$ such that…
We propose a method for determining which integers can be written as a sum of two integral squares for quadratic fields $\Q(\sqrt{\pm p})$, where $p$ is a prime.
Let $M\subset K$ be number fields. We consider the relation of relative power integral bases of $K$ over $M$ with absolute power integral bases of $K$ over $Q$. We show how generators of absolute power integral bases can be calculated from…