English
Related papers

Related papers: Power Values of Certain Quadratic Polynomials

200 papers

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…

Discrete Mathematics · Computer Science 2023-04-19 Ramiro Martínez , Paz Morillo

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…

Classical Analysis and ODEs · Mathematics 2016-12-28 P. Njionou Sadjang , S. Mboutngam

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…

Number Theory · Mathematics 2025-06-23 Rupam Barman , Anuj Narode , Vinay Wagh

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…

Combinatorics · Mathematics 2017-07-11 Maciej Dołęga

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…

Number Theory · Mathematics 2022-06-06 Rod Gow , Gary McGuire

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…

Number Theory · Mathematics 2025-12-01 Foivos Chnaras , Noah Kupinsky

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…

Number Theory · Mathematics 2015-09-07 Shuntaro Yamagishi

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…

Number Theory · Mathematics 2011-06-17 Alain Lasjaunias , Domingo gomez

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…

Symbolic Computation · Computer Science 2010-12-06 Mark Giesbrecht , Daniel S. Roche

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…

Number Theory · Mathematics 2025-06-23 Takao Komatsu

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…

Quantum Physics · Physics 2022-05-25 Arturas Acus , Adolfas Dargys

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…

Commutative Algebra · Mathematics 2019-08-08 John Abbott , Anna Maria Bigatti , Elisa Palezzato , Lorenzo Robbiano

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…

Quantum Physics · Physics 2010-03-19 Daniel M. Kane , Samuel A. Kutin

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,…

Commutative Algebra · Mathematics 2025-07-15 Sarah Nakato , Roswitha Rissner

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…

Information Theory · Computer Science 2016-11-17 Mohsen Heidari , S. Sandeep Pradhan

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…

Number Theory · Mathematics 2014-02-26 Rafe Jones

We give an optimal necessary and sufficient condition for the quotient polynomial and remainder in the division algorithm to have positive coefficients.

Classical Analysis and ODEs · Mathematics 2013-08-15 Mark B. Villarino

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…

Number Theory · Mathematics 2016-09-30 Lucas Reis

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.

Number Theory · Mathematics 2010-04-20 Dasheng Wei

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…

Number Theory · Mathematics 2018-09-28 István Gaál , László Remete , Tí mea Szabó