Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 31356

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.

0 votes
1 answer
79 views

Degree of a field extension with a rational solution

Let $S$ be a system of polynomial equations over $\mathbb{F}_q$. Assume that $S$ has a solution in $\overline{\mathbb{F}_q}$. Denote by $k$ the minimal number such that $S$ has $\mathbb{F}_{q^k}$- …
Alexey Milovanov's user avatar
1 vote
0 answers
88 views

Calculation of cardinality of Jacobians

The problem of calculation the number of rational points on curves over finite fields is $\#P$-complete - "Counting curves and their projections". Is it true for calculation of number of rational p …
Alexey Milovanov's user avatar
5 votes
0 answers
187 views

Zeta function of $\Delta[\text{det},m]$

In Geometric complexity theory the following variety $\Delta[\text{det},m]$ is crucial. Let $X=(x_1,\ldots,x_r)$ be a tuple of $r=m^2$ variables, so that $X$ can be thought of as an $m\times m$ varia …
Alexey Milovanov's user avatar
5 votes
1 answer
528 views

Schwartz-Zippel lemma for an algebraic variety

Let $X $ be a smooth affine subvariety of $(\overline{\mathbb{F}_q})^n$ defined by a prime ideal $I$. Let $f$ $\in \mathbb{F}_q[x_1,\ldots,x_n]$ be a polynomial such that $f \notin I$. Let $r_1, \ld …
Alexey Milovanov's user avatar
12 votes
0 answers
445 views

Geometric complexity theory for finite fields

Geometric complexity theory (GCT) is an approach via algebraic geometry and representation theory towards the P vs. NP problems and related problems Ketan D. Mulmuley. More precisely, the idea is to …
Alexey Milovanov's user avatar
2 votes
0 answers
194 views

Number of common solutions of polynomial system

Let $ \mathbb{F}_p$ be a finite field and $\{f_j\}_{j=1}^{j=r} \subseteq \mathbb{F}_p[X_1,...,X_n]$ be a set of polynomials. Let consider the system of equations: $f_j(x_1,...,x_n)=0$ for $j = 1,.. …
Alexey Milovanov's user avatar
4 votes
2 answers
541 views

Irreducible algebraic sets via irreducible polynomials

There are many results about irreducible polynomials over finite fields: we know a cardinality of all irreducible polynomials with given degree, we know explicit examples of irreducible polynomials, …
Alexey Milovanov's user avatar
1 vote
0 answers
152 views

Efficient deterministic algorithms of factorizing

My question is about efficient deterministic algorithms of factorizing polynomials of degree $n$ over $\mathbb{F}_q$. Are there such algorithms that use poly$(n, \log q)$ bit operations? I know tha …
Alexey Milovanov's user avatar
3 votes
0 answers
386 views

Calculation of Cartier-Manin matrix

Let $\mathbb{F}_q$ be a finite field of characteristic $p$ and let $C$ be a plane projective nonsingular curve over $\mathbb{F}_q$ , with function field $K = \mathbb{F}_q(C)$. Let $K^p$ denote the sub …
Alexey Milovanov's user avatar
0 votes

Equations of elliptic curves

Curve $E$ with equation $y^2 = x^3 + 1$ has $p+1$ rational points over $\mathbb{F}_p$ when $p = 5$ (mod $6$). Let $q = p^n$. $|E(\mathbb{F}_{q^2})| = q^2 \pm 2q +1$. Let $\zeta_6$ is generator of $\m …
Alexey Milovanov's user avatar
1 vote
2 answers
470 views

Equations of elliptic curves

First part of question I have asked on mathoverflow already: https://math.stackexchange.com/questions/467088/explict-form-of-the-equation-of-elliptic-curve 1) Let $E(\mathbb{F}_{q^2})$ is elliptic cu …
Alexey Milovanov's user avatar
13 votes
1 answer
1k views

An efficient isomorphism between finite fields

Let $p$ be a prime number. Let $f$ and $g$ be irreducible polynomials over $\mathbb{F}_p$, both of degree $n$. We know that factor-rings $\mathbb{F}_p[x]/(f)$ and $\mathbb{F}_p[x]/(g)$ are isomorphic …
Alexey Milovanov's user avatar