# Tagged Questions

A finite field is a field with a finite number of elements. For each prime power $q^k$, there is a unique (up to isomorphism) finite field with $q^k$ elements. Up to isomorphism, these are the only finite fields.

2k views

1k views

207 views

### Given g1(x), g2(x) minimize over p(x) Hamming weight of [p(x)g1; p(x)g2(x) ] ? (Or how to find minimal distance of convolutional code?)

Fix polynoms g1(x), g2(x) over F_2[x]. Question: How to find minimum over polynoms p(x) of the: HammingWeight(p(x) g1(x) ) + HammingWeight(p(x) g2(x) ) ? By HammingWeight of polynom I mean number ...
2k views

### Orthogonal Groups over finite fields

Hello Let $\mathbb{F}_p$ be the finite field with $p$ elements. One can show that over finite fields, there are just two non-degenerate quadratic forms. So here I want to pick any non-degenerate ...
286 views

### Special polynomials over finite fields

My field of research is coding theory and I am working on cyclic codes. During my research, I tackled an algebraic problem. After some simple definitions, I asked my question. I will appreciate any ...
317 views

521 views

### Finite Field Grassmannians as Homogeneous Spaces

For the real Grassmannian Gr$(N,k)$ we have the well-known isomorphism $$\text{Gr}(N,k) = O(N)/(O(k) \times O(N-k))$$ For the complex case, we have $$\text{Gr}(N,k) = U(N)/(U(k) \times U(N-k))$$ ...
650 views

### homogeneous polynomials over a finite field

Let $P(x_1, \ldots , x_n)$ be a homogeneous polynomials over a finite field with $q$ elements. Is there any way to count all the roots of $P$?
942 views

### Vandermonde matrices and general position

I was wondering if it is known whether a Vandermonde matrix over a sufficiently large finite field is in general position with respect to intersections of subspaces spanned by subsets of columns, i.e. ...
422 views

### Probability of a set of random vectors over finite field being a spanning set

Suppose I have a set of random vectors $f(a_1, \ldots, a_\ell) := (v_1, \ldots, v_m) \subset F_p^n$, $m \ge n$, given by a matrix valued polynomial function $f$, where the $a_i$'s are independent, ...
335 views

661 views

### Multiplication of matrices in GF(2) and R

$H$ is an $n \times n$ matrix with elements in $\{ -1,1 \}$ $G$ is an $n \times k$ matrix with elements in $GF(2)$ and also upper triangular, invertable $m$ is an $k \times 1$ vector with elements ...
175 views

### Cases of almost-linear time solvable linear systems

Let a square $n\times n$ real matrix ${\bf A}$ and two vectors ${\bf x}$ and ${\bf b}$ of length $n$, such that $${\bf A}{\bf x}={\bf b}.$$ Solving for ${\bf x}$ through standard Gaussian Elimination ...
236 views

### Low degree approximation of the polynomial extension of the logical-or function

Let $x\in\{0,1\}^n$ be a binary vector of dimension $n$, and let $OR(x)$ be the "logical or" function (i.e., returns $1$ if at least one of the coordinates is $1$ and otherwise returns $0$). Consider ...
209 views

### Finding an embedding efficiently in field extension of finite field

We know that $GF(p^c)$ is a subfield of $GF(p^{cn})$. Also we know that elements in $GF(p^c)$ can be represent by degree $c$ polynomials with coefficients in $\mathbb Z_p$, where multiplication is ...
623 views

531 views

### Reducible trinomials $x^{odd}+x^2+s(t)$ in characteristic $2$

Let $F$ be a finite field of characteristic $2$. Let $m \geq 2$ be a positive integer. Seems unknown if the trinomial $$T(t,x) = x^{2m+1}+x^2+s(t) \in F[t][x]$$ (more explicitly, the ...
408 views

### How do the number of plane curves over a finite field of a fixed genus increase with the degree?

Let $k$ be a finite field. We define $N(d,g)$ to be the number of plane curves $f(x,y)$ defined over $k$ of degree $d$ with (geometric) genus $g$. If $D(d) := (d-1)(d-2)/2$ (the maximum possible ...
1k views

### How does Tate verify his own conjecture for the Fermat hypersurface?

This question is about Tate's 1963 paper "Algebraic Cycles and Poles of Zeta Functions". Here he announces a conjecture (now known as "the Tate conjecture") which states that certain classes in the ...
736 views

### best deterministic complexity for factoring polynomials over finite field

I would like to know currently what's the best deterministic complexity for factoring polynomials over finite field (without the assumption of GRH)? I have searched on google, there are many source, ...
### Does $\mathbb{K}[G]\simeq\mathbb{K}[H]$ for some field $\mathbb{K}$ of characteristic $p$, imply $\mathbb{F}_p[G]\simeq\mathbb{F}_p[H]$?
Due to the first (and very helpful) answer I received, I've reformulated the question a little: $G$ and $H$ are now assumed to be $p$-groups. Let $p$ be a prime, and let $\mathbb{F}_p$ be the field ...