Factorization in Quantum Planes

In this paper we construct planar polynomials of the type $f_{A,B}(x)=x(x^{q^2}+Ax^{q}+Bx)\in \mathbb{F}_{q^3}[x]$, with $A,B \in \mathbb{F}_{q}$. In particular we completely classify the pairs $(A,B)\in \mathbb{F}_{q}^2$ such that $f_{A,B}(x)$ is planar using connections with algebraic curves over finite fields.

The polynomial $X^n-1$ and its factorization over $\mathbb F_q$ have been studied for a long time. Many results on this, and the closely related problem of the factorization of the cyclotomic polynomials, exist. We study the factorization of the polynomial $X^n-a$ with $a\in \mathbb F_q^\ast$. This factorization has been studied for the case that there exist at most three distinct prime factors of $n$. If there exists an element $b\in \mathbb F_q$ such that $b^n=a$, the facto...

We classify the pairs of polynomials $f,g$ over a field $K$, such that $f(X)-g(Y)$ has a factor of total degree at most 2. This was done by Y. Bilu for characteristic 0 fields $K$. As his method does not work in positive characteristic, we use a quite different approach.

We give a short proof -- not relying on ideal classes or the geometry of numbers -- of a known criterion for quadratic orders to possess unique factorization.

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine the irreducible factors of $f(x^n)$. We also show the irreducible factors in the case when ${\rm rad}(n)$ divides $q-1$ and ${\rm gcd}(m, n)=1$. Finally, using this algorithm we split $x^n-1$ into irreducible factors, in the case when $n=2^m...

Based on the works of M. Marshall on multirings, we propose the fundamentals for a \textbf{non reduced} abstract quadratic forms theory in general coefficients on rings, with the machinery of multirings and multifields.

For the quantum integer [n]_q = 1+q+q^2+... + q^{n-1} there is a natural polynomial multiplication such that [mn]_q = [m]_q \otimes_q [n]_q. This multiplication is given by the functional equation f_{mn}(q) = f_m(q) f_n(q^m), defined on a sequence {f_n(q)} of polynomials such that f_n(0)=1 for all n. It is proved that if {f_n(q)} is a solution of this functional equation, then the sequence {f_n(q)} converges to a formal power series F(q). Quantum mulitplication also leads t...

Let n be a square-free polynomial over F_q, where q is an odd prime power. In this paper, we determine which irreducible polynomials p in F_q[x] can be represented in the form X^2+nY^2 with X, Y in F_q[x]. We restrict ourselves to the case where X^2+nY^2 is anisotropic at infinity. As in the classical case over Z, the representability of p by the quadratic form X^2+nY^2 is governed by conditions coming from class field theory. A necessary (and almost sufficient) condition is ...

We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years ago. This version of the algorithm contains some improvements with respect to the original sketch. An improved version of the algorithm has been fully implemented in the Axiom computer algebra system.

In this paper, we establish a determinantal formula for 2 x 2 matrix commutators [X,Y] = XY - YX over a commutative ring, using (among other invariants) the quantum traces of X and Y. Special forms of this determinantal formula include a "trace version", and a "supertrace version". Some applications of these formulas are given to the study of value sets of binary quadratic forms, the factorization of 2 x 2 integral matrices, and the solution of certain simultaneous diophantin...