Degrees of factors of pth cyclotomic polynomial in GF(q^n) Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Irreducible factors of $X^p-1$ in $(mathbbZ/q mathbbZ)[X]$Cyclotomic polynomial over a finite prime fieldModulo factoring of cyclotomic polynomialsDegrees of factors of polynomial $f(x)=x^q-(ax^2+bx+c)in mathbbF_q[x]$Inertia Degree in Cyclotomic ExtensionsCyclotomic polynomial, after adjoining a radicalFollow up question to finding primes $p$ such that $f(x)=x^6 - x^3 +1$ factors (in various ways) in $mathbbF_p$Roots of $Phi_31(x)$ as roots of unity.Degrees of irreducible factors of a polynomial over finite fieldIrreducible monic polynomial in $mathbbQ[x]$

How can players take actions together that are impossible otherwise?

How should I respond to a player wanting to catch a sword between their hands?

Notation for two qubit composite product state

How does modal jazz use chord progressions?

Can a monk deflect thrown melee weapons?

Is above average number of years spent on PhD considered a red flag in future academia or industry positions?

What items from the Roman-age tech-level could be used to deter all creatures from entering a small area?

Passing functions in C++

How to say 'striped' in Latin

If I can make up priors, why can't I make up posteriors?

Slither Like a Snake

3 doors, three guards, one stone

Classification of bundles, Postnikov towers, obstruction theory, local coefficients

Can a non-EU citizen traveling with me come with me through the EU passport line?

Can a zero nonce be safely used with AES-GCM if the key is random and never used again?

Problem when applying foreach loop

Why don't the Weasley twins use magic outside of school if the Trace can only find the location of spells cast?

Stopping real property loss from eroding embankment

Unexpected result with right shift after bitwise negation

What are the performance impacts of 'functional' Rust?

The following signatures were invalid: EXPKEYSIG 1397BC53640DB551

Why does tar appear to skip file contents when output file is /dev/null?

Windows 10: How to Lock (not sleep) laptop on lid close?

How do you clear the ApexPages.getMessages() collection in a test?



Degrees of factors of pth cyclotomic polynomial in GF(q^n)



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Irreducible factors of $X^p-1$ in $(mathbbZ/q mathbbZ)[X]$Cyclotomic polynomial over a finite prime fieldModulo factoring of cyclotomic polynomialsDegrees of factors of polynomial $f(x)=x^q-(ax^2+bx+c)in mathbbF_q[x]$Inertia Degree in Cyclotomic ExtensionsCyclotomic polynomial, after adjoining a radicalFollow up question to finding primes $p$ such that $f(x)=x^6 - x^3 +1$ factors (in various ways) in $mathbbF_p$Roots of $Phi_31(x)$ as roots of unity.Degrees of irreducible factors of a polynomial over finite fieldIrreducible monic polynomial in $mathbbQ[x]$










0












$begingroup$


Given p, q distinct primes, what are possible degrees of factors of $Phi_p(x)$ in $mathbbF_q^n[x]$? In the case of n=1, every factor has degree the order of q in $mathbbZ/pmathbbZ$ so if q is primitive mod p then this should be irreducible. But what about the case when n > 1?










share|cite|improve this question









