meta user
network profile
| bio | website | |
|---|---|---|
| location | Munich | |
| age | ||
| visits | member for | 1 year, 10 months |
| seen | 48 mins ago | |
| stats | profile views | 151 |
|
Oct 22 |
comment |
Is it possible to make a graph eulerian by adding exactly one node? This lemma and Michaels answer helped me out! |
|
Oct 22 |
comment |
Is it possible to make a graph eulerian by adding exactly one node? The handshaking lemma and your edit gave me a good clue to solve this. Thanks! |
|
Oct 22 |
comment |
Is it possible to make a graph eulerian by adding exactly one node? I am sorry, then I have translated it wrong. I have to work with a cycle - editing it now! |
|
Oct 22 |
comment |
Is it possible to make a graph eulerian by adding exactly one node? I know that a connected graph has an Eulerian path iff all vertices have even degree. I even proved that yesterday, isn't that contradicting with your mentioned property? |
|
Oct 22 |
comment |
Find the remainder of $128^{1000}/153$. @Rain: One can add LaTeX code between dollar signs. If you know how to write LaTeX code you will profit here ;) |
|
Oct 20 |
comment |
Relation of (un)bounded (in)finite sets and $\min$/$\max$ (1) As mentioned in fgp's answer I will reuse your idea. Quite easy, when being reminded of this fact with $1/n$. (2) I like $A=\{1\}$ more, but yeah quite complex what I did there. (3) I'm sorry, but I didn't really get everything you wanted to explain. fgp's description was more intuitive on the first look. (4) Ok :) |
|
Oct 20 |
comment |
Relation of (un)bounded (in)finite sets and $\min$/$\max$ (1) I do not want to use injective maps as proof though I like your idea. However I will use Brians general approach with $\forall x\in\mathbb R,x>0:\exists n\in\mathbb N:0<1/n<x$. (2) My approach is waaaaay to complex :D (3) Good idea going through all elements and comparing them with a finite number of operations. I will reuse this one. (4) Thanks, however my idea was really easy and nothing special. |
|
Oct 19 |
comment |
Prove equivalence of conditions for a tree Ok I will keep that in mind. Thanks for now. |
|
Oct 19 |
comment |
Prove equivalence of conditions for a tree I did work out extensions for both arguments based on your hints. Does the current version suffice now? |
|
Oct 19 |
comment |
Graph Theory, complements of isomorphic graphs are isomorphic What have you tried? |
|
Sep 4 |
comment |
3rd roots of unity as eigenvectors Thanks for your efforts - just because of this I will accept your answer as it is now complete with both descriptions! |
|
Sep 4 |
comment |
3rd roots of unity as eigenvectors I tried it now a few times and fail though I do use your suggested relations. My current matrix looks like $((1,0,0)^T,(1+\zeta^2,1,0)^T,(0,1+\zeta^2,-2\zeta-\zeta^2)^T)$. I assume that the rank should be 2 and therefore at least my last line is wrong :/ |
|
Sep 4 |
comment |
3rd roots of unity as eigenvectors I got used to write $z$ and $\lambda$ for the variable of my characteristic polynomials so I just didn't change anything to be at least consistent with my notation, thanks for the hint though :) |
|
Sep 4 |
comment |
3rd roots of unity as eigenvectors I am trying to solve it with the general approach as we both mentioned but I get horrible results - is there any way I could persuade you to show me how to use the kernel approach in this particular case? |
|
Aug 23 |
comment |
Dimensions of symmetric and skew-symmetric matrices @RijulSaini: Thanks, but enzotib's answer seems to be easier to understand! |
|
Aug 23 |
comment |
Dimensions of symmetric and skew-symmetric matrices But this is no explanation why the symmetric matrices have the specified $\dim$. |
|
Aug 23 |
comment |
Dimensions of symmetric and skew-symmetric matrices I did edit it - thanks for the reminder! |
|
Jul 7 |
comment |
Maximum-likelihood estimation for continuous random variable with unknown parameter Now it looks comprehensible. Thanks for reviewing this. |
|
Jul 7 |
comment |
Maximum-likelihood estimation for continuous random variable with unknown parameter Sorry, but in the first equation I still cannot see why the $x_j$ from $(2\lambda x_j)$ disappeared (assuming your $\chi$ is my $\textbf 1_A(x)$). I still get a $\left(\prod\limits_{j=1}^nx_j\right)$ term left to be multiplied with the rest. |
|
Jul 7 |
comment |
Maximum-likelihood estimation for continuous random variable with unknown parameter Did i miss something? I thought that $\|x\|=\sqrt{\sum\limits_{j=1}^nx_j^2}$. |
