bio | website | HenryYuen.net |
---|---|---|
location | Cambridge, MA | |
age | ||
visits | member for | 4 years, 4 months |
seen | Aug 10 at 21:52 | |
stats | profile views | 296 |
Ph.D. student, studying Complexity theory and quantum computing.
Jul 2 |
awarded | Curious |
May 22 |
comment |
A measure of closure under sumset?
Thanks, quid, for your answer, and the links to Hamidoune's work. |
May 22 |
accepted | A measure of closure under sumset? |
May 22 |
revised |
A measure of closure under sumset?
added 138 characters in body |
May 21 |
asked | A measure of closure under sumset? |
Apr 22 |
awarded | Yearling |
Oct 9 |
accepted | Multivariate Hensel's Lemma, but with only one polynomial |
Oct 8 |
comment |
Multivariate Hensel's Lemma, but with only one polynomial
I have a quick clarification question: When you say "Suppose $Q(X_1,\ldots,X_n)$ is in $I^t$", you mean suppose there is are $\beta_1,\ldots,\beta_n\in R$ such that $Q(\beta_1,\ldots,\beta_n)\in I^t$? And then every time you write $\frac{dQ}{dX_1}$, you mean it is evaluated at the $\beta_1,\ldots,\beta_n$? If that's the case, then I interpret the mod $I^{t+1}$ solution as $\beta_1 + a_1,\ldots,\beta_n+a_n$. Thanks! |
Oct 3 |
revised |
Multivariate Hensel's Lemma, but with only one polynomial
edited title |
Oct 3 |
revised |
Multivariate Hensel's Lemma, but with only one polynomial
deleted 4 characters in body |
Oct 3 |
accepted | What is the relationship between singular value decomposition and solving linear systems? |
Oct 3 |
accepted | Inequalities and bounds for relating p-norms (Reference request) |
Oct 3 |
asked | Multivariate Hensel's Lemma, but with only one polynomial |
Jul 30 |
accepted | Can formal power series become polynomial often, when composed with polynomials? |
Jul 30 |
comment |
Can formal power series become polynomial often, when composed with polynomials?
Thanks David! This will take me a little while to parse, so i might add follow up questions in the comments. But for now I accept this! |
Jul 29 |
awarded | Nice Question |
Jul 29 |
revised |
Can formal power series become polynomial often, when composed with polynomials?
deleted 75 characters in body |
Jul 27 |
revised |
Can formal power series become polynomial often, when composed with polynomials?
clarification in problem statement. |
Jul 27 |
comment |
Can formal power series become polynomial often, when composed with polynomials?
Thanks for pointing this out Ryan. In this case, I have a specific $d$ in mind: if $g(c)$ has degree greater than $kd$, then I do not wish to consider such a $c$. The bound I'm seeking on $|C|$ may depend on $d$. I will edit the problem statement to make this clearer. |
Jul 27 |
asked | Can formal power series become polynomial often, when composed with polynomials? |