ireducible polynomials with coefficients in ${0,-1}$












4












$begingroup$


I'm interested in the polynomials of the form $x^n -x^{n-1} - b_{n-2}x^{n-2} - cdots -b_1 x -1$ with the coefficients $b_k$ being either zero or one. The prototype is of course the Golden mean $x^2-x-1$. Is there a known name for such polynomials? I would search for info on them, but can't figure out how to form a reasonable search query.



To tighten things up: I'm interested in the ones that are irreducible with respect to one-another (are prime relative to one-another). As far as I can tell, there are the same number of these as there are irreducible polynomials over $mathbb{F}_2$ -- OEIS A001037 (should that be obvious?). As far as I can tell, they always have just one real root greater than one. I'm interested in the complex roots, too. Some of these show up in papers on "generalized golden means", typically the all-ones case $x^n -x^{n-1} - cdots -x -1=0$ or the all-zeros case $x^n -x^{n-1}-1=0$, but its not much enlightening. Another factoid: it seems the real roots are dense in [1,2], considering all such polynomials, taking $ntoinfty$. Is there a generating function? I'm guessing that texts in dynamical systems, chaos theory, fractals, subshifts, maybe number theory might discuss these; but under what name?



EDIT: The context for these polynomials is the iterated Beta Transform. I've written a 105-page tract providing a treatment of the Beta Transform, illustrating the usefulness and central natural of these polynomials. It can be found here: https://linas.org/math/solvit.pdf I still don't "understand them", and find this to be annoying.






dynamical-systems irreducible-polynomials fractals chaos-theory golden-ratio







share|cite|improve this question











$endgroup$












  • $begingroup$
    In my playing around with polynomials like this with all the $b_n=0$, the roots are all close to the $n^{th}$ roots of unity. The roots are roughly in a circle in the complex plane since $x^{n-1}(x-1)=1$. IIRC, Even with $b_nne0$, the two highest order terms dominate as $n$ becomes large, so the roots are still roughly arranged in a circle in that case
    $endgroup$
    – Andy Walls
    Feb 10 '18 at 12:02












  • $begingroup$
    Glasser has an approach for finding the roots of the trinomial $x^n-x+t=0$, which you might be able to adapt to the trinomial $x^n-x^{n-1}-1=0$ but you might run into convergence problems with the hypergeometric functions. sciencedirect.com/science/article/pii/S0377042700002879
    $endgroup$
    – Andy Walls
    Feb 10 '18 at 12:37










  • $begingroup$
    Ah, yes, thank you. I was seeing roots arranged in circles at various radii; (specifically, at a radius of 1 over the real root, in a related one-off problem in which these arise.) I see Glasser invokes the multiplication theorem, which is an old favorite of mine... and might provide the doorway I need.
    $endgroup$
    – Linas
    Feb 11 '18 at 8:28
















4












$begingroup$


I'm interested in the polynomials of the form $x^n -x^{n-1} - b_{n-2}x^{n-2} - cdots -b_1 x -1$ with the coefficients $b_k$ being either zero or one. The prototype is of course the Golden mean $x^2-x-1$. Is there a known name for such polynomials? I would search for info on them, but can't figure out how to form a reasonable search query.



To tighten things up: I'm interested in the ones that are irreducible with respect to one-another (are prime relative to one-another). As far as I can tell, there are the same number of these as there are irreducible polynomials over $mathbb{F}_2$ -- OEIS A001037 (should that be obvious?). As far as I can tell, they always have just one real root greater than one. I'm interested in the complex roots, too. Some of these show up in papers on "generalized golden means", typically the all-ones case $x^n -x^{n-1} - cdots -x -1=0$ or the all-zeros case $x^n -x^{n-1}-1=0$, but its not much enlightening. Another factoid: it seems the real roots are dense in [1,2], considering all such polynomials, taking $ntoinfty$. Is there a generating function? I'm guessing that texts in dynamical systems, chaos theory, fractals, subshifts, maybe number theory might discuss these; but under what name?



EDIT: The context for these polynomials is the iterated Beta Transform. I've written a 105-page tract providing a treatment of the Beta Transform, illustrating the usefulness and central natural of these polynomials. It can be found here: https://linas.org/math/solvit.pdf I still don't "understand them", and find this to be annoying.






dynamical-systems irreducible-polynomials fractals chaos-theory golden-ratio







share|cite|improve this question











$endgroup$












  • $begingroup$
    In my playing around with polynomials like this with all the $b_n=0$, the roots are all close to the $n^{th}$ roots of unity. The roots are roughly in a circle in the complex plane since $x^{n-1}(x-1)=1$. IIRC, Even with $b_nne0$, the two highest order terms dominate as $n$ becomes large, so the roots are still roughly arranged in a circle in that case
    $endgroup$
    – Andy Walls
    Feb 10 '18 at 12:02












  • $begingroup$
    Glasser has an approach for finding the roots of the trinomial $x^n-x+t=0$, which you might be able to adapt to the trinomial $x^n-x^{n-1}-1=0$ but you might run into convergence problems with the hypergeometric functions. sciencedirect.com/science/article/pii/S0377042700002879
    $endgroup$
    – Andy Walls
    Feb 10 '18 at 12:37










  • $begingroup$
    Ah, yes, thank you. I was seeing roots arranged in circles at various radii; (specifically, at a radius of 1 over the real root, in a related one-off problem in which these arise.) I see Glasser invokes the multiplication theorem, which is an old favorite of mine... and might provide the doorway I need.
    $endgroup$
    – Linas
    Feb 11 '18 at 8:28














4












4








4





$begingroup$


I'm interested in the polynomials of the form $x^n -x^{n-1} - b_{n-2}x^{n-2} - cdots -b_1 x -1$ with the coefficients $b_k$ being either zero or one. The prototype is of course the Golden mean $x^2-x-1$. Is there a known name for such polynomials? I would search for info on them, but can't figure out how to form a reasonable search query.



To tighten things up: I'm interested in the ones that are irreducible with respect to one-another (are prime relative to one-another). As far as I can tell, there are the same number of these as there are irreducible polynomials over $mathbb{F}_2$ -- OEIS A001037 (should that be obvious?). As far as I can tell, they always have just one real root greater than one. I'm interested in the complex roots, too. Some of these show up in papers on "generalized golden means", typically the all-ones case $x^n -x^{n-1} - cdots -x -1=0$ or the all-zeros case $x^n -x^{n-1}-1=0$, but its not much enlightening. Another factoid: it seems the real roots are dense in [1,2], considering all such polynomials, taking $ntoinfty$. Is there a generating function? I'm guessing that texts in dynamical systems, chaos theory, fractals, subshifts, maybe number theory might discuss these; but under what name?



EDIT: The context for these polynomials is the iterated Beta Transform. I've written a 105-page tract providing a treatment of the Beta Transform, illustrating the usefulness and central natural of these polynomials. It can be found here: https://linas.org/math/solvit.pdf I still don't "understand them", and find this to be annoying.






dynamical-systems irreducible-polynomials fractals chaos-theory golden-ratio







share|cite|improve this question











$endgroup$




I'm interested in the polynomials of the form $x^n -x^{n-1} - b_{n-2}x^{n-2} - cdots -b_1 x -1$ with the coefficients $b_k$ being either zero or one. The prototype is of course the Golden mean $x^2-x-1$. Is there a known name for such polynomials? I would search for info on them, but can't figure out how to form a reasonable search query.



To tighten things up: I'm interested in the ones that are irreducible with respect to one-another (are prime relative to one-another). As far as I can tell, there are the same number of these as there are irreducible polynomials over $mathbb{F}_2$ -- OEIS A001037 (should that be obvious?). As far as I can tell, they always have just one real root greater than one. I'm interested in the complex roots, too. Some of these show up in papers on "generalized golden means", typically the all-ones case $x^n -x^{n-1} - cdots -x -1=0$ or the all-zeros case $x^n -x^{n-1}-1=0$, but its not much enlightening. Another factoid: it seems the real roots are dense in [1,2], considering all such polynomials, taking $ntoinfty$. Is there a generating function? I'm guessing that texts in dynamical systems, chaos theory, fractals, subshifts, maybe number theory might discuss these; but under what name?



EDIT: The context for these polynomials is the iterated Beta Transform. I've written a 105-page tract providing a treatment of the Beta Transform, illustrating the usefulness and central natural of these polynomials. It can be found here: https://linas.org/math/solvit.pdf I still don't "understand them", and find this to be annoying.






dynamical-systems irreducible-polynomials fractals chaos-theory golden-ratio




dynamical-systems irreducible-polynomials fractals chaos-theory golden-ratio






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 26 '18 at 9:41







Linas

















asked Feb 10 '18 at 6:08









LinasLinas

417210




417210












  • $begingroup$
    In my playing around with polynomials like this with all the $b_n=0$, the roots are all close to the $n^{th}$ roots of unity. The roots are roughly in a circle in the complex plane since $x^{n-1}(x-1)=1$. IIRC, Even with $b_nne0$, the two highest order terms dominate as $n$ becomes large, so the roots are still roughly arranged in a circle in that case
    $endgroup$
    – Andy Walls
    Feb 10 '18 at 12:02












  • $begingroup$
    Glasser has an approach for finding the roots of the trinomial $x^n-x+t=0$, which you might be able to adapt to the trinomial $x^n-x^{n-1}-1=0$ but you might run into convergence problems with the hypergeometric functions. sciencedirect.com/science/article/pii/S0377042700002879
    $endgroup$
    – Andy Walls
    Feb 10 '18 at 12:37










  • $begingroup$
    Ah, yes, thank you. I was seeing roots arranged in circles at various radii; (specifically, at a radius of 1 over the real root, in a related one-off problem in which these arise.) I see Glasser invokes the multiplication theorem, which is an old favorite of mine... and might provide the doorway I need.
    $endgroup$
    – Linas
    Feb 11 '18 at 8:28


















  • $begingroup$
    In my playing around with polynomials like this with all the $b_n=0$, the roots are all close to the $n^{th}$ roots of unity. The roots are roughly in a circle in the complex plane since $x^{n-1}(x-1)=1$. IIRC, Even with $b_nne0$, the two highest order terms dominate as $n$ becomes large, so the roots are still roughly arranged in a circle in that case
    $endgroup$
    – Andy Walls
    Feb 10 '18 at 12:02












  • $begingroup$
    Glasser has an approach for finding the roots of the trinomial $x^n-x+t=0$, which you might be able to adapt to the trinomial $x^n-x^{n-1}-1=0$ but you might run into convergence problems with the hypergeometric functions. sciencedirect.com/science/article/pii/S0377042700002879
    $endgroup$
    – Andy Walls
    Feb 10 '18 at 12:37










  • $begingroup$
    Ah, yes, thank you. I was seeing roots arranged in circles at various radii; (specifically, at a radius of 1 over the real root, in a related one-off problem in which these arise.) I see Glasser invokes the multiplication theorem, which is an old favorite of mine... and might provide the doorway I need.
    $endgroup$
    – Linas
    Feb 11 '18 at 8:28
















$begingroup$
In my playing around with polynomials like this with all the $b_n=0$, the roots are all close to the $n^{th}$ roots of unity. The roots are roughly in a circle in the complex plane since $x^{n-1}(x-1)=1$. IIRC, Even with $b_nne0$, the two highest order terms dominate as $n$ becomes large, so the roots are still roughly arranged in a circle in that case
$endgroup$
– Andy Walls
Feb 10 '18 at 12:02






$begingroup$
In my playing around with polynomials like this with all the $b_n=0$, the roots are all close to the $n^{th}$ roots of unity. The roots are roughly in a circle in the complex plane since $x^{n-1}(x-1)=1$. IIRC, Even with $b_nne0$, the two highest order terms dominate as $n$ becomes large, so the roots are still roughly arranged in a circle in that case
$endgroup$
– Andy Walls
Feb 10 '18 at 12:02














$begingroup$
Glasser has an approach for finding the roots of the trinomial $x^n-x+t=0$, which you might be able to adapt to the trinomial $x^n-x^{n-1}-1=0$ but you might run into convergence problems with the hypergeometric functions. sciencedirect.com/science/article/pii/S0377042700002879
$endgroup$
– Andy Walls
Feb 10 '18 at 12:37




$begingroup$
Glasser has an approach for finding the roots of the trinomial $x^n-x+t=0$, which you might be able to adapt to the trinomial $x^n-x^{n-1}-1=0$ but you might run into convergence problems with the hypergeometric functions. sciencedirect.com/science/article/pii/S0377042700002879
$endgroup$
– Andy Walls
Feb 10 '18 at 12:37












$begingroup$
Ah, yes, thank you. I was seeing roots arranged in circles at various radii; (specifically, at a radius of 1 over the real root, in a related one-off problem in which these arise.) I see Glasser invokes the multiplication theorem, which is an old favorite of mine... and might provide the doorway I need.
$endgroup$
– Linas
Feb 11 '18 at 8:28




$begingroup$
Ah, yes, thank you. I was seeing roots arranged in circles at various radii; (specifically, at a radius of 1 over the real root, in a related one-off problem in which these arise.) I see Glasser invokes the multiplication theorem, which is an old favorite of mine... and might provide the doorway I need.
$endgroup$
– Linas
Feb 11 '18 at 8:28










1 Answer
1






active

oldest

votes


















0












$begingroup$

Not an answer, but here's a MatLab/Octave script to visualize how the roots of
$$x^n-x^{n-1}-1 = 0$$
compare to the roots of unity
$$x^n-1 = 0$$



N = 10;

% x^n - 1 = 0

eta_poly = [1, zeros(1,N-1), -1];

% x^n - x^(n-1) - 1 = 0

r_poly   = [1, -1, zeros(1,N-2), -1];

eta = roots(eta_poly);

r = roots(r_poly);



% Plot the nth roots of unity and the other polynomial's roots

plot(real(eta),imag(eta),'.',real(r),imag(r),'+');

grid on;



% Sort the roots of unity by their arg() in [0, 2*pi)

ae = arg(eta)+2*pi*(arg(eta)<0);

[s,si] = sort(ae);

eta = eta(si);



% Match the closest roots of unity to the roots in r

% and permute r so that it lines up with the corresponding roots of unity

M = length(eta);

c = eta*ones(1,M)-ones(M,1)*r.';

[w,iw] = min(abs(real(c))+abs(imag(c)));

r = (abs(c) <= max(w))*r;



% What's the difference between the roots of unity and the roots of the

% other polynomial?

d = r-eta

r_d = abs(d)

phi_d = arg(d)





share|cite|improve this answer









$endgroup$













  • $begingroup$
    The case of $x^n-sum_{k=0}^{n-1} x^k=0$ is interesting: the zeros approach the unit circle surprisingly slowly as $ntoinfty$.
    $endgroup$
    – Linas
    Feb 12 '18 at 20:01










  • $begingroup$
    Also: for small n, the polynomials, roots are the "silver number", pisot number, tribonacci, tetranacci, etc. and have OEIS A092526 A058265 A109134 A086088 A060006 A293506 A103814 to describe them.
    $endgroup$
    – Linas
    Feb 12 '18 at 20:04











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

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%2f2644210%2fireducible-polynomials-with-coefficients-in-0-1%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









0












$begingroup$

Not an answer, but here's a MatLab/Octave script to visualize how the roots of
$$x^n-x^{n-1}-1 = 0$$
compare to the roots of unity
$$x^n-1 = 0$$



N = 10;

% x^n - 1 = 0

eta_poly = [1, zeros(1,N-1), -1];

% x^n - x^(n-1) - 1 = 0

r_poly   = [1, -1, zeros(1,N-2), -1];

eta = roots(eta_poly);

r = roots(r_poly);



% Plot the nth roots of unity and the other polynomial's roots

plot(real(eta),imag(eta),'.',real(r),imag(r),'+');

grid on;



% Sort the roots of unity by their arg() in [0, 2*pi)

ae = arg(eta)+2*pi*(arg(eta)<0);

[s,si] = sort(ae);

eta = eta(si);



% Match the closest roots of unity to the roots in r

% and permute r so that it lines up with the corresponding roots of unity

M = length(eta);

c = eta*ones(1,M)-ones(M,1)*r.';

[w,iw] = min(abs(real(c))+abs(imag(c)));

r = (abs(c) <= max(w))*r;



% What's the difference between the roots of unity and the roots of the

% other polynomial?

d = r-eta

r_d = abs(d)

phi_d = arg(d)





share|cite|improve this answer









$endgroup$













  • $begingroup$
    The case of $x^n-sum_{k=0}^{n-1} x^k=0$ is interesting: the zeros approach the unit circle surprisingly slowly as $ntoinfty$.
    $endgroup$
    – Linas
    Feb 12 '18 at 20:01










  • $begingroup$
    Also: for small n, the polynomials, roots are the "silver number", pisot number, tribonacci, tetranacci, etc. and have OEIS A092526 A058265 A109134 A086088 A060006 A293506 A103814 to describe them.
    $endgroup$
    – Linas
    Feb 12 '18 at 20:04
















