Related papers: On computing factors of cyclotomic polynomials

The aim of the inverse Galois problem is to find extensions of a given field whose Galois group is isomorphic to a given group. In this article, we are interested in subgroups of GL(2,Z/nZ) where n is an integer. We know that, in general,…

We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions without using polynomial factorisation in towers or constructing any field containing the splitting field, instead extending Galois group…

We establish a generalization of Bourgain double recurrence theorem by proving that for any map $T$ acting on a probability space $(X,\mathcal{A},\mu)$, and for any non-constant polynomials $P, Q$ mapping natural numbers to themselves, for…

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

We study a class of weight functions on $[-1,1]$, which are special cases of the general weights studied by Bernstein and Szeg\"o, as well as their extentions to the interval $[-a,1]$ for a continuous parameter $a>0$. These weights are…

We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…

We give a Fourier-type formula for computing the orthogonal Weingarten formula. The Weingarten calculus was introduced as a systematic method to compute integrals of polynomials with respect to Haar measure over classical groups. Although a…

In [5, 6] it has been proved that the ring of quasisymmetric functions over the integers is free polynomial, see also [4]. This is a matter that has been of great interest since 1972; for instance because of the role this statement plays in…

We first prove an identity involving symmetric polynomials. This identity leads us into exploring the geometry of Lagrangian Grassmannians. As an insight applications, we obtain a formula for the integral over the Lagrangian Grassmannian of…

We obtain an explicit simple formula for the coefficients of the asymptotic expansion for the factorial of a natural number,in terms of derivatives of powers of an elementary function. The unique explicit expression for the coefficients…

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

The notion of good integers, namely the divisors of the sequence $(a^s+b^s)_{s\ge 1}$ for nonzero coprime integers $a$ and $b$, together with their subfamilies such as oddly-good and evenly-good integers, has become an important arithmetic…

We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.

In this paper, we discuss two simple parametrization methods for calculating Adomian polynomials for several nonlinear operators, which utilize the orthogonality of functions einx, where n is an integer. Some important properties of Adomian…

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…

We compute the Fourier coefficients of all degree 2 Siegel-Eisenstein series of square-free level $N$ transforming with the trivial character. We then apply use these formulae to present some explicit examples of higher representation…

This study presents miscellaneous properties of pseudo-factorials, which are numbers whose recurrence relation is a twisted form of that of usual factorials. These numbers are associated with special elliptic functions, most notably, a…

Let p and r be two primes and n, m be two distinct divisors of pr. Consider the n-th and m-th cyclotomic polynomials. In this paper, we present lower and upper bounds for the coefficients of the inverse of one of them modulo the other one.…

We calculate the zeros of an exponential polynomial of some variables by a classical algorithm and quantum algorithms which are based on the method of van Dam and Shparlinski, they treated the case of two variables, and compare with the…