meta user
network profile
| bio | website | mpi-sws.org |
|---|---|---|
| location | Kaiserslautern, Germany | |
| age | 31 | |
| visits | member for | 1 year, 2 months |
| seen | 8 hours ago | |
| stats | profile views | 287 |
PhD student at MPI-SWS.
|
Mar 18 |
comment |
Computing the “lying over”, “going up”, “going down” ideals. Q2: yes. Q3: Why should $Q \subseteq P_0$ hold? Obviously, $P_0 \in \mathrm{MinAss}(PB)$, so this is only the case iff $P_0 = Q$. |
|
Mar 17 |
answered | given a real number, build an infinite series that will converge to it |
|
Mar 17 |
comment |
How many roots lie in the interval $(0,1)$? Are $p$, $q$ and $r$ fixed? If yes, you could just solve the equation and check... Otherwise, what is the precise question? |
|
Mar 17 |
comment |
Computing the “lying over”, “going up”, “going down” ideals. I just checked my Commutative Algebra lecture notes. In fact, for the general Lying-Over theorem, it is sufficient that we have an integral ring extension $A \to B$. |
|
Mar 17 |
revised |
Computing the “lying over”, “going up”, “going down” ideals. The ring extension I gave in the last example was not, in fact, finite. Changed it by subtituting the factor $z$ with $z-x$. |
|
Mar 16 |
comment |
Proving $(1 + 1/n)^{n+1} \gt e$ From a back-of-the-envelope calculation: your sequence is strictly monotonously falling (consider the difference between adjacent sequence elements), and its limits is $e$. Hence, each element of the sequence must be larger than $e$. |
|
Mar 16 |
comment |
How to formulate a theorem about bijections between several sets Why not call the sets $A_\alpha$ or $\alpha$? |
|
Mar 16 |
revised |
Computing the “lying over”, “going up”, “going down” ideals. Added concrete counter-example. |
|
Mar 16 |
answered | Computing the “lying over”, “going up”, “going down” ideals. |
|
Mar 16 |
revised |
Where am I going wrong when removing brackets from (s+1)(s+5)(s-3) Noted a small error, reference other answer. |
|
Mar 16 |
answered | Where am I going wrong when removing brackets from (s+1)(s+5)(s-3) |
|
Mar 16 |
comment |
See the sign of the double derivative from just looking at the graph? Another way to put this: If you run along the graph, it has positive second derivative if it turns left, and negative if it turns right. In this example, you will find that its second derivative switches signs exactly once. |
|
Mar 16 |
comment |
Jordan Normal form — Complex matrices Since the characteristic polynomial factors into linear factors, there should be no problems - after all, all eigenvalues are real. |
|
Mar 15 |
answered | Number of distinct limits of subsequences of a sequence is finite? |
|
Mar 15 |
comment |
Time complexity of algorithm computing averages PPS: You can just edit your post instead of writing an answer. |
|
Mar 15 |
comment |
Time complexity of algorithm computing averages PS: This looks very much like homework, so I would rather not give the answer directly, but help you in learning the methods instead. |
|
Mar 15 |
comment |
Time complexity of algorithm computing averages If it is $n/2$ in the average case, that means that $r \in \Omega(n)$ (i.e., the inner part of the for loops runs in $\Omega(n)$). Hence, the overall algorithm is in ...? |
|
Mar 15 |
comment |
the set of sentences (i.e. closed formulas) of first-order logic and the Chomsky hierarchy Oh, I'm sorry. Of course, adding a space bound like that will generate a new in-between class. They are somewhat related to the XYZ-SPACE classes in complexity, if that helps you. |
|
Mar 15 |
answered | the set of sentences (i.e. closed formulas) of first-order logic and the Chomsky hierarchy |
|
Mar 15 |
comment |
Calculate pairing in a rotational system Actually, pairwise coverage would mean that you want tuples A_i B_j C_k. |
