# Tagged Questions

Finite fields are structures arising in abstract algebra. The order of a finite field is always a prime power, and for each prime power $q$ there is a single isomorphism type. It is usually denoted by $\mathbb{F}_q$ or $\operatorname{GF}(q)$.

2answers
32 views

### Bruhat decomposition and the order of the group.

Suppose we have a group $G(q)$ over a finite field $\mathbb{F}_q$. How can the Bruhat decomposition be used in order to calculate the order of $G(q)$? Are there any examples for some particular groups?...
1answer
50 views

### Additive combinatorics and $|S \cap (S+t)| \geq K |S|$ over $\mathbb{F}_2^n$

I don't know much about additive combinatorics, and I am wondering if there are results concerning the size of $|S \cap (S+t)|$ where $S \subset \mathbb{F}_2^n$ and $t \in \mathbb{F}_2^n$. Especially, ...
0answers
78 views

2answers
36 views

### Irreducible polynomials over $GF(4)$.

I'm working with $GF(4)$ and I'm looking for irreducible polynomials of different degrees over that field. So $GF(4) = \{0,1,\alpha, \alpha + 1\}$ where $\alpha^{2} + \alpha + 1 = 0$, and first I'm ...
0answers
24 views

0answers
21 views

### finite fields: efficient primitive element test?

Suppose $x \in F_n^{*}$, where $F_n$ is a finite field. Is there an efficient way to test whether x is a primitive element? This is the best I can come up with: You factor n-1 into all of its factors,...
1answer
20 views

### Is this a hyperplane or a half-space in $\mathbb{F}_2^n$?

Simple terminological question: the equation $x_1+\dots+x_n = 0$ over $\mathbb{F}_2^n$ is called a subspace. I'm wondering if we could also call it a hyperplane, a half-space or neither? The equality ...
0answers
27 views

### Let $F$ be a finite field, $E$ a field extension, and $A,B\in M_n (F)$ conjugate in $M_n (E)$

Prove that $A$ and $B$ are conjugate matrices in $M_n (F)$. The question is from K. Conrad's notes on Potential Diagonalizability of Linear Operators, which he proves for the case of infinite fields ...
1answer
58 views

### Solving an equation involving the trace of a field

Let $F$ be a finite field of order $q$ where $q=2^{n}$ and fix $l\in F\setminus{0}$ with $Tr(l)=0$. I want to determine the number of $a$ such that $$Tr(la)=Tr(la^{-1})=1,$$ where $Tr$ denotes the ...
1answer
96 views

0answers
69 views

### Does NTT have an upper bound?

I'm working with NTT (Number theoretic transform) to reduce the complexity of a polynomial multiplication. For this, I'm using $P = 2^{64}-2^{32}+1$ to generate the primitive root $\omega_N$ needed by ...
2answers
64 views

### Show that $\mathrm{SO}_3(\mathbb{Q}_p) \simeq \mathrm{SL}_2(\mathbb{Q}_p)$

I read in a paper that $\mathrm{SO}_3(\mathbb{Q}_p) \simeq \mathrm{SL}_2(\mathbb{Q}_p)$ this is counterintuitive / surprising since $\mathrm{SO}_3(\mathbb{R}) \not \simeq \mathrm{SL}_2(\mathbb{R})$ ...
2answers
54 views

### Totien-Sum: why GCD( {n}/d, q/d) = 1; implies Sum{Totient(d/q) } = q

Have seen answer to this question. still don't understand.. Totient sum is defined: q = Sum(Totient (d) ); sum on all d : d|q More specific; The proof has these steps: 1. If d is a divider ...
1answer
57 views

### I don't understand a step of the proof that a nonzero finite commutative ring with no zero divisors is a field.

This seems to be a fairly classic problem in algebra: Let $R$ be a nonzero finite commutative ring with no zero divisors. Prove that $R$ is a field. Here is the a solution I came across: ...
0answers
34 views

### General Multiplication Algorithm for Finite Field of GF(p^m) for small values of p^m

I am working on a small computer program to generate multiplication table of general finite field in form of GF(p^m) where p is a prime number and m is an integer greater than one. While the special ...
1answer
60 views

### Are zeta functions discussed over finite fields? [closed]

Let $\mathbb{F}$ be a finite field. I wonder if someone discussed the behaviour of the analogous of zeta functions over $\mathbb{F}$? For example, one can easily see that \$\zeta_{\mathbb{F}}(-1)=\sum_{...