All Questions
Tagged with polynomials finite-fields
797
questions
0
votes
0
answers
16
views
AES S-box as simple algebraic transformation
The next matrix represents the Rijndael S-box according to wikipedia and other sources
$$\begin{bmatrix}s_0\\s_1\\s_2\\s_3\\s_4\\s_5\\s_6\\s_7\end{bmatrix} =
\begin{bmatrix}
1 & 0 & 0 &...
- 463
0
votes
0
answers
20
views
How to understand 'the problem of determining the exact number of monomials in P(x) given by a black box is #P-Complete'
In this paper:https://dl.acm.org/doi/pdf/10.1145/62212.62241, what's given is $P(x)$ a (sparse) multivariate polynomial with real(or complex) coefficients.
The author claimed two things.
It is known ...
- 61
1
vote
1
answer
32
views
Equivalent polynomials over a finite field
Disclamer. I'm not good at math, and the last time I did it in school was 10 years ago, so I'm writing everything in my own words.
Suppose we are working with polynomials in the space of remainders ...
- 13
1
vote
0
answers
54
views
Does there exists something like the BKK Theorem for polynomials over finite fields?
I'm trying to count the number of common $\mathbb{F}_q^\times$-zeros of some polynomials $f,g \in \mathbb{F}_q[x,y]$. I thought I had a solution using the BKK theorem but I reread the theorem ...
- 41
0
votes
1
answer
92
views
Extended euclidian algorithm
I'm trying to understand how the matrix form of the extended euclidian algorithm for polynomials works for a BCH code with coefficients from $GF(2^4)$ in https://en.wikipedia.org/wiki/BCH_code
for ...
- 315
2
votes
2
answers
85
views
In polynomial quotient rings over $\mathbb{F}_2$, how to use Chinese Remainder Theorem to solve equations?
Suppose I work over the polynomial quotient ring $\mathbb{F}_2[x,y]/\langle x^m+1,y^n+1\rangle$, and I want to solve for polynomials $s[x,y]$ that simultaneously solve the equations
\begin{equation}
a[...
- 133
1
vote
0
answers
86
views
Number of irreducible polynomials of degree at most n over a finite field
We know that the number $N(n,q)$ of irreducible polynomials of degree $n$
over the finite field $\mathbb{F}_q$
is given by Gauss’s formula
$$N(n,q)=\frac{q-1}{n} \sum_{d\mid n}\mu(n/d)q^d.$$
The number ...
1
vote
0
answers
29
views
Order of $\mathbb F _p [x] / (f)$.
I could use some help with the following exercise:
Find the number of reducible monic polynomials of degree $2$ over $\mathbb F_p$. Show this implies that for every prime $p$ there exists a field of ...
- 485
0
votes
0
answers
28
views
What's the point of the local zeta function?
I'm currently reading through Ireland and Rosen's "A Classical Introduction to Modern Number Theory", and I feel I'm missing the point of Chapter 11 on (local) zeta functions. When I see ...
- 584
0
votes
2
answers
82
views
Is this $f(x) = x^{6}+x^{5}+x^{4}+x^{3}+x^{2}+x+1$ irreducible in GF(5)?
Perhaps one can somehow apply Eisenstein's sign here by considering $f(x+1)$, but by default it is formulated for the expansion over $\mathbb{Q}$ of a polynomial from $\mathbb{Z}[x]$. Here we have $GF(...
- 15
0
votes
1
answer
77
views
Show that GF(81) is an $x^{26}+x^{8}+x^{2}+1$ decomposition field
I tried decomposing the polynomial, but after taking out $(x^{2}+1)$ you have to break the remainder into polynomials of degree 4, which is manually hard. Perhaps this is solved by using Frobenius ...
- 15
3
votes
0
answers
67
views
Is this connection between prime numbers, prime polynomials, and finite fields true?
I recently learned of the following connection between prime numbers and prime polynomials in the field of cardinality $2$. Namely, you take a natural number $n$, and use the digits of the base $2$ ...
- 21.4k
2
votes
1
answer
73
views
Why should a splitting field of a polynomial over $\mathbb{F}_p[X]$ be a cyclotomic extension?
I have just been doing a Galois theory exercise and one part of the exercise requires me to explain why, if $f \in \mathbb{F}_p[X]$ is a polynomial of degree $n$, its splitting field $L$ is a ...
- 474
0
votes
0
answers
54
views
When is $f = X^4 -1 \in \mathbb{F}_p[X], p $prime, irreducible and/or seperable? [duplicate]
I'm having some trouble figuring out a solution to this. I understand that $f$ is separable, iff all its roots are distinct, however I'm completely clueless about how to investigate that criterion......
- 17
6
votes
2
answers
151
views
Irreducible polynomial in $\Bbb{Z}_2[x]$
Suppose $2k + 1 \equiv 3 \mod 4$ in $\Bbb{Z}_{\geq 1}$.
Is the polynomial: $p_k(x) = x^{2k + 1} + x^{2k - 1} \dots + x + 1$ irreducible in $\Bbb{Z}_2[x]$?
I do not know whether it is true or not...
(...
- 515
0
votes
0
answers
37
views
Degree of factors of the Artin–Schreier polynomial in $\mathbb{F}_q$. [duplicate]
Consider the field $\mathbb{F}_q$, where $q$ is a power of $p$, say $q=p^n$. Let $f=x^q-x-a\in\mathbb{F}_q[x]$, with $a\in\mathbb{F}_q$.
I'm trying to determine the degree of the irreducible factors ...
- 329
1
vote
0
answers
31
views
Cardinality of the zero locus of a degree 2 homogeneous polynomial on Z/2Z: avoiding Chevalley-Warning
I have never developed sufficient knowledge in algebraic geometry but I ran into an apparently easy problem, so I apologise in advance if my question sounds naive.
Suppose to have a degree $2$ ...
- 123
1
vote
1
answer
68
views
Irreducible polynomials in $\mathbb F_q[T]$
Let $q$ be a power of a prime $p$. Is there an infinite set $S$ of $\mathbb N$ such that for every $l\in S$, the polynomial $T^{q^l}-T-1$ is irreducible in $\mathbb F_q[T]$.
It looks like Artin-...
- 1,157
0
votes
1
answer
93
views
Factorize $x^4 + 4x^2 +1$ over $\mathbb{F}_{29}$
How do I factorize $x^4 + 4x^2 +1$ over $\mathbb{F}_{29}$?
I checked that the discriminant $D = 16 -4 = 12$ is not a square ($12^{14} = -1 \mod 29$) so this polynomial has no roots. Therefore it's ...
- 2,636
1
vote
1
answer
30
views
Distinct derivations of polynomial over finite field
I am a student studying algebra and cryptography.
I wonder below question is possible.
Can I make some polynomials $f(x)$ over finite field that all derivations $f^{(k)}(x)$ are distinct when x is ...
- 13
1
vote
1
answer
89
views
Calculating the gcd of two polynomials in integers using a prime field
Let $f, g \in \mathbb{Z}[x]$. Let also $h \in \mathbb{Q}[x]$ be the $\gcd(f,g)$ found by the Euclidean algorithm. Now, for $p$ an odd prime, let $h^* \in \mathbb{Z}/p\mathbb{Z}[x]$ be the $\gcd(f,g)$ ...
- 172
1
vote
1
answer
45
views
Find $m$ degree $q^{m-1}$ polynomials which give a bijection $\mathbb{F}_{q^m}\cong \mathbb{F}_{q}^m$ with the map $x\mapsto (p_1(x),\dots,p_m(x))$
Let $q$ some prime power. Now take the field $\mathbb{F}_{q^m}$.
We need to find polynomials $p_1(x),p_2(x),\dots,p_m(x)\in \mathbb{F}_{q^m}[x]$ such that $\deg{p_i(x)}=q^{m-1}$ and they also satisfy ...
- 19
2
votes
2
answers
130
views
Number of solutions to $x^2−y^2=a$ over a finite field.
Consider F is a finite field with $ q$ elements, where $q=p^n$, p prime, and n is an integer. Give the number of solutions of pairs (x,y) for the equation $$ x^2-y^2=a $$ according to the value of $ q ...
3
votes
0
answers
109
views
Roots of a irreducible polynomial are linearly independent over a finite field.
Question. When does a irreducible polynomial contains linearly independent roots over a finite field?
Motivation. For a finite cyclic Galois extension $E/F$, if $\alpha\in E$ generates a normal basis, ...
- 2,503
2
votes
1
answer
64
views
Fields of characteristic $p$ where there exists an element $a$ that is not a p:th power.
Suppose $K$ is a field of characteristic $p$, but that $K \neq K^p$, that is, there exists an element $a \in K$ such that there is no $b \in K$ so that $b^p = a$. We want to prove that this implies ...
- 1,276
0
votes
1
answer
44
views
Factorize $x^3-1$ in $F_3[x]$ into irreducible polynomials
I'm fairly new to this topic:
We can see that $x^3-1=(x-1)(x^2+x+1)$
But what I don't understand is how $(x^2+x+1)$ can be further reduced to $(x-1)^2$
Many thanks
- 109
4
votes
0
answers
54
views
Partial fraction decomposition over $\mathbb{F}_{n}[x]$
Consider the rational function $\dfrac{f(x)}{g(x)} \in \mathbb{F}_{n}[x]$ such that $g(x) = p(x) \cdot h(x)$. If $\gcd\left(p(x), h(x)\right) = 1$, then $$\dfrac{f(x)}{g(x)} = \dfrac{f(x)}{p(x) \cdot ...
user1236748
0
votes
0
answers
32
views
A faster way to check irreducibility of quartics in finite fields
A quadratic or a cubic can be shown to be irreducible in $\mathbb{F}_p$ by showing that none of $0, \dots,p-1$ are roots (or more generally all the elements of $\mathbb{F}_{p^n}$). This does not work ...
- 3,940
4
votes
1
answer
99
views
Does $\gcd(x^{p^2+p+1}-1, (x+1)^{p^2+p+1}-1)\neq 1$ in $\mathbb{F}_p[x]$ for all primes $p$?
It seems that for every prime $p$, $x^{p^2+p+1}-1$ and $(x+1)^{p^2+p+1}-1$ are not coprime in $\mathbb{F}_p$. In other words, it seems that there is always a $(p-1)$-th power $x$ in $\mathbb{F}_{p^3}^\...
- 1,923
0
votes
1
answer
90
views
Why can't individual terms of a summation not cancel each other in the 2nd case?
Below is from a paper.
$F(.)$ is a low-degree multivariate polynomial over $\mathbb F$ in $s$ variables.
Checking if $\sum_{x \in \lbrace0,1\rbrace^s} F(x) = 0$ will not prove that that $F(x) = 0\...
- 486