# Tagged Questions

24 views

### Root of polynomial and field extension

I would be really thankful for any input. I am facing following problem. Given extension of finite fields $L/K$ of degree $3$, prove that every polynomial of degree $3$ with coefficients in $K$ does ...
38 views

### Square-free factorization of polynomials over finite fields

For any $f\in\mathbb{F}_q[X]$, I want to derive an algorithm which computes a factorization $$f=\prod_{i=1}^kf_i^i\tag{1}$$ with square-free polynomials $f_i$. My Ideas: If $f'=0$, we're done ...
49 views

### How to prove that all primitive polynomials are irreducible

Let $F$ be a finite field, and $F[X]$ set of all polynomials in $F$, how to prove that: why all primitive polynomials $\;$ $f \in F[X]$ $\;$ must be an irreducible. Note: Polynomial primitive is an ...
48 views

### Proving degree $n$ have at last $n$ roots in $F_q[X]$

How to prove that in $F_{q}[X]$ of degree $n$, have $n$ roots?
54 views

### Show that if $\mathrm{Tr}(y)=0$ then there exists a $x$ such that $x^p-x=y$.

We have the Trace map defined by: $$\mathrm{Tr}\colon \mathbb{F}_q\rightarrow\mathbb{F}_q\colon x\mapsto x+x^p+x^{p^2}+\cdots+x^{p^{n-1}},$$ where $q=p^n$. Now I have to prove that if ...
62 views

### GCD of high order polynomials(modulo large prime)

I want to solve the following question: Consider a polynomial $f(x)=a_0+a_1*x^{e_1}+a_2*x^{e_2}+\cdots+x^{e_m}\in F_p[x]$ where $p$ is a prime such that $\log(p)\sim m$ and $e_m\sim 2^m$, I want to ...
39 views

28 views

### Determinant of a generalization of Moore matrices

The Moore matrix over $\mathbb{F}_q$ is the $n\times n$ matrix whose i'th row is: $a_i,a_i^q,a_i^{q^2},\dots,a_i^{q^{n-1}}$. The determinant of this matrix is the product of all linear combinations ...
40 views

### How to give irreducible factorization in $\mathbb{Z}_5$?

I have this polynomial: $$f=x^5+2x^3+4x^2+x+4$$ How can i find the irreducible factorization(in $\mathbb{Z}_5$)?I can find the roots easily but thats not enough.
26 views

### Every irreducible polynomial in $\mathbb{F}_p[x]$ is separable?

How can I show this? I tried proving the contrapositive statement but didn't get anywhere. I think I may have to do something involving automorphisms of the splitting field of such a polynomial, and ...
62 views

### Do there exist polynomials not computable in polynomial time?

Motivation: Computing a problem in $k$ memory slots Do there exist polynomials in $R = \Bbb{Z}_p[z_1, \dots, z_k]$ that can't be computed in time polynomial in $k,p$? Thanks... Good luck! Edit. I ...
26 views

### Any problem computable in $k$ memory slots can be computed with polynomials.

Let our memory slots be represented by elements of $\Bbb{Z}_p$ for a prime $p$. $k$ memory slots would be $k$ copies of the ring: $R = (\Bbb{Z}_p)^k$. Suppose that for a problem $f : X \to Y$, ...
41 views

70 views

### Relation between divisibility of polynomials in different rings, $h | f$ in $\mathbb{Z}[x], \mathbb{Z}/p^k\mathbb{Z}[x]$ and $\mathbb{F}_p[x]$

Let $p$ be a prime, $k$ a positive integer. Let $f,h \in \mathbb{Z}[x]$ be polynomials such that $h | f \mod p^k$ in $(\mathbb{Z}/p^k\mathbb{Z})[x]$ $h \mod p$ is irreducible in $\mathbb{F}_p$ ...
48 views

### Finding a gcd in the form of a monic polynomial

The question is to find the greatest common divisor (in the form of monic polynomial) in $\Bbb F_5[X]$ of $f=x^2-x+4$ and $g=x^3+2x^2+3x+2$ I used the Euclidian Algorithm for polynomials and found ...
78 views

16 views

### Univariate and Linear Representation Lemma

I'm trying to understand the proof of the lemma: Let $\mathbb{F}$ be a finite field with $q$ elements and $\mathbb{K}$ an extension field of degree $n$ of $\mathbb{F}$. Let $A$ be a linear mapping ...