Related papers: On a Frobenius problem for polynomials
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…
We discuss the Groenewold-Van Hove problem for R^{2n}, and completely solve it when n = 1. We rigorously show that there exists an obstruction to quantizing the Poisson algebra of polynomials on R^{2n}, thereby filling a gap in Groenewold's…
We consider the problems of testing and learning an $n$-qubit $k$-local Hamiltonian from queries to its evolution operator with respect the 2-norm of the Pauli spectrum, or equivalently, the normalized Frobenius norm. For testing whether a…
In this paper, we give convenient formulas in order to obtain explicit expressions of a generalized Frobenius number called the $p$-Frobenius number as well as its related values. Here, for a non-negative integer $p$, the $p$-Frobenius…
In ISSAC 2017, van der Hoeven and Larrieu showed that evaluating a polynomial P in GF(q)[x] of degree <n at all n-th roots of unity in GF($q^d$) can essentially be computed d-time faster than evaluating Q in GF($q^d$)[x] at all these roots,…
We show how the Fourier transform of a shape in any number of dimensions can be simplified using Gauss's law and evaluated explicitly for polygons in two dimensions, polyhedra three dimensions, etc. We also show how this combination of…
Permutation polynomials over finite fields have wide applications in many areas of science and engineering. In this paper, we present six new classes of permutation trinomials over $\mathbb{F}_{2^n}$ which have explicit forms by determining…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
Lorentzian polynomials are a fascinating class of real polynomials with many applications. Their definition is specific to the nonnegative orthant. Following recent work, we examine Lorentzian polynomials on proper convex cones. For a…
We resolve the open problem of characterizing the Frobenius number $g(A)$ for shifted square sequences $A = (a, a+1^2, \ldots, a+k^2)$, confirming a conjecture of Einstein et al. (2007). By combining a combinatorial reduction to an…
Let $K$ be a field of positive characteristic with no algebraically closed subfield. Let $F$ be a function field over $K$ and $t \in F$ transcendental over $K$. Refining a result of Eisentr{\"a}ger and Shlapentokh, we show that there is no…
The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.
In this paper, a computationally simple and explicit method of constructing recursive sequence of primitive polynomials of degree $n2^k (k = 1, 2, 3,\ldots)$ over $\mathbb{F}_{q}$ is given.
Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
Let $A$ be an abelian variety over a finite field $k$ with $|k|=q=p^m$. Let $\pi\in \text{End}_k(A)$ denote the Frobenius and let $v=\frac{q}{\pi}$ denote Verschiebung. Suppose the Weil $q$-polynomial of $A$ is irreducible. When…
The classical Pell equation can be extended to the cubic case considering the elements of norm one in $Z[\sqrt[3]{r}]$, which satisfy $x^3 + r y^3 + r^2 z^3 - 3 r x y z = 1$. The solution of the cubic Pell equation is harder than the…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes $\widetilde{O}(n^{3/2}\log q + n…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…