bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 4 years |
seen | Feb 7 at 4:17 | |
stats | profile views | 3,032 |
Apr 6 |
awarded | Yearling |
Mar 27 |
awarded | Popular Question |
Feb 7 |
comment |
A question about how polynomials simplify under substitution
The sequence of revisions in this post is confusing, and may have misled you, for which I am sorry. Note that in the example you give, the group $M_0$ contains the nonconstant polynomial $x_1-x_0$. |
Jan 20 |
awarded | Popular Question |
Jan 11 |
revised |
Distribution of polynomials mod 1 using co-prime integers
added 9 characters in body |
Jan 7 |
revised |
Floors of powers of reals, how much do the first few determine the next?
deleted 3 characters in body |
Jan 6 |
revised |
Floors of powers of reals, how much do the first few determine the next?
edited body |
Jan 6 |
revised |
Floors of powers of reals, how much do the first few determine the next?
edited body |
Jan 6 |
answered | Floors of powers of reals, how much do the first few determine the next? |
Dec 24 |
comment |
Generating primes via composition of polynomials
Joe, Thank you for explaining the lay of the land. |
Dec 24 |
comment |
Reducibility of polynomials maps
Yes. In fact $x^2+1$ does the job. |
Dec 24 |
comment |
Reducibility of polynomials maps
Do we actually know a non-linear polynomial $f(x)$ such that $f^n(x)$ is irreducible for all $n$? |
Dec 24 |
awarded | Organizer |
Dec 24 |
comment |
Reducibility of polynomials maps
Joro, I added a logic tag. |
Dec 24 |
revised |
Reducibility of polynomials maps
edited tags |
Dec 24 |
awarded | Nice Question |
Dec 24 |
comment |
Generating primes via composition of polynomials
@Terry Tao: Thanks for pointing out this connection. I wonder if there are any footholds in the study of orbits of polynomials mod $p$ as $p$ varies? |
Dec 23 |
asked | Generating primes via composition of polynomials |
Dec 12 |
revised |
How Symmetric is Diophantine Approximation using Fractions with Square Denominators?
deleted 365 characters in body |
Nov 30 |
comment |
Distribution of polynomials mod 1 using co-prime integers
Thank you. This looks like "the" way to do it. In terms of Farey fractions your idea is to trap $\alpha$ between succesive fractions $a/b$ and $c/d$ with large denominator. Coprimality is preserved by taking mediants $(a+kc)/(b+kd)$ but the values of $\alpha (b+kd)−(a+kc)$ will form an arithmetic progression with small common difference. Pity that this doesn't generalize (as far as I can see) to polynomials of degree greater than 1. |