$endgroup$











  • $begingroup$
    Do you know the proof of the assertion in your second sentence? Does it work when $Bbb F_q$ is replaced by $Bbb F_q^n$? If not, where does the proof fail?
    $endgroup$
    – Greg Martin
    Mar 31 at 19:29










  • $begingroup$
    The proof I worked out (not 100% sure if it's right), is that if you have a root $a$ in the algebraic closure of $F_q$ then using the frobenius automorphism gives d distinct roots (distinct mod p), where d is the order of q mod p, so any irreducible factor of $Phi_p(x)$ has degree d in $F_q$. Extending to $q^n$ doesn't seem to change this argument, so would the factors still have degree d? Not the order of $q^n$ mod p? I feel like I'm missing something here.
    $endgroup$
    – Joux
    Mar 31 at 20:00










  • $begingroup$
    In your notation, $Phi_p$ splits in $Bbb F_q^d$, so there certainly is some dependence on $n$. Have you worked out a specific example, say $q=2$ and $p=13$ (or $p=17$)?
    $endgroup$
    – Greg Martin
    Mar 31 at 21:49










  • $begingroup$
    You're right. I just went through a few examples in sage. It seems like $Phi_p$ either splits or all its factors have degree d (order of q mod p). From some experimentation it seems like $mathbbF_q^d$ might always be the splitting field, but I'm not sure how to go about proving that.
    $endgroup$
    – Joux
    Mar 31 at 23:33















0












$begingroup$


Given p, q distinct primes, what are possible degrees of factors of $Phi_p(x)$ in $mathbbF_q^n[x]$? In the case of n=1, every factor has degree the order of q in $mathbbZ/pmathbbZ$ so if q is primitive mod p then this should be irreducible. But what about the case when n > 1?










share|cite|improve this question









$endgroup$











  • $begingroup$
    Do you know the proof of the assertion in your second sentence? Does it work when $Bbb F_q$ is replaced by $Bbb F_q^n$? If not, where does the proof fail?
    $endgroup$
    – Greg Martin
    Mar 31 at 19:29










  • $begingroup$
    The proof I worked out (not 100% sure if it's right), is that if you have a root $a$ in the algebraic closure of $F_q$ then using the frobenius automorphism gives d distinct roots (distinct mod p), where d is the order of q mod p, so any irreducible factor of $Phi_p(x)$ has degree d in $F_q$. Extending to $q^n$ doesn't seem to change this argument, so would the factors still have degree d? Not the order of $q^n$ mod p? I feel like I'm missing something here.
    $endgroup$
    – Joux
    Mar 31 at 20:00










  • $begingroup$
    In your notation, $Phi_p$ splits in $Bbb F_q^d$, so there certainly is some dependence on $n$. Have you worked out a specific example, say $q=2$ and $p=13$ (or $p=17$)?
    $endgroup$
    – Greg Martin
    Mar 31 at 21:49










  • $begingroup$
    You're right. I just went through a few examples in sage. It seems like $Phi_p$ either splits or all its factors have degree d (order of q mod p). From some experimentation it seems like $mathbbF_q^d$ might always be the splitting field, but I'm not sure how to go about proving that.
    $endgroup$
    – Joux
    Mar 31 at 23:33













0












0








0





$begingroup$


Given p, q distinct primes, what are possible degrees of factors of $Phi_p(x)$ in $mathbbF_q^n[x]$? In the case of n=1, every factor has degree the order of q in $mathbbZ/pmathbbZ$ so if q is primitive mod p then this should be irreducible. But what about the case when n > 1?










share|cite|improve this question









$endgroup$




Given p, q distinct primes, what are possible degrees of factors of $Phi_p(x)$ in $mathbbF_q^n[x]$? In the case of n=1, every factor has degree the order of q in $mathbbZ/pmathbbZ$ so if q is primitive mod p then this should be irreducible. But what about the case when n > 1?







abstract-algebra number-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Mar 31 at 19:11









JouxJoux

11




11











  • $begingroup$
    Do you know the proof of the assertion in your second sentence? Does it work when $Bbb F_q$ is replaced by $Bbb F_q^n$? If not, where does the proof fail?
    $endgroup$
    – Greg Martin
    Mar 31 at 19:29










  • $begingroup$
    The proof I worked out (not 100% sure if it's right), is that if you have a root $a$ in the algebraic closure of $F_q$ then using the frobenius automorphism gives d distinct roots (distinct mod p), where d is the order of q mod p, so any irreducible factor of $Phi_p(x)$ has degree d in $F_q$. Extending to $q^n$ doesn't seem to change this argument, so would the factors still have degree d? Not the order of $q^n$ mod p? I feel like I'm missing something here.
    $endgroup$
    – Joux
    Mar 31 at 20:00










  • $begingroup$
    In your notation, $Phi_p$ splits in $Bbb F_q^d$, so there certainly is some dependence on $n$. Have you worked out a specific example, say $q=2$ and $p=13$ (or $p=17$)?
    $endgroup$
    – Greg Martin
    Mar 31 at 21:49










  • $begingroup$
    You're right. I just went through a few examples in sage. It seems like $Phi_p$ either splits or all its factors have degree d (order of q mod p). From some experimentation it seems like $mathbbF_q^d$ might always be the splitting field, but I'm not sure how to go about proving that.
    $endgroup$
    – Joux
    Mar 31 at 23:33
















  • $begingroup$
    Do you know the proof of the assertion in your second sentence? Does it work when $Bbb F_q$ is replaced by $Bbb F_q^n$? If not, where does the proof fail?
    $endgroup$
    – Greg Martin
    Mar 31 at 19:29










  • $begingroup$
    The proof I worked out (not 100% sure if it's right), is that if you have a root $a$ in the algebraic closure of $F_q$ then using the frobenius automorphism gives d distinct roots (distinct mod p), where d is the order of q mod p, so any irreducible factor of $Phi_p(x)$ has degree d in $F_q$. Extending to $q^n$ doesn't seem to change this argument, so would the factors still have degree d? Not the order of $q^n$ mod p? I feel like I'm missing something here.
    $endgroup$
    – Joux
    Mar 31 at 20:00










  • $begingroup$
    In your notation, $Phi_p$ splits in $Bbb F_q^d$, so there certainly is some dependence on $n$. Have you worked out a specific example, say $q=2$ and $p=13$ (or $p=17$)?
    $endgroup$
    – Greg Martin
    Mar 31 at 21:49










  • $begingroup$
    You're right. I just went through a few examples in sage. It seems like $Phi_p$ either splits or all its factors have degree d (order of q mod p). From some experimentation it seems like $mathbbF_q^d$ might always be the splitting field, but I'm not sure how to go about proving that.
    $endgroup$
    – Joux
    Mar 31 at 23:33















$begingroup$
Do you know the proof of the assertion in your second sentence? Does it work when $Bbb F_q$ is replaced by $Bbb F_q^n$? If not, where does the proof fail?
$endgroup$
– Greg Martin
Mar 31 at 19:29




$begingroup$
Do you know the proof of the assertion in your second sentence? Does it work when $Bbb F_q$ is replaced by $Bbb F_q^n$? If not, where does the proof fail?
$endgroup$
– Greg Martin
Mar 31 at 19:29












$begingroup$
The proof I worked out (not 100% sure if it's right), is that if you have a root $a$ in the algebraic closure of $F_q$ then using the frobenius automorphism gives d distinct roots (distinct mod p), where d is the order of q mod p, so any irreducible factor of $Phi_p(x)$ has degree d in $F_q$. Extending to $q^n$ doesn't seem to change this argument, so would the factors still have degree d? Not the order of $q^n$ mod p? I feel like I'm missing something here.
$endgroup$
– Joux
Mar 31 at 20:00




$begingroup$
The proof I worked out (not 100% sure if it's right), is that if you have a root $a$ in the algebraic closure of $F_q$ then using the frobenius automorphism gives d distinct roots (distinct mod p), where d is the order of q mod p, so any irreducible factor of $Phi_p(x)$ has degree d in $F_q$. Extending to $q^n$ doesn't seem to change this argument, so would the factors still have degree d? Not the order of $q^n$ mod p? I feel like I'm missing something here.
$endgroup$
– Joux
Mar 31 at 20:00












$begingroup$
In your notation, $Phi_p$ splits in $Bbb F_q^d$, so there certainly is some dependence on $n$. Have you worked out a specific example, say $q=2$ and $p=13$ (or $p=17$)?
$endgroup$
– Greg Martin
Mar 31 at 21:49




$begingroup$
In your notation, $Phi_p$ splits in $Bbb F_q^d$, so there certainly is some dependence on $n$. Have you worked out a specific example, say $q=2$ and $p=13$ (or $p=17$)?
$endgroup$
– Greg Martin
Mar 31 at 21:49












$begingroup$
You're right. I just went through a few examples in sage. It seems like $Phi_p$ either splits or all its factors have degree d (order of q mod p). From some experimentation it seems like $mathbbF_q^d$ might always be the splitting field, but I'm not sure how to go about proving that.
$endgroup$
– Joux
Mar 31 at 23:33




$begingroup$
You're right. I just went through a few examples in sage. It seems like $Phi_p$ either splits or all its factors have degree d (order of q mod p). From some experimentation it seems like $mathbbF_q^d$ might always be the splitting field, but I'm not sure how to go about proving that.
$endgroup$
– Joux
Mar 31 at 23:33










0






active

oldest

votes












Your Answer








StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3169785%2fdegrees-of-factors-of-pth-cyclotomic-polynomial-in-gfqn%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes















draft saved

draft discarded
















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3169785%2fdegrees-of-factors-of-pth-cyclotomic-polynomial-in-gfqn%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