All Questions
22
questions
0
votes
0
answers
96
views
Algebraic independence and substitution for quadratics
Let $f_{1},...,f_{n-1} \in \mathbb{F}[x_1,...,x_n]$ such that $\{ f_1,..., f_{n-1},x_n \}$ is algebraically independent over $\mathbb{F}$. Let $G \in \mathbb{F}[x_1,...,x_n,y_1,...,y_{n-1}]\...
- 181
0
votes
0
answers
112
views
Relation between minimality and algebraic independence for binomials?
$\DeclareMathOperator\supp{supp}$Given $f_1,...,f_n \in \mathbb{F}[x_1,...,x_n]$ such that
$f_1 = x_1 + q_1$
$f_2 = x_2 + q_2$
$\cdot \cdot \cdot$
$f_{n-1} = x_{n-1} + q_{n-1}$
$f_{n} = q_n$
such that ...
- 181
2
votes
1
answer
200
views
Minimality implies algebraic independence?
$\DeclareMathOperator\supp{supp}$Given $f_1,...,f_n \in \mathbb{F}[x_1,...,x_n]$ such that
$f_1 = x_1 + q_1$
$f_2 = x_2 + q_2$
$\cdot \cdot \cdot$
$f_{n-1} = x_{n-1} + q_{n-1}$
$f_{n} = q_n$
such that ...
- 181
4
votes
1
answer
330
views
GCD in $\mathbb{F}_3[T]$ with powers of linear polynomials
This is a continuation of my previous question on $\gcd$s of polynomials of type $f^n - f$.
Let us call $n > 1$ simple at a prime $p$ when $p-1 \mid n-1$ but $p^k - 1 \not\mid n-1$ for all $k > ...
- 62.1k
0
votes
0
answers
89
views
Representing an $m$ dimensional quadratic polynomial as a polynomial on $\mathbb F_{q^m}$
We can represent $\mathbb{F}_{q^m}$ as $\mathbb{F}_q[\alpha]$ where $\alpha$ is root of an irreducible $m$-degree polynomial on $\mathbb{F}_q$.
By sending $\sum_{i=0}^{m-1} c_i\alpha^i \mapsto (c_{m-1}...
- 1
2
votes
0
answers
116
views
When $\gcd(P(x),Q(x))\bmod R(x)=\gcd(P(x) \bmod R(x),Q(x) \bmod R(x))$?
Let's $P,Q\in\mathbb K[x]$, with $\mathbb K$ a finite field.
On what necessary and sufficient condition on $R \in \mathbb K[x]$ is it :
$\gcd(P(x),Q(x))\bmod R(x)=\gcd(P(x) \bmod R(x),Q(x) \bmod R(x))...
- 3,824
10
votes
1
answer
320
views
Proving that polynomials belonging to a certain family are reducible
In an article, I've found the following result. Unfortunately, it was derived from a general, somewhat complicated theory, that would be cumbersome for this result alone.
Assume that $\mathbb F_p$ is ...
- 687
7
votes
1
answer
979
views
Polynomials which are functionally equivalent over finite fields
Recall that two polynomials over a finite field are not necessarily considered equal, even if they evaluate to the same value at every point. For example, suppose $f(x) = x^2 + x + 1$ and $g(x) = 1$. ...
- 1,703
21
votes
1
answer
577
views
Existence of a polynomial $Q$ of degree $\geq (p-1)/4$ in $\mathbb F_p[x]$ such that $QQ'$ factorizes into distinct linear factors
For all primes up to $p=89$ there exists a product $Q=\prod_{j=1}^d(x-a_j)$ involving $d\geq (p-1)/4$ distinct linear factors $x-a_j$ in $\mathbb F_p[x]$ such that $Q'$ has all its roots in $\mathbb ...
- 17.6k
11
votes
4
answers
1k
views
Explicit large finite fields in characteristic $2$
Every finite field of characteristic $2$ ist given by $\mathbb{F}_2[x]/P(x)$ for some irreducible polynomial $P\in \mathbb{F}_2[x]$.
For small degree, a simple algorithm gives a way to find $P$. Is ...
- 7,682
4
votes
1
answer
647
views
Jacobian criterion for algebraic independence over a perfect field in positive characteristics
It is well known that the Jacobian criterion for algebraic independence does not hold in general for fields of positive characteristics. However, the following partial statement seems promising:
...
- 935
2
votes
0
answers
66
views
Partitioning a given set into root set of two polynomials or non zero set of two polynomials simultaneously
Let $p,q$ be two prime numbers and let $p<q.$ Also let, $\mathbb{Z}_p$ and $\mathbb{Z}_q$ denote the fields formed by integers modulo $p$ and modulo $q$ respectively (with respect to the modulo $p$ ...
- 850
11
votes
1
answer
472
views
Greatest common divisor in $\mathbb{F}_p[T]$ with powers of linear polynomials
Let $n>1$ and $p$ be an odd prime with $p-1 \mid n-1$ such that $p^k - 1 \mid n-1$ does not hold for any $k>1$. Notice that, since $p-1 \mid n-1$, we have $T^p - T \mid T^n-T$ in $\mathbb{F}_p[T]...
- 62.1k
6
votes
0
answers
114
views
A question about the span of a sequence of polynomials satisfying a linear recurrence
Let F be a finite field and A(n) in F[t], n in N, be defined by a linear recurrence with coefficients in F[t], together with initial conditions. Is there a decision procedure for determining whether ...
- 5,412
4
votes
0
answers
253
views
When is a given polynomial a square of another polynomial?
I meet a problem in which I hope to show a special polynomial is not a square of another polynomial. More precisely, let's consider the polynomial
$f(x):= 1-x+2bx^n-2bx^{n+1}-b^2x^{2n-1}+2b^2x^{2n}-b^...
- 271