Related papers: On a Frobenius problem for polynomials

In this paper, we consider the new q-extension of Frobenius-Euler numbers and polynomials and we derive some interesting identities from the orthogonality type properties for the new q-extension of Frobenius-Euler polynomials. Finally we…

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

A time-dependent monic polynomial in the z variable with N distinct roots such that exactly one root has multiplicity m>=2 is considered. For k=1,2, the k-th derivatives of the N roots are expressed in terms of the derivatives of order j<=…

The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of $K_{2n+1}$ into edge-disjoint copies of a given $2$-factor. We show that this can be achieved for all large $n$. We actually prove a significantly more general…

In this work we present a new polynomial map $f:=(f_1,f_2):{\mathbb R}^2\to{\mathbb R}^2$ whose image is the open quadrant $\{x>0,y>0\}\subset{\mathbb R}^2$. The proof of this fact involves arguments of topological nature that avoid hard…

In this paper, we give some new and interesting identities which are derived from the basis of Frobenius-Euler. Recently, Simsek et als(see [13]) have given some identities of q-analogue of Frobenius-Euler polynomials related to q-Bernstein…

We give algorithms to compute isomorphism classes of ordinary abelian varieties defined over a finite field $\mathbb{F}_q$ whose characteristic polynomial (of Frobenius) is square-free and of abelian varieties defined over the prime field…

In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…

The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…

Let (K, v) be a henselian valued field of arbitrary rank. In this paper, we give an irreducibility criterion for multivariate polynomials over K using valuation theory.

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

The main subject of this paper is the study of analytic second order linear partial differential equations. We aim to solve the classical equations and some more, in the real or complex analytical case. This is done by introducing methods…

These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…

By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm g(y)^2$ for some simple Laurent polynomials $f$ and $g$.

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

The previous paper [4] proved the existence of primitive polynomials and primitive normal polynomials of degree n with k prescribed coefficients in the finite field GF(q) for all sufficiently large q. This paper presents a loger versions of…

We classify Frobenius forms, a special class of homogeneous polynomials in characteristic $p>0$, in up to five variables over an algebraically closed field. We also point out some of the similarities with quadratic forms.

We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic…