Suppose $q$ is a prime power, gcd($s$,$q$)$=1$ and gcd($s$,$t$)$=1$ and $f(X)$ is a polynomial of degree $t$ over $GF(q)$. Also $u(X,Y)=\sum_{i,j} u_{ij}X^iY^j$, where $u_{ij}\in GF(q)$, $0\leqslant i$, $j<s$ and $si+tj\leqslant m$, $m \in\mathbb{N}$. Suppose $P=\{(x,y)|x,y \in GF(q) \text{ and } y^s=f(x) \}$ and $Z=\{(x,y)|x,y \in GF(q) \text{ and } u(x,y)=0 \}$. We want to show that $P \cap Z$ has no more than $m$ elements. Here's how they do it in the text I'm reading. Since gcd($s$,$q$)$=1$, a field extension $GF(q^l)$ of $GF(q)$ will have a primitive $s$-th root of unity $\zeta$. They claim that if $P'=\{(x,y)|x,y \in GF(q^l) \text{ and } y^s=f(x) \}$ and $Z'=\{(x,y)|x,y \in GF(q^l) \text{ and } u(x,y)=0 \}$, then even $P' \cap Z'$ will have at most $m$ elements. Now, $P'$ can be divided into classes $\{ (x,0)\}$ if $f(x)=0$ and $\{ (x,y),(x,\zeta y),\ldots (x,\zeta^{s-1}y)\}$ in the other case. Consider the classes in which the zeros of $u(X,Y)$ are contained. Apparently, one finds the same classes when one looks at the zeros of $$u^*(X,Y)=u(X,Y)u(X,\zeta Y)\ldots u(X,\zeta^{s-1}Y)$$ (how is this even relevant?). One can show that (I get that now, subject of another question) $u^*(X,Y)=V(X)$ with the degree of $V(X)$ at most $ m$. Now we are supposed to be ready to finalise: The zeros of $u^*(X,Y)$ can thus be grouped into at most $m$ classes. A class of the form $\{ (x,0)\}$ trivially contains at most one zero of $u(X,Y)$. But now for the mysterious part. I quote: A class with $s$ elements contributes at most one zero of $u(X,Y)$ (and at most one zero to each of the other $u(X,\zeta^kY)$). I really can't see why that is. What am I overlooking?
2026-03-26 01:25:13.1774488313
Finding the number of roots of u(X,Y) under certain restrictions
26 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in POLYNOMIALS
- Alternate basis for a subspace of $\mathcal P_3(\mathbb R)$?
- Integral Domain and Degree of Polynomials in $R[X]$
- Can $P^3 - Q^2$ have degree 1?
- System of equations with different exponents
- Can we find integers $x$ and $y$ such that $f,g,h$ are strictely positive integers
- Dividing a polynomial
- polynomial remainder theorem proof, is it legit?
- Polyomial function over ring GF(3)
- If $P$ is a prime ideal of $R[x;\delta]$ such as $P\cap R=\{0\}$, is $P(Q[x;\delta])$ also prime?
- $x^{2}(x−1)^{2}(x^2+1)+y^2$ is irreducible over $\mathbb{C}[x,y].$
Related Questions in FINITE-FIELDS
- Covering vector space over finite field by subspaces
- Reciprocal divisibility of equally valued polynomials over a field
- Solving overdetermined linear systems in GF(2)
- Proof of normal basis theorem for finite fields
- Field $\mathbb{Q}(\alpha)$ with $\alpha=\sqrt[3]7+2i$
- Subfield of a finite field with prime characteristic
- Rank of a Polynomial function over Finite Fields
- Finite fields of order 8 and isomorphism
- Finding bases to GF($2^m$) over GF($2$)
- How to arrange $p-1$ non-zero elements into $A$ groups of $B$ where $p$ is a prime number
Related Questions in CODING-THEORY
- Solving overdetermined linear systems in GF(2)
- Inverting a generator matrix - Coding Theory
- Probability of a block error of the (N, K) Hamming code used for a binary symmetric channel.
- How to decode a Hadamard message that was encoded using the inner product method?
- How to decode a Hadamard message that was encoded using a generator matrix?
- Find the two missing digits in 10-ISBN code
- Characterize ideals in $\mathbb{F}_l[x]/(x-1) \oplus \mathbb{F}_l[x]/(\frac{x^p-1}{x-1})$
- Number of codes with max codeword length over an alphabet
- Dimension of ASCII code
- Prove how many errors CRC code can detect
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
In fact, the proof is wrong, which is a pitty, since this was part of an example of an algebraic geometry (Goppa) code, without going into algebraic geometry (Coding theory, Van Tilborg). Bad Math books (seems to be the norm rather than the exception) take all the fun out of doing maths. Here is a counterexample. If, for example $u(X,Y)= X+XY+X^2+XY^2$ and $f(X)=X^t +1$ with $m\geqslant s + 2t$, then $(0,1)$ and $(0,\zeta)$ belong to the same class of $P'$ and are two different zero's of $u(X,Y)$ nonetheless.