0












$begingroup$

Not an answer, but here's a MatLab/Octave script to visualize how the roots of
$$x^n-x^{n-1}-1 = 0$$
compare to the roots of unity
$$x^n-1 = 0$$



N = 10;

% x^n - 1 = 0

eta_poly = [1, zeros(1,N-1), -1];

% x^n - x^(n-1) - 1 = 0

r_poly   = [1, -1, zeros(1,N-2), -1];

eta = roots(eta_poly);

r = roots(r_poly);



% Plot the nth roots of unity and the other polynomial's roots

plot(real(eta),imag(eta),'.',real(r),imag(r),'+');

grid on;



% Sort the roots of unity by their arg() in [0, 2*pi)

ae = arg(eta)+2*pi*(arg(eta)<0);

[s,si] = sort(ae);

eta = eta(si);



% Match the closest roots of unity to the roots in r

% and permute r so that it lines up with the corresponding roots of unity

M = length(eta);

c = eta*ones(1,M)-ones(M,1)*r.';

[w,iw] = min(abs(real(c))+abs(imag(c)));

r = (abs(c) <= max(w))*r;



% What's the difference between the roots of unity and the roots of the

% other polynomial?

d = r-eta

r_d = abs(d)

phi_d = arg(d)





share|cite|improve this answer









$endgroup$













  • $begingroup$
    The case of $x^n-sum_{k=0}^{n-1} x^k=0$ is interesting: the zeros approach the unit circle surprisingly slowly as $ntoinfty$.
    $endgroup$
    – Linas
    Feb 12 '18 at 20:01










  • $begingroup$
    Also: for small n, the polynomials, roots are the "silver number", pisot number, tribonacci, tetranacci, etc. and have OEIS A092526 A058265 A109134 A086088 A060006 A293506 A103814 to describe them.
    $endgroup$
    – Linas
    Feb 12 '18 at 20:04














0












0








0





$begingroup$

Not an answer, but here's a MatLab/Octave script to visualize how the roots of
$$x^n-x^{n-1}-1 = 0$$
compare to the roots of unity
$$x^n-1 = 0$$



N = 10;

% x^n - 1 = 0

eta_poly = [1, zeros(1,N-1), -1];

% x^n - x^(n-1) - 1 = 0

r_poly   = [1, -1, zeros(1,N-2), -1];

eta = roots(eta_poly);

r = roots(r_poly);



% Plot the nth roots of unity and the other polynomial's roots

plot(real(eta),imag(eta),'.',real(r),imag(r),'+');

grid on;



% Sort the roots of unity by their arg() in [0, 2*pi)

ae = arg(eta)+2*pi*(arg(eta)<0);

[s,si] = sort(ae);

eta = eta(si);



% Match the closest roots of unity to the roots in r

% and permute r so that it lines up with the corresponding roots of unity

M = length(eta);

c = eta*ones(1,M)-ones(M,1)*r.';

[w,iw] = min(abs(real(c))+abs(imag(c)));

r = (abs(c) <= max(w))*r;



% What's the difference between the roots of unity and the roots of the

% other polynomial?

d = r-eta

r_d = abs(d)

phi_d = arg(d)





share|cite|improve this answer









$endgroup$



Not an answer, but here's a MatLab/Octave script to visualize how the roots of
$$x^n-x^{n-1}-1 = 0$$
compare to the roots of unity
$$x^n-1 = 0$$



N = 10;

% x^n - 1 = 0

eta_poly = [1, zeros(1,N-1), -1];

% x^n - x^(n-1) - 1 = 0

r_poly   = [1, -1, zeros(1,N-2), -1];

eta = roots(eta_poly);

r = roots(r_poly);



% Plot the nth roots of unity and the other polynomial's roots

plot(real(eta),imag(eta),'.',real(r),imag(r),'+');

grid on;



% Sort the roots of unity by their arg() in [0, 2*pi)

ae = arg(eta)+2*pi*(arg(eta)<0);

[s,si] = sort(ae);

eta = eta(si);



% Match the closest roots of unity to the roots in r

% and permute r so that it lines up with the corresponding roots of unity

M = length(eta);

c = eta*ones(1,M)-ones(M,1)*r.';

[w,iw] = min(abs(real(c))+abs(imag(c)));

r = (abs(c) <= max(w))*r;



% What's the difference between the roots of unity and the roots of the

% other polynomial?

