Skip to main content

Questions tagged [finite-fields]

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.

Filter by
Sorted by
Tagged with
3 votes
0 answers
188 views

I would like to know how much of the results on the Minimal Model Programme (MMP) over fields of finite characteristicb which are usually only stated for varieties over algebraically closed fields, ...
Jesus Martinez Garcia's user avatar
0 votes
0 answers
68 views

Let $E$ be supersingular elliptic curve defined over $\mathbb{F}_{p^2}$ and let $\ell$ be a prime. I'd like to know how one can check if E shares an edge, in the $\ell$-isogeny graph, with the set of ...
Alexander's user avatar
  • 377
2 votes
0 answers
118 views

Let $F(X,Y)$ and $G(X,Y)$ be formal group laws over $\mathbf{F}_p$ of finite height. Hill proved (in this paper, Theorem E') that if $F$ and $G$ have the same characteristic polynomial of Frobenius, ...
Adithya Chakravarthy's user avatar
8 votes
1 answer
469 views

Let $F$ be the finite field ${\rm GF}(2^n)$ of order $2^n$. Let $X=F\setminus\{0\}$ be its multiplicative group. Suppose that $n/d$ is odd where $k\in\{1,\dots,n\}$ and $d=\gcd(k,n)$, so that the ...
Glasby's user avatar
  • 2,209
0 votes
0 answers
71 views

Let $p$ be a prime. I thought of ways to select a unique monic irreducible polynomial of degree n over a finite field with p elements. Most things failed, but this here seems to give at most 2 such ...
Mare's user avatar
  • 28.1k
3 votes
1 answer
302 views

Let $F$ be the finite field ${\rm GF}(p^n)$ of order $p^n$. The automorphism $\theta(x)=x^{p^k}$ of $F$ has order $n/d$ where $d=\gcd(n,k)$. Consider the function $f(x)=\theta(x)-x^{-1}$ from $X:=F\...
Glasby's user avatar
  • 2,209
2 votes
1 answer
245 views

Let $q=p^n$ be a prime power ($p$ is prime and $n\in\mathbb{Z}_{\ge 1}$) and $\mathbb{F}_q$ be a finite field with $q$ elements. Set $\widehat{\mathbb{F}_q^*}$ be the group of all multiplicative ...
Beginner's user avatar
  • 109
5 votes
1 answer
308 views

Let $A$ be an affine subspace of $\mathbb{F}_2^n$. Let $m\leq n$ and $Q_0, Q_1$ be linear maps $\mathbb{F}_2^n\rightarrow\mathbb{F}_2^m$. Consider the following decision problem: Decide whether or not ...
JAN's user avatar
  • 401
4 votes
1 answer
189 views

Consider the space of $n \times n$ matrices over the finite field $GF(2)$. Is it possible to choose $k$ matrices $A_i, i = 1 ,\cdots k$, such that for every non-zero vector $b \in \{0,1\}^k$ the ...
Daniel Turizo's user avatar
2 votes
0 answers
268 views

Let $\Omega$ be the completion of $\overline{\mathbb F_q\left(\left(\frac1T\right)\right)}$ for the topology induced by valuation $-\deg$. One denotes by $|.|_\Omega$ the associated normalized norm ($|...
joaopa's user avatar
  • 4,286
0 votes
0 answers
185 views

How to construct a full-rank $n \times m$ matrix over $\mathbb{F}_2$ with $m > n$, minimizing width and row sparsity? Goal: Construct a matrix $X \in \mathbb{F}_2^{n \times m}$, with $m > n$, ...
AC.PR's user avatar
  • 19
15 votes
1 answer
716 views

I have a polynomial of degree around $2^{35}$ over a finite field $\mathbb{F}_p$, where $p$ is a 64-bit prime number. What is the most efficient algorithm for finding a root of such a polynomial? (...
user's user avatar
  • 151
3 votes
1 answer
135 views

Consider a random $2 \times n$ matrix $X$ whose entries $X_{ij}$ take values in a finite field $E$ of characteristic $p$. Although the entries may not be independent, they satisfy the following non-...
darko's user avatar
  • 355
6 votes
1 answer
483 views

Let $a,b,c,q$ be positive integers. One way to generalize the standard Kloosterman sum to two variables is $$ K(a,b,c;q) := \sum_{\substack{x_1\, \text{(mod $q$)}\\ (x_1,q)=1}} \sum_{\substack{x_2\, \...
Joshua Stucky's user avatar
1 vote
0 answers
151 views

Let $\mathbb{F}_n$ denote the finite field with $n$ elements. Suppose that the (non-tall) matrix ${\bf M} \in \mathbb{F}_n^{r \times n}$, where $r \leq n$, has rank $r$ and for any $k \leq r$, the ...
John's user avatar
  • 11
1 vote
0 answers
66 views

We got a fast probabilistic algorithm for factorizations of univariate polynomials of special form modulo $N$ and would like to know if it is known or trivial. Let $N$ be composite integer with ...
joro's user avatar
  • 25.7k
3 votes
0 answers
189 views

Let $G$ be a semisimple algebraic group over the finite field $\mathbf{F}_p$. Question 1. When is $G(\mathbf{F}_p)$ a solvable group? The obvious guess is "rarely". Due to some well-known ...
cofsg's user avatar
  • 31
12 votes
1 answer
359 views

In this post, I don't require division algebras to be necessarily associative (but I do require a unit element). In synthetic projective geometry (part of incidence geometry), there is the notion of a ...
Lukas Heger's user avatar
  • 1,002
5 votes
1 answer
634 views

If $Q(x) = x^T A x$ with $x \in GF(2)^n$ and $A \in GF(2)^{n \times n}$, is there a way to find how many roots $Q(x)$ has based on any properties of $A$ (e.g., rank, etc.)?
Fabio Dias's user avatar
8 votes
1 answer
349 views

Let $p \gg 1$ be a sufficiently large prime. I recently stumbled across a fascinating fact about the number of $\mathbb{F}_p$-points on elliptic curves over finite fields. Specifically, we have: Fact ...
Ashvin Swaminathan's user avatar
2 votes
1 answer
275 views

Let $f$ be a polynomial over a finite field $\mathbf{F}_p$ with $p \neq 2$. Let $R$ be the roots of $f$ in some extension field. I am interested in the multiset of differences $R - R = \{ r - s \mid r,...
darko's user avatar
  • 355
4 votes
1 answer
458 views

Let $A$ be a uniformly random matrix in $\mathrm{M}_n(\mathbf{F}_p)$. It is well known that, as $p$ is fixed and $n$ tends to infinity, $A$ has repeated eigenvalues (over the algebraic closure $\...
darko's user avatar
  • 355
2 votes
0 answers
223 views

$\DeclareMathOperator\GL{GL}\DeclareMathOperator\SL{SL}\DeclareMathOperator\PGL{PGL}\DeclareMathOperator\PSL{PSL}$Consider the general linear group $\GL(n,q)$ over a finite field with $q$ elements and ...
Nick Belane's user avatar
3 votes
2 answers
358 views

The general linear group $GL_n(\mathbb{F}_2)$ acts on the powerset $2^{{\mathbb{F}_2}^n \setminus \{0\}}$ by multiplication: $A \cdot S := \{Ax \in {\mathbb{F}_2}^n : \, x \in S\}$, for an invertible ...
Colin Tan's user avatar
2 votes
0 answers
129 views

I am trying to follow the construction of the Ramanujan graph $X^{p, q}$ given in the paper 1. The first few steps of the construction proceed as follows: Let $p$, $q$ be two unequal primes that are ...
xzd209's user avatar
  • 273

1
2 3 4 5
17