Відео

Good video.

Very interesting tutorial ❤

I have noticed this connection when I was undergraduated. I used Modified Nodal Analysis to solve linear circuits.

fax my brother! spit your shit indeed!

more videos like this

Simply Brillant!

nice, I missed class when we learned this, so this was really a lifesaver!

Cool... that explains the name of your channel... i haven't read Flatland in a very long time but when i read it i felt underwhelmed by the lack of mathematics. The book seemed more like a satire to me with a brief explanation at the end on how 4D could be visualized by 3D creatures (maybe i should re read it)... On the other hand, I found the futurama episode where the professor gets trapped in 2D pretty funny (it didn't have too much math but it had a couple of math jokes)

well explained! looking forward to your next videos

I wish it didn't use "i" as the index variable for the summation, since it sets off alarm bells for the imaginary i (and especially since this particular Taylor series is already adjacent to Euler's formula...).

Very interesting! I had just watched another Taylor Series video (some3) and I had all the questions you are literally addressing here!

Fancy

Brilliant thank you

I'm a bit confused how null space determines cycles. I would think that adding extraneous edges to a Directed Acyclic graph would cause null spaces, wouldn't it? I think it should be possible to add these while introducing no new cycles. Is there a flaw with my reasoning?

Sorry but I had to immediately stop the video on hearing “Algebra” pronounced with a hard g. What’s up with that?

A gem 💎 ! Great revision

I study in the school

Interesting video, thank you! One thought that occurred to me while watching was that you could've saved approx. 10 minutes by linking to 3blue1brown's "essence of linear algebra" -playlist (from 9:40 to 19:45).

A clear exposition. More Linear Algebra and Graph Theory, please. Everything is a graph, but there is a higher level graph in which the graphs here are just nodes there, with the higher level edges connecting and disconnecting dynamically from the nodes of our level, based on bias, since direct connection would collapse things into the lower level graph. The bias is provided by feedback from the lower level. Which explains a Lot.

...#Kirchoffsvoltagelaw deduced from #Graphtheory, using #matrices and #vectors?!...🤣🤣🤣..I feel #maths is just a way of still showing the universal laws of nature say: " Regardless of how complex and even non-conecting they might seem, by the time you #manipulate it, within these #realms of #axioms still sorta adds us to the same thing...Now if I make that "#Transformation" to even real life( #applied concepts), everything in life, #good or #bad, is still within a universal plan of #balance..koko is to find it🤷🏻‍♂️...these symmetries furthers shows that life no hard, #everything is still everything!.. Allahuarkbarh!..👑🙏🏾🙌🏾#sho🔥..#Nullspace

Brilliant! We want more!

Interesting thank you

Hello , what do you plan to be your channel about ? Math , Engineering or CS?

I really liked this! I can't believe I just found your channel - as a video creator myself, I understand how much time this must have taken. Liked and subscribed 💛

22:38 I think the example graph actually has 4 cycles: cefbg, cefa, cdbg, cda. Have I missed something? Is there some independence condition perhaps?

There is a recent computerphile video on knowlege bases.should be refered to this one

man keeping track of all these SoME 2 videos is getting harder. Dont want to leave any unwatched.

This was flawless!! I really enjoyed it! Great work!

Very interesting connection!

interesting video ! Hope you will make more in the future

What a brilliant derivation of Kirchoffs law!

This is very nice to offer as an educational tool. Thankyou

Hi, I came here from the SoME2 judging, and you have a very interesting video. I can tell that both of you know what you are talking about and are passionate about math. Definitely earned my subscription!😁

I don't understand, how the voltage change got into this, we haven't even introduced it. The (incidence).(edges of a cycle) = 0 just means that in each vertex #incoming-#outgoing edges of the cycle is 0, which kind of looks similar to the currents law (not voltage), but the implication seems to me in the opposite direction: since the charge doesn't accumulate in vertices, the current is in the span of the null space and hence can be presented as a combination of circular currents. Could you clarify all this please?

pogging

Your explanation of the connection between graphs and their matrices was very good! However, you frame Kirchhoff's law as the main result of your discussion without being explicit near the end about how the incidence matrix encodes the sum of voltages along a path of edges. While still hinted at in the main discussion, this makes the loop law seem to appear out of nowhere. You're video is great, but your recap could have been oriented toward summarizing your discussion in light of your circuit representation. This would have clarified the result.

Feedback: Circuit in physics is not the same as circuit in graph theory. So you cannot say it is a math topic in the beginning. Other than this, the flow is quite smooth, and the topic is quite interesting. Also the presentation about the relationship between graph and its matrix is very clean and clear. Further reading: R. J. Wilson, Introduction to Graph Theory; J. Clark and D.A. Holton, A First Look at Graph Theory