d = r-eta

r_d = abs(d)

phi_d = arg(d)






share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Feb 12 '18 at 1:04









Andy WallsAndy Walls

1,754139




1,754139












  • $begingroup$
    The case of $x^n-sum_{k=0}^{n-1} x^k=0$ is interesting: the zeros approach the unit circle surprisingly slowly as $ntoinfty$.
    $endgroup$
    – Linas
    Feb 12 '18 at 20:01










  • $begingroup$
    Also: for small n, the polynomials, roots are the "silver number", pisot number, tribonacci, tetranacci, etc. and have OEIS A092526 A058265 A109134 A086088 A060006 A293506 A103814 to describe them.
    $endgroup$
    – Linas
    Feb 12 '18 at 20:04


















  • $begingroup$
    The case of $x^n-sum_{k=0}^{n-1} x^k=0$ is interesting: the zeros approach the unit circle surprisingly slowly as $ntoinfty$.
    $endgroup$
    – Linas
    Feb 12 '18 at 20:01










  • $begingroup$
    Also: for small n, the polynomials, roots are the "silver number", pisot number, tribonacci, tetranacci, etc. and have OEIS A092526 A058265 A109134 A086088 A060006 A293506 A103814 to describe them.
    $endgroup$
    – Linas
    Feb 12 '18 at 20:04
















$begingroup$
The case of $x^n-sum_{k=0}^{n-1} x^k=0$ is interesting: the zeros approach the unit circle surprisingly slowly as $ntoinfty$.
$endgroup$
– Linas
Feb 12 '18 at 20:01




$begingroup$
The case of $x^n-sum_{k=0}^{n-1} x^k=0$ is interesting: the zeros approach the unit circle surprisingly slowly as $ntoinfty$.
$endgroup$
– Linas
Feb 12 '18 at 20:01












$begingroup$
Also: for small n, the polynomials, roots are the "silver number", pisot number, tribonacci, tetranacci, etc. and have OEIS A092526 A058265 A109134 A086088 A060006 A293506 A103814 to describe them.
$endgroup$
– Linas
Feb 12 '18 at 20:04




$begingroup$
Also: for small n, the polynomials, roots are the "silver number", pisot number, tribonacci, tetranacci, etc. and have OEIS A092526 A058265 A109134 A086088 A060006 A293506 A103814 to describe them.
$endgroup$
– Linas
Feb 12 '18 at 20:04


















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%2f2644210%2fireducible-polynomials-with-coefficients-in-0-1%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

Probability when a professor distributes a quiz and homework assignment to a class of n students.

Image
0 0 $begingroup$ Need help with this problem. Suppose our lazy professor collects a quiz and a homework assignment from a class of n students one day, then distributes both the quizzes and the homework assignments back to the class in a random fashion for grading. Each student receives one quiz and one homework assignment to grade. (a) What is the probability that every student receives someone else's quiz to grade, and someone else's homework to grade? (b) What is the probability that no student receives both their own quiz and their own homework assignment to grade? In this case, some students may receive their own quiz, and others may receive their own homework assignment. (c) Compute the limiting probability as n approaches infinity in each case. ...
Read more

Aardman Animations

Image
Aardman Animations, Ltd. Aardman Animations Tipo privada Atividade Animação em stop-motion , Animação em CGI Fundação 1972 Fundador(es) Peter Lord David Sproxton Sede Bristol, Inglaterra  Reino Unido Proprietário(s) Dreamworks Pessoas-chave Peter Lord David Sproxton Nick Park Divisões Aardman Features Aardman Digital Aardman Commercials Aardman Broadcast Aardman International Aardman Rights Aardman Effects Aardman 3-D Systems Aardman Nathan Love AardBoiled Website oficial aardman.com ...
Read more

Are they similar matrix

Image
0 $begingroup$ Do $begin{bmatrix} 0&i&0\0&0&1\0&0&0 end{bmatrix} $ and $begin{bmatrix} 0&0&0\-i&0&0\0&1&0 end{bmatrix} $ are similar.Is this True/false Clearly both are nilpotent and one is conjucate transpose of other but how to know if they are similar.i'm stuck. Please help me linear-algebra vector-spaces eigenvalues-eigenvectors generalizedeigenvector share | cite | improve this question edited Dec 10 '18 at 6:38 Vasanth Kris asked Dec 10 '18 at 6:19 ...
Read more