Reputation
888
Top tag
Next privilege 1,000 Rep.
Create new tags
Badges
1 13 25
Impact
~52k people reached

Dec
10
comment Antisymmetric and irreflexive relation which is not asymmetric
Isn't this example antisymmetric, not reflexive and not asymmetric? If not, why?
Dec
10
comment Antisymmetric and irreflexive relation which is not asymmetric
I just got a question right now. What aboout $M=\{1,2\}$ and $R=\{(1,1),(1,2)\}$?
Dec
10
asked Differentiability and extrema - counterexamples for a few statements
Dec
10
accepted Antisymmetric and irreflexive relation which is not asymmetric
Dec
10
comment Antisymmetric and irreflexive relation which is not asymmetric
Thank you for the second part - i was totally confused here.
Dec
10
asked Antisymmetric and irreflexive relation which is not asymmetric
Dec
9
accepted Algorithm to check whether a graph has no cycles
Dec
8
revised Linear Algebra - complex numbers
added latex commands
Dec
8
suggested approved edit on Linear Algebra - complex numbers
Dec
8
comment Algorithm to check whether a graph has no cycles
Considering correctness, what do you suggest for a better approch with the cycle $C$?
Dec
8
comment Algorithm to check whether a graph has no cycles
Please have a look at my updated question. Is this the kind of proof for correctness you recommended me?
Dec
8
revised Algorithm to check whether a graph has no cycles
added a second attempt to solve this problem
Dec
8
comment Algorithm to check whether a graph has no cycles
Furthermore to reduce redundancy as $\mu$ and $V'$ would hold visited nodes, an option would be to use $\mu$ for a topsort.
Dec
8
comment Algorithm to check whether a graph has no cycles
How about the following idea: Each time we visit a node we could set µ to 0 and add the visited node to a new set $V'$. At the end of the while loop we could check for emptiness of $V\setminus V'=\emptyset$. If this is true we can return false because there are no more components left; otherwise we pick an arbitrary $v'\in V\setminus V'$ and then repeat everything with $U=\{v'\}$. Do you think that would solve my problem with the components?
Dec
8
revised Algorithm to check whether a graph has no cycles
added note that we have to use DFS/BFS
Dec
8
asked Algorithm to check whether a graph has no cycles
Dec
5
accepted Derivatives and their domains
Dec
4
awarded  Enthusiast
Dec
3
answered Derivatives and their domains
Dec
3
comment Derivatives and their domains
@Siminore: Do you have some other clues about the domains of (3)-(5)?